Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716904889225

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-28 14:01:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 14:01:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:01:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 14:01:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:01:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 641 ms
[2024-05-28 14:01:31] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2024-05-28 14:01:31] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 14:01:31] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (21 resets) in 2281 ms. (17 steps per ms) remains 51/77 properties
BEST_FIRST walk for 4000 steps (8 resets) in 204 ms. (19 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (9 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (9 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (9 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (9 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (9 resets) in 22 ms. (173 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (10 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (9 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
[2024-05-28 14:01:32] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:01:32] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 14:01:32] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp66 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 46 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 3 (OVERLAPS) 15/70 variables, 8/12 constraints. Problems are: Problem set: 32 solved, 18 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/14 constraints. Problems are: Problem set: 37 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 37 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/71 variables, 1/15 constraints. Problems are: Problem set: 37 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 37 solved, 13 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 50 solved, 0 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 509ms problems are : Problem set: 50 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 50 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:01:33] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 14:01:33] [INFO ] Flatten gal took : 28 ms
[2024-05-28 14:01:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:01:33] [INFO ] Flatten gal took : 8 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:01:33] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 34 ms.
[2024-05-28 14:01:33] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 420 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Applied a total of 0 rules in 18 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:01:33] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-28 14:01:33] [INFO ] Computed 50 invariants in 64 ms
[2024-05-28 14:01:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:01:42] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 15 ms to minimize.
[2024-05-28 14:01:42] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:01:42] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:01:42] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:01:42] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:01:43] [INFO ] Deduced a trap composed of 280 places in 227 ms of which 4 ms to minimize.
[2024-05-28 14:01:43] [INFO ] Deduced a trap composed of 280 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:01:43] [INFO ] Deduced a trap composed of 146 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:01:44] [INFO ] Deduced a trap composed of 292 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:01:44] [INFO ] Deduced a trap composed of 298 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:01:44] [INFO ] Deduced a trap composed of 268 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:01:45] [INFO ] Deduced a trap composed of 261 places in 279 ms of which 4 ms to minimize.
[2024-05-28 14:01:45] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:01:56] [INFO ] Deduced a trap composed of 277 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-28 14:02:02] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:02:02] [INFO ] Deduced a trap composed of 371 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:02:02] [INFO ] Deduced a trap composed of 361 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:02:02] [INFO ] Deduced a trap composed of 369 places in 225 ms of which 4 ms to minimize.
[2024-05-28 14:02:03] [INFO ] Deduced a trap composed of 362 places in 224 ms of which 4 ms to minimize.
[2024-05-28 14:02:03] [INFO ] Deduced a trap composed of 353 places in 248 ms of which 3 ms to minimize.
[2024-05-28 14:02:07] [INFO ] Deduced a trap composed of 260 places in 256 ms of which 5 ms to minimize.
[2024-05-28 14:02:07] [INFO ] Deduced a trap composed of 282 places in 280 ms of which 4 ms to minimize.
[2024-05-28 14:02:08] [INFO ] Deduced a trap composed of 263 places in 282 ms of which 6 ms to minimize.
[2024-05-28 14:02:08] [INFO ] Deduced a trap composed of 250 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:02:08] [INFO ] Deduced a trap composed of 289 places in 255 ms of which 4 ms to minimize.
[2024-05-28 14:02:08] [INFO ] Deduced a trap composed of 293 places in 229 ms of which 4 ms to minimize.
[2024-05-28 14:02:09] [INFO ] Deduced a trap composed of 264 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 74 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 28/28 constraints]
After SMT, in 41369ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41387ms
[2024-05-28 14:02:15] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:02:15] [INFO ] Invariant cache hit.
[2024-05-28 14:02:15] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-28 14:02:15] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:02:15] [INFO ] Invariant cache hit.
[2024-05-28 14:02:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:02:18] [INFO ] Implicit Places using invariants and state equation in 3074 ms returned []
Implicit Place search using SMT with State Equation took 3374 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:02:18] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:02:18] [INFO ] Invariant cache hit.
[2024-05-28 14:02:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:02:28] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-28 14:02:28] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:02:28] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:02:28] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:02:28] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 3 ms to minimize.
[2024-05-28 14:02:28] [INFO ] Deduced a trap composed of 294 places in 258 ms of which 3 ms to minimize.
[2024-05-28 14:02:29] [INFO ] Deduced a trap composed of 294 places in 274 ms of which 3 ms to minimize.
[2024-05-28 14:02:29] [INFO ] Deduced a trap composed of 146 places in 216 ms of which 4 ms to minimize.
[2024-05-28 14:02:29] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:02:30] [INFO ] Deduced a trap composed of 286 places in 286 ms of which 4 ms to minimize.
[2024-05-28 14:02:30] [INFO ] Deduced a trap composed of 269 places in 322 ms of which 6 ms to minimize.
[2024-05-28 14:02:31] [INFO ] Deduced a trap composed of 286 places in 311 ms of which 5 ms to minimize.
[2024-05-28 14:02:31] [INFO ] Deduced a trap composed of 317 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:02:31] [INFO ] Deduced a trap composed of 368 places in 244 ms of which 4 ms to minimize.
[2024-05-28 14:02:32] [INFO ] Deduced a trap composed of 339 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:02:32] [INFO ] Deduced a trap composed of 297 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:02:32] [INFO ] Deduced a trap composed of 292 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:02:32] [INFO ] Deduced a trap composed of 260 places in 256 ms of which 4 ms to minimize.
[2024-05-28 14:02:41] [INFO ] Deduced a trap composed of 275 places in 291 ms of which 5 ms to minimize.
[2024-05-28 14:02:41] [INFO ] Deduced a trap composed of 269 places in 219 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:02:50] [INFO ] Deduced a trap composed of 270 places in 269 ms of which 4 ms to minimize.
SMT process timed out in 31867ms, After SMT, problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 31894ms
Finished structural reductions in LTL mode , in 1 iterations and 76697 ms. Remains : 536/536 places, 968/968 transitions.
Support contains 420 out of 536 places after structural reductions.
[2024-05-28 14:02:50] [INFO ] Flatten gal took : 108 ms
[2024-05-28 14:02:50] [INFO ] Flatten gal took : 85 ms
[2024-05-28 14:02:50] [INFO ] Input system was already deterministic with 968 transitions.
RANDOM walk for 40000 steps (11 resets) in 1439 ms. (27 steps per ms) remains 32/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 32/32 properties
[2024-05-28 14:02:51] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:02:51] [INFO ] Invariant cache hit.
[2024-05-28 14:02:51] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp22 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 6/7 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 30 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 3 (OVERLAPS) 182/488 variables, 14/21 constraints. Problems are: Problem set: 25 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 3/24 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 0/24 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/490 variables, 2/26 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/26 constraints. Problems are: Problem set: 28 solved, 4 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
After SMT solving in domain Real declared 536/1492 variables, and 50 constraints, problems are : Problem set: 32 solved, 0 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 32 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 32 atomic propositions for a total of 11 simplifications.
[2024-05-28 14:02:52] [INFO ] Flatten gal took : 48 ms
[2024-05-28 14:02:52] [INFO ] Flatten gal took : 44 ms
[2024-05-28 14:02:52] [INFO ] Input system was already deterministic with 968 transitions.
Support contains 81 out of 536 places (down from 95) after GAL structural reductions.
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 70 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:02:52] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-28 14:02:52] [INFO ] Computed 48 invariants in 27 ms
[2024-05-28 14:02:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:03:01] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:03:01] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:03:01] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2024-05-28 14:03:01] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:03:01] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:03:02] [INFO ] Deduced a trap composed of 292 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:03:02] [INFO ] Deduced a trap composed of 304 places in 270 ms of which 3 ms to minimize.
[2024-05-28 14:03:03] [INFO ] Deduced a trap composed of 281 places in 326 ms of which 44 ms to minimize.
[2024-05-28 14:03:03] [INFO ] Deduced a trap composed of 240 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:03:03] [INFO ] Deduced a trap composed of 124 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:03:03] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:03:04] [INFO ] Deduced a trap composed of 281 places in 283 ms of which 4 ms to minimize.
[2024-05-28 14:03:04] [INFO ] Deduced a trap composed of 243 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:03:13] [INFO ] Deduced a trap composed of 221 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:03:15] [INFO ] Deduced a trap composed of 221 places in 253 ms of which 4 ms to minimize.
[2024-05-28 14:03:21] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-28 14:03:21] [INFO ] Deduced a trap composed of 276 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:03:21] [INFO ] Deduced a trap composed of 354 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:03:25] [INFO ] Deduced a trap composed of 272 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:03:25] [INFO ] Deduced a trap composed of 246 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:03:26] [INFO ] Deduced a trap composed of 277 places in 261 ms of which 4 ms to minimize.
[2024-05-28 14:03:26] [INFO ] Deduced a trap composed of 62 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 68 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 22/22 constraints]
After SMT, in 41128ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41141ms
[2024-05-28 14:03:33] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:03:33] [INFO ] Invariant cache hit.
[2024-05-28 14:03:34] [INFO ] Implicit Places using invariants in 416 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 420 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 10 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41646 ms. Remains : 516/536 places, 956/968 transitions.
[2024-05-28 14:03:34] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:03:34] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:03:34] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-28 14:03:34] [INFO ] Flatten gal took : 30 ms
[2024-05-28 14:03:34] [INFO ] Flatten gal took : 30 ms
[2024-05-28 14:03:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality7365565224195713923.gal : 37 ms
[2024-05-28 14:03:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality2497965696794567056.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/CTLCardinality7365565224195713923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2497965696794567056.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 83 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:04:35] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:04:35] [INFO ] Invariant cache hit.
[2024-05-28 14:04:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 3 ms to minimize.
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:04:44] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:04:45] [INFO ] Deduced a trap composed of 293 places in 273 ms of which 4 ms to minimize.
[2024-05-28 14:04:45] [INFO ] Deduced a trap composed of 267 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:04:45] [INFO ] Deduced a trap composed of 254 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:04:46] [INFO ] Deduced a trap composed of 126 places in 219 ms of which 4 ms to minimize.
[2024-05-28 14:04:46] [INFO ] Deduced a trap composed of 146 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:04:46] [INFO ] Deduced a trap composed of 320 places in 250 ms of which 4 ms to minimize.
[2024-05-28 14:04:47] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:04:47] [INFO ] Deduced a trap composed of 264 places in 276 ms of which 4 ms to minimize.
[2024-05-28 14:04:48] [INFO ] Deduced a trap composed of 286 places in 269 ms of which 4 ms to minimize.
[2024-05-28 14:04:48] [INFO ] Deduced a trap composed of 284 places in 253 ms of which 4 ms to minimize.
[2024-05-28 14:04:48] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 3 ms to minimize.
[2024-05-28 14:04:48] [INFO ] Deduced a trap composed of 305 places in 312 ms of which 6 ms to minimize.
[2024-05-28 14:04:49] [INFO ] Deduced a trap composed of 346 places in 250 ms of which 4 ms to minimize.
[2024-05-28 14:04:49] [INFO ] Deduced a trap composed of 260 places in 198 ms of which 3 ms to minimize.
[2024-05-28 14:04:49] [INFO ] Deduced a trap composed of 283 places in 229 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:04:50] [INFO ] Deduced a trap composed of 300 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:04:51] [INFO ] Deduced a trap composed of 273 places in 255 ms of which 4 ms to minimize.
[2024-05-28 14:04:51] [INFO ] Deduced a trap composed of 299 places in 255 ms of which 4 ms to minimize.
[2024-05-28 14:04:52] [INFO ] Deduced a trap composed of 273 places in 251 ms of which 4 ms to minimize.
[2024-05-28 14:04:52] [INFO ] Deduced a trap composed of 288 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:04:52] [INFO ] Deduced a trap composed of 355 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:04:52] [INFO ] Deduced a trap composed of 268 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:04:55] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 74 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 28/74 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:05:03] [INFO ] Deduced a trap composed of 349 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 356 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:05:07] [INFO ] Deduced a trap composed of 246 places in 282 ms of which 4 ms to minimize.
[2024-05-28 14:05:10] [INFO ] Deduced a trap composed of 285 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 78 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 32/32 constraints]
After SMT, in 41030ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41043ms
[2024-05-28 14:05:16] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:05:16] [INFO ] Invariant cache hit.
[2024-05-28 14:05:17] [INFO ] Implicit Places using invariants in 341 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 352 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41490 ms. Remains : 516/536 places, 956/968 transitions.
[2024-05-28 14:05:17] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:05:17] [INFO ] Flatten gal took : 56 ms
[2024-05-28 14:05:17] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-28 14:05:17] [INFO ] Flatten gal took : 40 ms
[2024-05-28 14:05:17] [INFO ] Flatten gal took : 30 ms
[2024-05-28 14:05:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality5621191325559702249.gal : 20 ms
[2024-05-28 14:05:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality7321595181470243484.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/CTLCardinality5621191325559702249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7321595181470243484.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:05:47] [INFO ] Flatten gal took : 81 ms
[2024-05-28 14:05:47] [INFO ] Applying decomposition
[2024-05-28 14:05:47] [INFO ] Flatten gal took : 42 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/graph6369256054369361653.txt' '-o' '/tmp/graph6369256054369361653.bin' '-w' '/tmp/graph6369256054369361653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6369256054369361653.bin' '-l' '-1' '-v' '-w' '/tmp/graph6369256054369361653.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:05:48] [INFO ] Decomposing Gal with order
[2024-05-28 14:05:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:05:48] [INFO ] Removed a total of 805 redundant transitions.
[2024-05-28 14:05:48] [INFO ] Flatten gal took : 120 ms
[2024-05-28 14:05:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 24 ms.
[2024-05-28 14:05:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality7696320024157811723.gal : 10 ms
[2024-05-28 14:05:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality2858018854715897418.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/CTLCardinality7696320024157811723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2858018854715897418.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 534 transition count 938
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 504 transition count 932
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 498 transition count 932
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 72 place count 498 transition count 878
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 180 place count 444 transition count 878
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 264 place count 402 transition count 836
Applied a total of 264 rules in 134 ms. Remains 402 /536 variables (removed 134) and now considering 836/968 (removed 132) transitions.
Running 834 sub problems to find dead transitions.
[2024-05-28 14:06:18] [INFO ] Flow matrix only has 824 transitions (discarded 12 similar events)
// Phase 1: matrix 824 rows 402 cols
[2024-05-28 14:06:18] [INFO ] Computed 48 invariants in 11 ms
[2024-05-28 14:06:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 14:06:24] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 3 ms to minimize.
[2024-05-28 14:06:24] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2024-05-28 14:06:24] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:06:24] [INFO ] Deduced a trap composed of 51 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:06:24] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:06:24] [INFO ] Deduced a trap composed of 181 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:06:25] [INFO ] Deduced a trap composed of 148 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:06:25] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:06:26] [INFO ] Deduced a trap composed of 242 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:06:30] [INFO ] Deduced a trap composed of 140 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:06:31] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 14:06:37] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1226 variables, and 58 constraints, problems are : Problem set: 0 solved, 834 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/402 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 834/834 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 14:06:43] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 173 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 154 places in 270 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 14:06:59] [INFO ] Deduced a trap composed of 144 places in 230 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1226 variables, and 62 constraints, problems are : Problem set: 0 solved, 834 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/402 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/834 constraints, Known Traps: 16/16 constraints]
After SMT, in 41045ms problems are : Problem set: 0 solved, 834 unsolved
Search for dead transitions found 0 dead transitions in 41057ms
[2024-05-28 14:06:59] [INFO ] Flow matrix only has 824 transitions (discarded 12 similar events)
[2024-05-28 14:06:59] [INFO ] Invariant cache hit.
[2024-05-28 14:06:59] [INFO ] Implicit Places using invariants in 327 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 329 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 396/536 places, 836/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 390 transition count 830
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 390 transition count 830
Applied a total of 12 rules in 38 ms. Remains 390 /396 variables (removed 6) and now considering 830/836 (removed 6) transitions.
[2024-05-28 14:07:00] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
// Phase 1: matrix 818 rows 390 cols
[2024-05-28 14:07:00] [INFO ] Computed 42 invariants in 17 ms
[2024-05-28 14:07:00] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-28 14:07:00] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2024-05-28 14:07:00] [INFO ] Invariant cache hit.
[2024-05-28 14:07:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:07:03] [INFO ] Implicit Places using invariants and state equation in 2926 ms returned []
Implicit Place search using SMT with State Equation took 3463 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 390/536 places, 830/968 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 45023 ms. Remains : 390/536 places, 830/968 transitions.
[2024-05-28 14:07:03] [INFO ] Flatten gal took : 22 ms
[2024-05-28 14:07:03] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:07:03] [INFO ] Input system was already deterministic with 830 transitions.
[2024-05-28 14:07:03] [INFO ] Flatten gal took : 51 ms
[2024-05-28 14:07:03] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:07:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality8761200622820415099.gal : 4 ms
[2024-05-28 14:07:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality2206586767842322112.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/CTLCardinality8761200622820415099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2206586767842322112.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:07:33] [INFO ] Flatten gal took : 49 ms
[2024-05-28 14:07:33] [INFO ] Applying decomposition
[2024-05-28 14:07:33] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17878366937366074670.txt' '-o' '/tmp/graph17878366937366074670.bin' '-w' '/tmp/graph17878366937366074670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17878366937366074670.bin' '-l' '-1' '-v' '-w' '/tmp/graph17878366937366074670.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:07:33] [INFO ] Decomposing Gal with order
[2024-05-28 14:07:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:07:34] [INFO ] Removed a total of 499 redundant transitions.
[2024-05-28 14:07:34] [INFO ] Flatten gal took : 92 ms
[2024-05-28 14:07:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 584 labels/synchronizations in 24 ms.
[2024-05-28 14:07:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality3442016105123615570.gal : 8 ms
[2024-05-28 14:07:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality3671444717522320261.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/CTLCardinality3442016105123615570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3671444717522320261.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Applied a total of 14 rules in 15 ms. Remains 528 /536 variables (removed 8) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-05-28 14:08:04] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 528 cols
[2024-05-28 14:08:04] [INFO ] Computed 48 invariants in 11 ms
[2024-05-28 14:08:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 14 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:08:12] [INFO ] Deduced a trap composed of 261 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:08:12] [INFO ] Deduced a trap composed of 149 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:08:12] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:08:12] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:08:13] [INFO ] Deduced a trap composed of 303 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:08:14] [INFO ] Deduced a trap composed of 278 places in 251 ms of which 4 ms to minimize.
[2024-05-28 14:08:14] [INFO ] Deduced a trap composed of 282 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:08:21] [INFO ] Deduced a trap composed of 274 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:08:21] [INFO ] Deduced a trap composed of 275 places in 233 ms of which 4 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 247 places in 235 ms of which 4 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 284 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 269 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 290 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 286 places in 242 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1478 variables, and 65 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:08:27] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
[2024-05-28 14:08:31] [INFO ] Deduced a trap composed of 260 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 275 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 281 places in 262 ms of which 6 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 271 places in 307 ms of which 4 ms to minimize.
[2024-05-28 14:08:33] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 283 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1478 variables, and 72 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 26/26 constraints]
After SMT, in 41046ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 41056ms
[2024-05-28 14:08:45] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-05-28 14:08:45] [INFO ] Invariant cache hit.
[2024-05-28 14:08:45] [INFO ] Implicit Places using invariants in 282 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 288 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 522/536 places, 962/968 transitions.
Applied a total of 0 rules in 10 ms. Remains 522 /522 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41371 ms. Remains : 522/536 places, 962/968 transitions.
[2024-05-28 14:08:45] [INFO ] Flatten gal took : 43 ms
[2024-05-28 14:08:46] [INFO ] Flatten gal took : 157 ms
[2024-05-28 14:08:46] [INFO ] Input system was already deterministic with 962 transitions.
[2024-05-28 14:08:46] [INFO ] Flatten gal took : 59 ms
[2024-05-28 14:08:46] [INFO ] Flatten gal took : 46 ms
[2024-05-28 14:08:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality9495191034991957542.gal : 6 ms
[2024-05-28 14:08:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality12347017149642078289.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/CTLCardinality9495191034991957542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12347017149642078289.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Applied a total of 14 rules in 27 ms. Remains 528 /536 variables (removed 8) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-05-28 14:09:46] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-05-28 14:09:46] [INFO ] Invariant cache hit.
[2024-05-28 14:09:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:09:55] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:09:55] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:09:55] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:09:55] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 2 ms to minimize.
[2024-05-28 14:09:55] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 2 ms to minimize.
[2024-05-28 14:09:56] [INFO ] Deduced a trap composed of 272 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:09:56] [INFO ] Deduced a trap composed of 277 places in 332 ms of which 4 ms to minimize.
[2024-05-28 14:09:56] [INFO ] Deduced a trap composed of 113 places in 239 ms of which 4 ms to minimize.
[2024-05-28 14:09:57] [INFO ] Deduced a trap composed of 135 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:09:57] [INFO ] Deduced a trap composed of 127 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:09:57] [INFO ] Deduced a trap composed of 305 places in 317 ms of which 4 ms to minimize.
[2024-05-28 14:09:58] [INFO ] Deduced a trap composed of 265 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:09:58] [INFO ] Deduced a trap composed of 294 places in 238 ms of which 4 ms to minimize.
[2024-05-28 14:09:59] [INFO ] Deduced a trap composed of 268 places in 263 ms of which 4 ms to minimize.
[2024-05-28 14:09:59] [INFO ] Deduced a trap composed of 287 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:09:59] [INFO ] Deduced a trap composed of 316 places in 173 ms of which 2 ms to minimize.
[2024-05-28 14:09:59] [INFO ] Deduced a trap composed of 287 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:10:00] [INFO ] Deduced a trap composed of 256 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:10:00] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
[2024-05-28 14:10:07] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1478 variables, and 66 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:10:09] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 3 ms to minimize.
[2024-05-28 14:10:09] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-28 14:10:15] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:10:17] [INFO ] Deduced a trap composed of 274 places in 263 ms of which 4 ms to minimize.
[2024-05-28 14:10:17] [INFO ] Deduced a trap composed of 247 places in 166 ms of which 4 ms to minimize.
[2024-05-28 14:10:17] [INFO ] Deduced a trap composed of 284 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:10:18] [INFO ] Deduced a trap composed of 262 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:10:19] [INFO ] Deduced a trap composed of 386 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:10:19] [INFO ] Deduced a trap composed of 320 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:10:20] [INFO ] Deduced a trap composed of 313 places in 213 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:10:26] [INFO ] Deduced a trap composed of 349 places in 253 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1478 variables, and 77 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 31/31 constraints]
After SMT, in 41114ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 41132ms
[2024-05-28 14:10:27] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-05-28 14:10:27] [INFO ] Invariant cache hit.
[2024-05-28 14:10:28] [INFO ] Implicit Places using invariants in 446 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 450 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 522/536 places, 962/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 522 /522 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41620 ms. Remains : 522/536 places, 962/968 transitions.
[2024-05-28 14:10:28] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:10:28] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:10:28] [INFO ] Input system was already deterministic with 962 transitions.
[2024-05-28 14:10:28] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:10:28] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:10:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality17787632008567543155.gal : 5 ms
[2024-05-28 14:10:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality14525920673418298479.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/CTLCardinality17787632008567543155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14525920673418298479.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:10:58] [INFO ] Flatten gal took : 58 ms
[2024-05-28 14:10:58] [INFO ] Applying decomposition
[2024-05-28 14:10:58] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8152664892095580431.txt' '-o' '/tmp/graph8152664892095580431.bin' '-w' '/tmp/graph8152664892095580431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8152664892095580431.bin' '-l' '-1' '-v' '-w' '/tmp/graph8152664892095580431.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:10:58] [INFO ] Decomposing Gal with order
[2024-05-28 14:10:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:10:59] [INFO ] Removed a total of 779 redundant transitions.
[2024-05-28 14:10:59] [INFO ] Flatten gal took : 165 ms
[2024-05-28 14:10:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 13 ms.
[2024-05-28 14:10:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality12475357432362633973.gal : 9 ms
[2024-05-28 14:10:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12593270723982488363.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/CTLCardinality12475357432362633973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12593270723982488363.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 37 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:11:29] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-28 14:11:29] [INFO ] Computed 48 invariants in 14 ms
[2024-05-28 14:11:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:11:37] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-05-28 14:11:37] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:11:38] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:11:38] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:11:38] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 2 ms to minimize.
[2024-05-28 14:11:38] [INFO ] Deduced a trap composed of 292 places in 239 ms of which 4 ms to minimize.
[2024-05-28 14:11:38] [INFO ] Deduced a trap composed of 304 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:11:39] [INFO ] Deduced a trap composed of 281 places in 244 ms of which 4 ms to minimize.
[2024-05-28 14:11:39] [INFO ] Deduced a trap composed of 240 places in 245 ms of which 3 ms to minimize.
[2024-05-28 14:11:39] [INFO ] Deduced a trap composed of 124 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:11:39] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:11:40] [INFO ] Deduced a trap composed of 281 places in 283 ms of which 4 ms to minimize.
[2024-05-28 14:11:40] [INFO ] Deduced a trap composed of 243 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:11:48] [INFO ] Deduced a trap composed of 221 places in 206 ms of which 4 ms to minimize.
[2024-05-28 14:11:50] [INFO ] Deduced a trap composed of 214 places in 209 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:11:52] [INFO ] Deduced a trap composed of 290 places in 196 ms of which 5 ms to minimize.
[2024-05-28 14:11:56] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 3 ms to minimize.
[2024-05-28 14:12:00] [INFO ] Deduced a trap composed of 270 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:12:01] [INFO ] Deduced a trap composed of 274 places in 282 ms of which 4 ms to minimize.
[2024-05-28 14:12:01] [INFO ] Deduced a trap composed of 62 places in 273 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:12:08] [INFO ] Deduced a trap composed of 259 places in 206 ms of which 2 ms to minimize.
[2024-05-28 14:12:09] [INFO ] Deduced a trap composed of 358 places in 164 ms of which 3 ms to minimize.
[2024-05-28 14:12:09] [INFO ] Deduced a trap composed of 323 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:12:09] [INFO ] Deduced a trap composed of 274 places in 235 ms of which 4 ms to minimize.
[2024-05-28 14:12:09] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:12:10] [INFO ] Deduced a trap composed of 313 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:12:10] [INFO ] Deduced a trap composed of 278 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:12:10] [INFO ] Deduced a trap composed of 359 places in 217 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 74 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 28/28 constraints]
After SMT, in 41363ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41383ms
[2024-05-28 14:12:10] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:12:10] [INFO ] Invariant cache hit.
[2024-05-28 14:12:11] [INFO ] Implicit Places using invariants in 402 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 416 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41847 ms. Remains : 516/536 places, 956/968 transitions.
[2024-05-28 14:12:11] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:12:11] [INFO ] Flatten gal took : 28 ms
[2024-05-28 14:12:11] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-28 14:12:11] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:12:11] [INFO ] Flatten gal took : 28 ms
[2024-05-28 14:12:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality8641210662191734205.gal : 4 ms
[2024-05-28 14:12:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality12852790605715436901.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/CTLCardinality8641210662191734205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12852790605715436901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:12:41] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:12:41] [INFO ] Applying decomposition
[2024-05-28 14:12:41] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2584939939860057588.txt' '-o' '/tmp/graph2584939939860057588.bin' '-w' '/tmp/graph2584939939860057588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2584939939860057588.bin' '-l' '-1' '-v' '-w' '/tmp/graph2584939939860057588.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:12:41] [INFO ] Decomposing Gal with order
[2024-05-28 14:12:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:12:41] [INFO ] Removed a total of 820 redundant transitions.
[2024-05-28 14:12:41] [INFO ] Flatten gal took : 81 ms
[2024-05-28 14:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 10 ms.
[2024-05-28 14:12:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2644434387797385265.gal : 9 ms
[2024-05-28 14:12:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4094162549625871064.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/CTLCardinality2644434387797385265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4094162549625871064.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 40 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:13:12] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:13:12] [INFO ] Invariant cache hit.
[2024-05-28 14:13:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 293 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:13:21] [INFO ] Deduced a trap composed of 267 places in 227 ms of which 4 ms to minimize.
[2024-05-28 14:13:21] [INFO ] Deduced a trap composed of 254 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:13:21] [INFO ] Deduced a trap composed of 126 places in 184 ms of which 4 ms to minimize.
[2024-05-28 14:13:21] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:13:22] [INFO ] Deduced a trap composed of 320 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:13:22] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:13:23] [INFO ] Deduced a trap composed of 264 places in 275 ms of which 5 ms to minimize.
[2024-05-28 14:13:23] [INFO ] Deduced a trap composed of 286 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:13:23] [INFO ] Deduced a trap composed of 284 places in 224 ms of which 4 ms to minimize.
[2024-05-28 14:13:23] [INFO ] Deduced a trap composed of 298 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:13:23] [INFO ] Deduced a trap composed of 305 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:13:24] [INFO ] Deduced a trap composed of 346 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:13:24] [INFO ] Deduced a trap composed of 260 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:13:24] [INFO ] Deduced a trap composed of 283 places in 245 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:13:25] [INFO ] Deduced a trap composed of 300 places in 264 ms of which 4 ms to minimize.
[2024-05-28 14:13:25] [INFO ] Deduced a trap composed of 273 places in 206 ms of which 2 ms to minimize.
[2024-05-28 14:13:26] [INFO ] Deduced a trap composed of 299 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:13:26] [INFO ] Deduced a trap composed of 273 places in 289 ms of which 4 ms to minimize.
[2024-05-28 14:13:27] [INFO ] Deduced a trap composed of 288 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:13:27] [INFO ] Deduced a trap composed of 355 places in 260 ms of which 4 ms to minimize.
[2024-05-28 14:13:27] [INFO ] Deduced a trap composed of 268 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:13:30] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 74 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 28/74 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:13:40] [INFO ] Deduced a trap composed of 349 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:13:40] [INFO ] Deduced a trap composed of 356 places in 250 ms of which 3 ms to minimize.
[2024-05-28 14:13:44] [INFO ] Deduced a trap composed of 246 places in 250 ms of which 4 ms to minimize.
[2024-05-28 14:13:46] [INFO ] Deduced a trap composed of 285 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 78 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 32/32 constraints]
After SMT, in 41235ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41252ms
[2024-05-28 14:13:53] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:13:53] [INFO ] Invariant cache hit.
[2024-05-28 14:13:53] [INFO ] Implicit Places using invariants in 287 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 290 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41594 ms. Remains : 516/536 places, 956/968 transitions.
[2024-05-28 14:13:53] [INFO ] Flatten gal took : 26 ms
[2024-05-28 14:13:53] [INFO ] Flatten gal took : 28 ms
[2024-05-28 14:13:53] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-28 14:13:53] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:13:53] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:13:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality4630374264374377798.gal : 8 ms
[2024-05-28 14:13:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality15547682657684990972.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/CTLCardinality4630374264374377798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15547682657684990972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 534 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 480 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 480 transition count 854
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 420 transition count 854
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 312 place count 378 transition count 812
Applied a total of 312 rules in 77 ms. Remains 378 /536 variables (removed 158) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:14:54] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 378 cols
[2024-05-28 14:14:54] [INFO ] Computed 48 invariants in 9 ms
[2024-05-28 14:14:54] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:15:00] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:15:00] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:15:00] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:15:00] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:15:00] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 230 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:15:03] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 7.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 21151ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 21161ms
[2024-05-28 14:15:15] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:15:15] [INFO ] Invariant cache hit.
[2024-05-28 14:15:16] [INFO ] Implicit Places using invariants in 355 ms returned [336, 337, 338, 339, 340, 341]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 357 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 372/536 places, 812/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 366 transition count 806
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 366 transition count 806
Applied a total of 12 rules in 25 ms. Remains 366 /372 variables (removed 6) and now considering 806/812 (removed 6) transitions.
[2024-05-28 14:15:16] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2024-05-28 14:15:16] [INFO ] Computed 42 invariants in 8 ms
[2024-05-28 14:15:16] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-28 14:15:16] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:15:16] [INFO ] Invariant cache hit.
[2024-05-28 14:15:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:15:19] [INFO ] Implicit Places using invariants and state equation in 3279 ms returned []
Implicit Place search using SMT with State Equation took 3577 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 366/536 places, 806/968 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 25201 ms. Remains : 366/536 places, 806/968 transitions.
[2024-05-28 14:15:19] [INFO ] Flatten gal took : 47 ms
[2024-05-28 14:15:19] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:15:19] [INFO ] Input system was already deterministic with 806 transitions.
[2024-05-28 14:15:19] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:15:19] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:15:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12079272470451774152.gal : 5 ms
[2024-05-28 14:15:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality1717831794053764073.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/CTLCardinality12079272470451774152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1717831794053764073.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 38 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:16:20] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-28 14:16:20] [INFO ] Computed 48 invariants in 27 ms
[2024-05-28 14:16:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:16:29] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:16:30] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:16:30] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:16:30] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 3 ms to minimize.
[2024-05-28 14:16:30] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 14 ms to minimize.
[2024-05-28 14:16:30] [INFO ] Deduced a trap composed of 292 places in 364 ms of which 4 ms to minimize.
[2024-05-28 14:16:31] [INFO ] Deduced a trap composed of 304 places in 434 ms of which 7 ms to minimize.
[2024-05-28 14:16:31] [INFO ] Deduced a trap composed of 281 places in 373 ms of which 4 ms to minimize.
[2024-05-28 14:16:32] [INFO ] Deduced a trap composed of 240 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:16:32] [INFO ] Deduced a trap composed of 124 places in 192 ms of which 4 ms to minimize.
[2024-05-28 14:16:32] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:16:33] [INFO ] Deduced a trap composed of 281 places in 294 ms of which 8 ms to minimize.
[2024-05-28 14:16:33] [INFO ] Deduced a trap composed of 243 places in 287 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:16:43] [INFO ] Deduced a trap composed of 265 places in 261 ms of which 4 ms to minimize.
[2024-05-28 14:16:44] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-28 14:16:50] [INFO ] Deduced a trap composed of 260 places in 299 ms of which 4 ms to minimize.
[2024-05-28 14:16:50] [INFO ] Deduced a trap composed of 275 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:16:50] [INFO ] Deduced a trap composed of 350 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:16:51] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:16:54] [INFO ] Deduced a trap composed of 271 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:16:54] [INFO ] Deduced a trap composed of 259 places in 293 ms of which 3 ms to minimize.
[2024-05-28 14:16:54] [INFO ] Deduced a trap composed of 266 places in 379 ms of which 6 ms to minimize.
[2024-05-28 14:16:55] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:16:57] [INFO ] Deduced a trap composed of 366 places in 283 ms of which 4 ms to minimize.
[2024-05-28 14:16:57] [INFO ] Deduced a trap composed of 293 places in 276 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 71 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 25/25 constraints]
After SMT, in 41180ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41196ms
[2024-05-28 14:17:01] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:17:01] [INFO ] Invariant cache hit.
[2024-05-28 14:17:02] [INFO ] Implicit Places using invariants in 378 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 381 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41625 ms. Remains : 516/536 places, 956/968 transitions.
[2024-05-28 14:17:02] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:17:02] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:17:02] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-28 14:17:02] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:17:02] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:17:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality128449226899227261.gal : 5 ms
[2024-05-28 14:17:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality1203329739649401748.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/CTLCardinality128449226899227261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1203329739649401748.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:18:03] [INFO ] Flatten gal took : 58 ms
[2024-05-28 14:18:03] [INFO ] Flatten gal took : 45 ms
[2024-05-28 14:18:03] [INFO ] Applying decomposition
[2024-05-28 14:18:03] [INFO ] Flatten gal took : 36 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/graph16986748749220393503.txt' '-o' '/tmp/graph16986748749220393503.bin' '-w' '/tmp/graph16986748749220393503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16986748749220393503.bin' '-l' '-1' '-v' '-w' '/tmp/graph16986748749220393503.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:18:03] [INFO ] Decomposing Gal with order
[2024-05-28 14:18:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:18:03] [INFO ] Removed a total of 1144 redundant transitions.
[2024-05-28 14:18:03] [INFO ] Flatten gal took : 91 ms
[2024-05-28 14:18:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 426 labels/synchronizations in 16 ms.
[2024-05-28 14:18:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality12731997866419452898.gal : 8 ms
[2024-05-28 14:18:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality16902494393476092988.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/CTLCardinality12731997866419452898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16902494393476092988.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 9 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.54963e+08,1087.21,9785208,2,459089,5,3.21935e+07,6,0,3239,1.46843e+07,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,1087.41,9785208,1,0,6,3.21935e+07,7,1,4761,1.46843e+07,1
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-28 14:43:34] [INFO ] Applying decomposition
[2024-05-28 14:43:34] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:43:34] [INFO ] Decomposing Gal with order
[2024-05-28 14:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:43:34] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],

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

its-ctl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J06T06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446300097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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