Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.8K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 40K May 18 16:42 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 LamportFastMutEx-COL-4-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716561801183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-24 14:43:22] [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-24 14:43:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 14:43:22] [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-24 14:43:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 14:43:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2024-05-24 14:43:23] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2024-05-24 14:43:23] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 14:43:23] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40004 steps (8 resets) in 1221 ms. (32 steps per ms) remains 45/77 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4009 steps (8 resets) in 14 ms. (267 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 14:43:24] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 14:43:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
After SMT solving in domain Real declared 15/32 variables, and 2 constraints, problems are : Problem set: 45 solved, 0 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 45 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 45 atomic propositions for a total of 16 simplifications.
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 14:43:24] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-24 14:43:24] [INFO ] Flatten gal took : 14 ms
[2024-05-24 14:43:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 14:43:24] [INFO ] Flatten gal took : 3 ms
Domain [pid(5), pid(5)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 14:43:24] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 21 ms.
[2024-05-24 14:43:24] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Support contains 84 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 14:43:24] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-05-24 14:43:24] [INFO ] Computed 26 invariants in 11 ms
[2024-05-24 14:43:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-24 14:43:24] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 14:43:24] [INFO ] Invariant cache hit.
[2024-05-24 14:43:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 14:43:24] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-24 14:43:24] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 14:43:24] [INFO ] Invariant cache hit.
[2024-05-24 14:43:24] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-24 14:43:25] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 17 ms to minimize.
[2024-05-24 14:43:25] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-24 14:43:25] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2024-05-24 14:43:25] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-05-24 14:43:25] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 6 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 16 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 5 solved, 171 unsolved
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 2 ms to minimize.
[2024-05-24 14:43:26] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 23 solved, 153 unsolved
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:43:27] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 14:43:28] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 8 ms to minimize.
[2024-05-24 14:43:29] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-24 14:43:29] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2024-05-24 14:43:29] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/86 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:29] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:43:29] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2024-05-24 14:43:29] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:43:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
[2024-05-24 14:43:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:43:30] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:43:30] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:43:30] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:43:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 10/96 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:43:30] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-24 14:43:30] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:43:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/100 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:31] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:43:31] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/102 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:31] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 7/109 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 7/116 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 15/131 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 5/136 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/136 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 144/246 variables, 102/238 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 40/278 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/280 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/280 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/246 variables, 0/280 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 280 constraints, problems are : Problem set: 24 solved, 152 unsolved in 14654 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 112/112 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 60/66 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/66 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/86 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 52/138 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:40] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 14:43:40] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-24 14:43:40] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-24 14:43:40] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-24 14:43:40] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:40] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 14:43:40] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:43:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/146 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/146 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 144/246 variables, 102/248 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 40/288 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 152/440 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:42] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-24 14:43:43] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-24 14:43:43] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:43:43] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:43:43] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 5/445 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:45] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:43:45] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:43:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 3/448 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:48] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:43:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:43:48] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:43:48] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-24 14:43:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:48] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 6/454 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:50] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:51] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-24 14:43:51] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 3/457 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:53] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-24 14:43:53] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/459 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 14:43:56] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:43:56] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-24 14:43:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:43:56] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
[2024-05-24 14:43:56] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:43:56] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:43:57] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 7/466 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/466 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 0/246 variables, 0/466 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 466 constraints, problems are : Problem set: 24 solved, 152 unsolved in 24747 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 146/146 constraints]
After SMT, in 39487ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 39495ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/102 places, 156/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39784 ms. Remains : 102/102 places, 156/180 transitions.
Support contains 84 out of 102 places after structural reductions.
[2024-05-24 14:44:04] [INFO ] Flatten gal took : 20 ms
[2024-05-24 14:44:04] [INFO ] Flatten gal took : 24 ms
[2024-05-24 14:44:04] [INFO ] Input system was already deterministic with 156 transitions.
RANDOM walk for 40000 steps (8 resets) in 2089 ms. (19 steps per ms) remains 34/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
[2024-05-24 14:44:05] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2024-05-24 14:44:05] [INFO ] Computed 26 invariants in 4 ms
[2024-05-24 14:44:05] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/84 variables, 20/20 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/20 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/212 variables, 84/104 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 36/140 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/140 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/230 variables, 18/158 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 6/164 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/164 constraints. Problems are: Problem set: 32 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 164 constraints, problems are : Problem set: 32 solved, 2 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 76/84 variables, 20/20 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/20 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/212 variables, 84/104 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 36/140 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 1/141 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/141 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 18/230 variables, 18/159 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 6/165 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/166 constraints. Problems are: Problem set: 32 solved, 2 unsolved
[2024-05-24 14:44:05] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:44:05] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:44:05] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:44:05] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:44:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:44:06] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:44:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:44:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:44:06] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:44:06] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:44:06] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:44:06] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Int declared 230/230 variables, and 178 constraints, problems are : Problem set: 34 solved, 0 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 2/34 constraints, Known Traps: 12/12 constraints]
After SMT, in 825ms problems are : Problem set: 34 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 34 atomic propositions for a total of 11 simplifications.
[2024-05-24 14:44:06] [INFO ] Flatten gal took : 12 ms
[2024-05-24 14:44:06] [INFO ] Flatten gal took : 10 ms
[2024-05-24 14:44:06] [INFO ] Input system was already deterministic with 156 transitions.
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 4 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:44:06] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:44:06] [INFO ] Invariant cache hit.
[2024-05-24 14:44:06] [INFO ] Implicit Places using invariants in 59 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 14:44:06] [INFO ] Flatten gal took : 8 ms
[2024-05-24 14:44:06] [INFO ] Flatten gal took : 9 ms
[2024-05-24 14:44:06] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:44:06] [INFO ] Flatten gal took : 9 ms
[2024-05-24 14:44:06] [INFO ] Flatten gal took : 10 ms
[2024-05-24 14:44:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14571720526315417754.gal : 2 ms
[2024-05-24 14:44:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality7534870439719388826.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/CTLCardinality14571720526315417754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7534870439719388826.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((EX((((P_sety_9_1+P_sety_9_2)+(P_sety_9_3+P_sety_9_4))<=1)) * A((((((P_sety_9_1+P_sety_9_2)+(P_sety_9_3+P_sety_9_4))<=((P_setbi_5_1+P_...563
=> equivalent forward existential formula: [FwdG(Init,!((EX((((P_sety_9_1+P_sety_9_2)+(P_sety_9_3+P_sety_9_4))<=1)) * !((E(!(!(!(E(TRUE U !((((((P_wait_6+P...1163
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 14:44:36] [INFO ] Flatten gal took : 15 ms
[2024-05-24 14:44:36] [INFO ] Applying decomposition
[2024-05-24 14:44:36] [INFO ] Flatten gal took : 8 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/graph5905262624308223892.txt' '-o' '/tmp/graph5905262624308223892.bin' '-w' '/tmp/graph5905262624308223892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5905262624308223892.bin' '-l' '-1' '-v' '-w' '/tmp/graph5905262624308223892.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:44:36] [INFO ] Decomposing Gal with order
[2024-05-24 14:44:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:44:36] [INFO ] Removed a total of 184 redundant transitions.
[2024-05-24 14:44:36] [INFO ] Flatten gal took : 36 ms
[2024-05-24 14:44:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 11 ms.
[2024-05-24 14:44:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1496117305131743275.gal : 4 ms
[2024-05-24 14:44:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality11020527144278845317.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/CTLCardinality1496117305131743275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11020527144278845317.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((EX((((gi0.gu9.P_sety_9_1+gi0.gu9.P_sety_9_2)+(gi0.gu9.P_sety_9_3+gi0.gu9.P_sety_9_4))<=1)) * A((((((gi0.gu9.P_sety_9_1+gi0.gu9.P_sety...843
=> equivalent forward existential formula: [FwdG(Init,!((EX((((gi0.gu9.P_sety_9_1+gi0.gu9.P_sety_9_2)+(gi0.gu9.P_sety_9_3+gi0.gu9.P_sety_9_4))<=1)) * !((E(...1643
Reverse transition relation is NOT exact ! Due to transitions gi0.t135, gi0.t123, gi1.gi0.t148, gi1.gi1.t153, gi1.gi2.t154, gi1.gi3.gu5.t18, gi1.gi3.gu6.t2...685
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:45:06] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:45:06] [INFO ] Invariant cache hit.
[2024-05-24 14:45:06] [INFO ] Implicit Places using invariants in 130 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 133 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 14:45:06] [INFO ] Flatten gal took : 8 ms
[2024-05-24 14:45:06] [INFO ] Flatten gal took : 28 ms
[2024-05-24 14:45:06] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:45:06] [INFO ] Flatten gal took : 10 ms
[2024-05-24 14:45:07] [INFO ] Flatten gal took : 8 ms
[2024-05-24 14:45:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4000239431855608798.gal : 2 ms
[2024-05-24 14:45:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17834525508605697620.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/CTLCardinality4000239431855608798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17834525508605697620.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX(EG((((P_fordo_12_1+P_fordo_12_2)+(P_fordo_12_3+P_fordo_12_4))>((P_ifxi_10_1+P_ifxi_10_2)+(P_ifxi_10_3+P_ifxi_10_4))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG((((P_fordo_12_1+P_fordo_12_2)+(P_fordo_12_3+P_fordo_12_4))>((P_ifxi_10_1+P_ifxi_10...201
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 14:45:37] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:45:37] [INFO ] Applying decomposition
[2024-05-24 14:45:37] [INFO ] Flatten gal took : 7 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/graph13369550641881946001.txt' '-o' '/tmp/graph13369550641881946001.bin' '-w' '/tmp/graph13369550641881946001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13369550641881946001.bin' '-l' '-1' '-v' '-w' '/tmp/graph13369550641881946001.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:45:37] [INFO ] Decomposing Gal with order
[2024-05-24 14:45:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:45:37] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-24 14:45:37] [INFO ] Flatten gal took : 15 ms
[2024-05-24 14:45:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 6 ms.
[2024-05-24 14:45:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality12701895159666419459.gal : 2 ms
[2024-05-24 14:45:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality3073010031267769003.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/CTLCardinality12701895159666419459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3073010031267769003.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX(EG((((gu9.P_fordo_12_1+gu9.P_fordo_12_2)+(gu9.P_fordo_12_3+gu9.P_fordo_12_4))>((gu9.P_ifxi_10_1+gu9.P_ifxi_10_2)+(gu9.P_ifxi_10_3+g...175
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG((((gu9.P_fordo_12_1+gu9.P_fordo_12_2)+(gu9.P_fordo_12_3+gu9.P_fordo_12_4))>((gu9.P...233
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.t40, gi0.gi0.t41, gi0.gi0.t42, gi0.gi0.t104, gi0.gi0.t105, gi0.gi0.t106, gi0.gi0.t107...908
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:46:07] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:46:07] [INFO ] Invariant cache hit.
[2024-05-24 14:46:07] [INFO ] Implicit Places using invariants in 106 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 107 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 14:46:07] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:46:07] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:46:07] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:46:07] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:46:07] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:46:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality11433004784587823883.gal : 1 ms
[2024-05-24 14:46:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17714111443263166552.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/CTLCardinality11433004784587823883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17714111443263166552.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.
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,1.91478e+06,5.03042,152512,2,36296,5,451632,6,0,550,632520,0


Converting to forward existential form...Done !
original formula: AX(AG(EF((((P_awaity_1+P_awaity_2)+(P_awaity_3+P_awaity_4))<=((P_ify0_4_1+P_ify0_4_2)+(P_ify0_4_3+P_ify0_4_4))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (((P_awaity_1+P_awaity_2)+(P_awaity_3+P_awaity_4))<=((P_ify0_4_1+P_ify0_4_2)+...192
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 14:46:37] [INFO ] Flatten gal took : 10 ms
[2024-05-24 14:46:37] [INFO ] Applying decomposition
[2024-05-24 14:46:37] [INFO ] Flatten gal took : 7 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/graph13716280471378982136.txt' '-o' '/tmp/graph13716280471378982136.bin' '-w' '/tmp/graph13716280471378982136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13716280471378982136.bin' '-l' '-1' '-v' '-w' '/tmp/graph13716280471378982136.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:46:37] [INFO ] Decomposing Gal with order
[2024-05-24 14:46:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:46:37] [INFO ] Removed a total of 168 redundant transitions.
[2024-05-24 14:46:37] [INFO ] Flatten gal took : 14 ms
[2024-05-24 14:46:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 6 ms.
[2024-05-24 14:46:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality18183010180920112608.gal : 1 ms
[2024-05-24 14:46:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5843390820541894698.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/CTLCardinality18183010180920112608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5843390820541894698.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AG(EF((((gu6.P_awaity_1+gu6.P_awaity_2)+(gu6.P_awaity_3+gu6.P_awaity_4))<=((gu6.P_ify0_4_1+gu6.P_ify0_4_2)+(gu6.P_ify0_4_3+gu6.P_ify0_...164
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (((gu6.P_awaity_1+gu6.P_awaity_2)+(gu6.P_awaity_3+gu6.P_awaity_4))<=((gu6.P_i...224
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gu0.t48, gi0.gi0.gu0.t49, gi0.gi0.gu0.t50, gi0.gi0.gu0.t51, gi0.gi0.gu0.t52, gi0.gi0....855
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 17 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:47:07] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:47:07] [INFO ] Invariant cache hit.
[2024-05-24 14:47:07] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 14:47:07] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:47:07] [INFO ] Invariant cache hit.
[2024-05-24 14:47:07] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 14:47:07] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-24 14:47:07] [INFO ] Redundant transitions in 4 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-24 14:47:07] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:47:07] [INFO ] Invariant cache hit.
[2024-05-24 14:47:07] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/102 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:08] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
[2024-05-24 14:47:08] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:47:08] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-24 14:47:08] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-24 14:47:08] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 14:47:08] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 14:47:08] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:09] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:47:10] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:47:11] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:47:12] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 15/101 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:13] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:47:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:47:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:13] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:47:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 11/115 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:47:14] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:15] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:47:15] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:15] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:47:16] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:47:16] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:47:16] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:47:16] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:47:16] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:16] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:47:16] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:17] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:47:17] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:17] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 128/230 variables, 102/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 36/269 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:19] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/230 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/230 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (OVERLAPS) 0/230 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 270 constraints, problems are : Problem set: 0 solved, 152 unsolved in 14273 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 106/106 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 47/132 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:22] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-24 14:47:23] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 10/143 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:24] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:24] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 128/230 variables, 102/248 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 36/284 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 152/436 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:27] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:47:27] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:47:27] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:28] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-24 14:47:28] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:47:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:47:29] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:47:29] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:47:29] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 6/445 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:31] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:47:32] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:47:32] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 14:47:32] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:47:32] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:47:32] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:34] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:35] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:47:37] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/230 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:47:40] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/230 variables, 10/464 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:47:43] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:47:43] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:47:43] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:47:43] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:47:43] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:47:43] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 14:47:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:47:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 9/473 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:47:46] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 14:47:46] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-24 14:47:46] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:47:46] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:47:46] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:47:46] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 7/480 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:49] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 14:47:51] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:47:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:47:51] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:47:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/230 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 485 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 169/169 constraints]
After SMT, in 44332ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 44334ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44576 ms. Remains : 102/102 places, 156/156 transitions.
[2024-05-24 14:47:52] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:47:52] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:47:52] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:47:52] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:47:52] [INFO ] Flatten gal took : 9 ms
[2024-05-24 14:47:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9617311976318266175.gal : 7 ms
[2024-05-24 14:47:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality17685378040134512529.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/CTLCardinality9617311976318266175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17685378040134512529.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AG(AF((((P_await_13_1+P_await_13_2)+(P_await_13_3+P_await_13_4))<=((P_setbi_24_1+P_setbi_24_2)+(P_setbi_24_3+P_setbi_24_4))))) * AF((...263
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!((((P_await_13_1+P_await_13_2)+(P_await_13_3+P_await_13_4))<=((P_setbi_2...339
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 14:48:22] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:48:22] [INFO ] Applying decomposition
[2024-05-24 14:48:22] [INFO ] Flatten gal took : 6 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/graph13245141253172485878.txt' '-o' '/tmp/graph13245141253172485878.bin' '-w' '/tmp/graph13245141253172485878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13245141253172485878.bin' '-l' '-1' '-v' '-w' '/tmp/graph13245141253172485878.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:48:22] [INFO ] Decomposing Gal with order
[2024-05-24 14:48:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:48:22] [INFO ] Removed a total of 141 redundant transitions.
[2024-05-24 14:48:22] [INFO ] Flatten gal took : 23 ms
[2024-05-24 14:48:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 9 ms.
[2024-05-24 14:48:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality4992670739291892435.gal : 2 ms
[2024-05-24 14:48:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality17897325042669762803.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/CTLCardinality4992670739291892435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17897325042669762803.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AG(AF((((gu23.P_await_13_1+gu23.P_await_13_2)+(gu23.P_await_13_3+gu23.P_await_13_4))<=((gu23.P_setbi_24_1+gu23.P_setbi_24_2)+(gu23.P_...343
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!((((gu23.P_await_13_1+gu23.P_await_13_2)+(gu23.P_await_13_3+gu23.P_await...419
Reverse transition relation is NOT exact ! Due to transitions gi0.gi4.gu0.t48, gi0.gi4.gu0.t49, gi0.gi4.gu0.t50, gi0.gi4.gu0.t52, gi0.gi4.gu0.t53, gi0.gi4....868
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:48:52] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:48:52] [INFO ] Invariant cache hit.
[2024-05-24 14:48:52] [INFO ] Implicit Places using invariants in 78 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 14:48:52] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:48:52] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:48:52] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:48:52] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:48:52] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:48:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7687101865282329213.gal : 2 ms
[2024-05-24 14:48:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality625960049565922601.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/CTLCardinality7687101865282329213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality625960049565922601.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.
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,1.91478e+06,5.0036,151728,2,36296,5,451632,6,0,550,632520,0


Converting to forward existential form...Done !
original formula: AG(AX(FALSE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(FALSE))] = FALSE
(forward)formula 0,0,6.00843,151728,1,0,6,451632,7,1,997,632520,1
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:48:58] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:48:58] [INFO ] Invariant cache hit.
[2024-05-24 14:48:58] [INFO ] Implicit Places using invariants in 62 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 14:48:58] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:48:58] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:48:58] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:48:58] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:48:58] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:48:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1149579188759089758.gal : 4 ms
[2024-05-24 14:48:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5984812326120421900.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/CTLCardinality1149579188759089758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5984812326120421900.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AX(AX(AG((((P_ifxi_10_1+P_ifxi_10_2)+(P_ifxi_10_3+P_ifxi_10_4))<=((P_awaity_1+P_awaity_2)+(P_awaity_3+P_awaity_4)))))) * AF((((P_ifyi...391
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(E(TRUE U !((((P_ifxi_10_1+P_ifxi_10_2)+(P_ifxi_10_3+P_ifxi_10_4))<=((P_awai...473
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 14:49:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:49:28] [INFO ] Applying decomposition
[2024-05-24 14:49:28] [INFO ] Flatten gal took : 5 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/graph7447659419657322929.txt' '-o' '/tmp/graph7447659419657322929.bin' '-w' '/tmp/graph7447659419657322929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7447659419657322929.bin' '-l' '-1' '-v' '-w' '/tmp/graph7447659419657322929.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:49:28] [INFO ] Decomposing Gal with order
[2024-05-24 14:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:49:28] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-24 14:49:28] [INFO ] Flatten gal took : 27 ms
[2024-05-24 14:49:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2024-05-24 14:49:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15191111214123467826.gal : 2 ms
[2024-05-24 14:49:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality9027170520613766649.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/CTLCardinality15191111214123467826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9027170520613766649.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AX(AX(AG((((gi1.gi0.gu9.P_ifxi_10_1+gi1.gi0.gu9.P_ifxi_10_2)+(gi1.gi0.gu9.P_ifxi_10_3+gi1.gi0.gu9.P_ifxi_10_4))<=((gi1.gi0.gu9.P_awai...587
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(E(TRUE U !((((gi1.gi0.gu9.P_ifxi_10_1+gi1.gi0.gu9.P_ifxi_10_2)+(gi1.gi0.gu9...669
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gu5.t8, gi1.gi0.gu6.t5, gi1.gi0.gu6.t13, gi1.gi0.gu7.t18, gi1.gi0.gu8.t23, gi1.gi0.t4...788
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:49:58] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:49:58] [INFO ] Invariant cache hit.
[2024-05-24 14:49:58] [INFO ] Implicit Places using invariants in 72 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 14:49:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:49:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:49:58] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:49:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:49:58] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:49:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality12517230866589976984.gal : 1 ms
[2024-05-24 14:49:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2333503143315100414.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/CTLCardinality12517230866589976984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2333503143315100414.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EX((AX((((P_ify0_4_1+P_ify0_4_2)+(P_ify0_4_3+P_ify0_4_4))>1)) + ((((P_CS_21_1+P_CS_21_2)+(P_CS_21_3+P_CS_21_4))<=41)&&(((P_CS_21_1+P_C...245
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(EX(!((((P_ify0_4_1+P_ify0_4_2)+(P_ify0_4_3+P_ify0_4_4))>1)))) + ((((P_CS_21_1+P_CS_2...305
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
(forward)formula 0,0,25.9231,664744,1,0,416,3.03587e+06,326,161,3801,3.07727e+06,320
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:50:25] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:50:25] [INFO ] Invariant cache hit.
[2024-05-24 14:50:25] [INFO ] Implicit Places using invariants in 73 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 74 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 14:50:25] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:50:25] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:50:25] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:50:25] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:50:25] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:50:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17236866159571562468.gal : 1 ms
[2024-05-24 14:50:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality12109207962284843479.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/CTLCardinality17236866159571562468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12109207962284843479.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.
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,1.91478e+06,4.88501,151712,2,36296,5,451632,6,0,550,632520,0


Converting to forward existential form...Done !
original formula: AX(AG((EF((((P_awaity_1+P_awaity_2)+(P_awaity_3+P_awaity_4))<=((P_ifxi_10_1+P_ifxi_10_2)+(P_ifxi_10_3+P_ifxi_10_4)))) * (((P_setbi_24_1+P...203
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(TRUE U (((P_awaity_1+P_awaity_2)+(P_awaity_3+P_awaity_4))<=((P_ifxi_10_1+P_ifxi_10_...300
(forward)formula 0,0,8.22486,164648,1,0,10,496900,10,2,1134,718166,4
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:50:33] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:50:33] [INFO ] Invariant cache hit.
[2024-05-24 14:50:33] [INFO ] Implicit Places using invariants in 78 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 78 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 14:50:33] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:50:33] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:50:33] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:50:33] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:50:33] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:50:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality17651840634165384054.gal : 1 ms
[2024-05-24 14:50:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality1761886628156093353.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/CTLCardinality17651840634165384054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1761886628156093353.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,5.07373,152284,1,0,6,451632,7,1,810,632520,1
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 14:50:38] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 14:50:38] [INFO ] Invariant cache hit.
[2024-05-24 14:50:38] [INFO ] Implicit Places using invariants in 136 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 136 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 14:50:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:50:38] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:50:38] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 14:50:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:50:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:50:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality13724077768137862003.gal : 1 ms
[2024-05-24 14:50:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality45418301451246718.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/CTLCardinality13724077768137862003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality45418301451246718.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.
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,1.91478e+06,5.17608,151860,2,36296,5,451632,6,0,550,632520,0


Converting to forward existential form...Done !
original formula: AF(EG(((((P_setbi_11_1+P_setbi_11_2)+(P_setbi_11_3+P_setbi_11_4))<1) * EX(TRUE))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((P_setbi_11_1+P_setbi_11_2)+(P_setbi_11_3+P_setbi_11_4))<1) * EX(TRUE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-24 14:51:08] [INFO ] Flatten gal took : 12 ms
[2024-05-24 14:51:08] [INFO ] Applying decomposition
[2024-05-24 14:51:08] [INFO ] Flatten gal took : 4 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/graph4709447423434311828.txt' '-o' '/tmp/graph4709447423434311828.bin' '-w' '/tmp/graph4709447423434311828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4709447423434311828.bin' '-l' '-1' '-v' '-w' '/tmp/graph4709447423434311828.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:51:08] [INFO ] Decomposing Gal with order
[2024-05-24 14:51:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:51:08] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-24 14:51:08] [INFO ] Flatten gal took : 9 ms
[2024-05-24 14:51:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 1 ms.
[2024-05-24 14:51:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality5346358111444360775.gal : 1 ms
[2024-05-24 14:51:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality13961696379901374469.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/CTLCardinality5346358111444360775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13961696379901374469.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EG(((((gu8.P_setbi_11_1+gu8.P_setbi_11_2)+(gu8.P_setbi_11_3+gu8.P_setbi_11_4))<1) * EX(TRUE))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((gu8.P_setbi_11_1+gu8.P_setbi_11_2)+(gu8.P_setbi_11_3+gu8.P_setbi_11_4))<1) * EX(TRUE)))))] =...161
Reverse transition relation is NOT exact ! Due to transitions gi1.gu4.t8, gi1.gu5.t18, gi1.gu6.t23, gi1.gu7.t5, gi1.gu7.t13, gi1.gu26.t40, gi1.gu26.t41, gi...1219
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-24 14:51:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:51:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:51:39] [INFO ] Applying decomposition
[2024-05-24 14:51:39] [INFO ] Flatten gal took : 4 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/graph17402602713582010960.txt' '-o' '/tmp/graph17402602713582010960.bin' '-w' '/tmp/graph17402602713582010960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17402602713582010960.bin' '-l' '-1' '-v' '-w' '/tmp/graph17402602713582010960.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:51:39] [INFO ] Decomposing Gal with order
[2024-05-24 14:51:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:51:39] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-24 14:51:39] [INFO ] Flatten gal took : 13 ms
[2024-05-24 14:51:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 3 ms.
[2024-05-24 14:51:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality8839197820862792227.gal : 1 ms
[2024-05-24 14:51:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10159951638628155793.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/CTLCardinality8839197820862792227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10159951638628155793.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 6 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,1.91478e+06,6.14748,178052,2,49123,5,690202,6,0,606,843248,0


Converting to forward existential form...Done !
original formula: AF((EX((((gu5.P_sety_9_1+gu5.P_sety_9_2)+(gu5.P_sety_9_3+gu5.P_sety_9_4))<=1)) * A((((((gu5.P_sety_9_1+gu5.P_sety_9_2)+(gu5.P_sety_9_3+gu...807
=> equivalent forward existential formula: [FwdG(Init,!((EX((((gu5.P_sety_9_1+gu5.P_sety_9_2)+(gu5.P_sety_9_3+gu5.P_sety_9_4))<=1)) * !((E(!(!(!(E(TRUE U !...1735
Reverse transition relation is NOT exact ! Due to transitions gi1.t154, gi1.t153, gi1.t151, gi1.t148, gi1.t143, gi1.t142, gi1.t141, gi1.t132, t8, t10, t13,...480
(forward)formula 0,1,52.9318,1417184,1,0,318,8.15685e+06,244,131,4298,6.52296e+06,278
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AX(EG((((gu6.P_fordo_12_1+gu6.P_fordo_12_2)+(gu6.P_fordo_12_3+gu6.P_fordo_12_4))>((gu6.P_ifxi_10_1+gu6.P_ifxi_10_2)+(gu6.P_ifxi_10_3+g...175
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG((((gu6.P_fordo_12_1+gu6.P_fordo_12_2)+(gu6.P_fordo_12_3+gu6.P_fordo_12_4))>((gu6.P...233
(forward)formula 1,1,113.368,2208088,1,0,399,1.35188e+07,11,163,1923,1.04822e+07,113
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AG(EF((((gi4.gu11.P_awaity_1+gi4.gu11.P_awaity_2)+(gi4.gu11.P_awaity_3+gi4.gu11.P_awaity_4))<=((gi4.gu11.P_ify0_4_1+gi4.gu11.P_ify0_4_...204
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (((gi4.gu11.P_awaity_1+gi4.gu11.P_awaity_2)+(gi4.gu11.P_awaity_3+gi4.gu11.P_a...264
(forward)formula 2,1,128.266,2208088,1,0,399,1.35188e+07,17,163,2061,1.04822e+07,160
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((AG(AF((((gi1.gu9.P_await_13_1+gi1.gu9.P_await_13_2)+(gi1.gu9.P_await_13_3+gi1.gu9.P_await_13_4))<=((gi1.gu9.P_setbi_24_1+gi1.gu9.P_se...383
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!((((gi1.gu9.P_await_13_1+gi1.gu9.P_await_13_2)+(gi1.gu9.P_await_13_3+gi1...459
(forward)formula 3,0,211.887,2472268,1,0,399,1.6935e+07,16,163,2003,1.20002e+07,163
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AX(AX(AG((((gu6.P_ifxi_10_1+gu6.P_ifxi_10_2)+(gu6.P_ifxi_10_3+gu6.P_ifxi_10_4))<=((gi4.gu11.P_awaity_1+gi4.gu11.P_awaity_2)+(gi4.gu11...543
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(E(TRUE U !((((gu6.P_ifxi_10_1+gu6.P_ifxi_10_2)+(gu6.P_ifxi_10_3+gu6.P_ifxi_...625
(forward)formula 4,0,275.194,2876352,1,0,399,1.89808e+07,14,163,1965,1.24989e+07,52
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(EG(((((gu7.P_setbi_11_1+gu7.P_setbi_11_2)+(gu7.P_setbi_11_3+gu7.P_setbi_11_4))<1) * EX(TRUE))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((gu7.P_setbi_11_1+gu7.P_setbi_11_2)+(gu7.P_setbi_11_3+gu7.P_setbi_11_4))<1) * EX(TRUE)))))] =...161
Using saturation style SCC detection
(forward)formula 5,1,293.942,2876352,1,0,399,1.89808e+07,26,163,2058,1.24989e+07,139
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 791403 ms.

BK_STOP 1716562593787

--------------------
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="LamportFastMutEx-COL-4"
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 LamportFastMutEx-COL-4, 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 r224-tall-171649612300217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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