Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716903502491

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-28 13:38:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 13:38:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:38:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 13:38:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:38:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 741 ms
[2024-05-28 13:38:25] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
[2024-05-28 13:38:25] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 13:38:25] [INFO ] Skeletonized 13 HLPN properties in 2 ms. Removed 3 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 55 to 53
RANDOM walk for 40001 steps (18 resets) in 2383 ms. (16 steps per ms) remains 16/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 104 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (9 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
[2024-05-28 13:38:26] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:38:26] [INFO ] Computed 26 invariants in 8 ms
[2024-05-28 13:38:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/59 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Problem AtomicPropp49 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/9 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/62 variables, 2/11 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 11 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 7 (OVERLAPS) 17/79 variables, 12/24 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/80 variables, 1/25 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 12 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 12 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 12 solved, 4 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 12 solved, 4 unsolved
[2024-05-28 13:38:26] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 4/117 constraints. Problems are: Problem set: 12 solved, 4 unsolved
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 1/118 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/145 variables, 2/120 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 1/121 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/145 variables, 0/121 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/145 variables, 0/121 constraints. Problems are: Problem set: 12 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 121 constraints, problems are : Problem set: 12 solved, 4 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/16 constraints, Known Traps: 2/2 constraints]
After SMT, in 947ms problems are : Problem set: 12 solved, 4 unsolved
Parikh walk visited 0 properties in 4317 ms.
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 40 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-05-28 13:38:31] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-28 13:38:31] [INFO ] Computed 25 invariants in 5 ms
[2024-05-28 13:38:31] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 13:38:31] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:38:31] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 13:38:31] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/92 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 2/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/104 variables, 2/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 104 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:38:33] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/97 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/105 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/147 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 147 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 12/12 constraints]
After SMT, in 2858ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 2860ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 0 places and 2 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2923 ms. Remains : 60/81 places, 39/65 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 16 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:38:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 13:38:34] [INFO ] Flatten gal took : 42 ms
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:38:34] [INFO ] Flatten gal took : 13 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 13:38:34] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 52 ms.
[2024-05-28 13:38:34] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2024-05-28 13:38:34] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 13:38:34] [INFO ] Reduced 40 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 630 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 19 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-28 13:38:34] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-28 13:38:34] [INFO ] Computed 54 invariants in 70 ms
[2024-05-28 13:38:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 4 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:38:52] [INFO ] Deduced a trap composed of 373 places in 367 ms of which 6 ms to minimize.
[2024-05-28 13:38:52] [INFO ] Deduced a trap composed of 381 places in 298 ms of which 4 ms to minimize.
[2024-05-28 13:38:52] [INFO ] Deduced a trap composed of 237 places in 354 ms of which 5 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 3 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 407 places in 370 ms of which 6 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 441 places in 387 ms of which 5 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 432 places in 335 ms of which 5 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 413 places in 403 ms of which 6 ms to minimize.
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 410 places in 365 ms of which 5 ms to minimize.
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 381 places in 440 ms of which 6 ms to minimize.
(s133 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 (/ 19.0 2.0))
(s1 (/ 1.0 2.0))
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 2.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 69 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-28 13:39:00] [INFO ] Deduced a trap composed of 459 places in 398 ms of which 6 ms to minimize.
[2024-05-28 13:39:12] [INFO ] Deduced a trap composed of 85 places in 192 ms of which 4 ms to minimize.
[2024-05-28 13:39:13] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:39:13] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 4 ms to minimize.
[2024-05-28 13:39:13] [INFO ] Deduced a trap composed of 84 places in 209 ms of which 3 ms to minimize.
[2024-05-28 13:39:13] [INFO ] Deduced a trap composed of 84 places in 200 ms of which 5 ms to minimize.
[2024-05-28 13:39:13] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 77 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 27/27 constraints]
After SMT, in 42435ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42462ms
[2024-05-28 13:39:17] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:39:17] [INFO ] Invariant cache hit.
[2024-05-28 13:39:17] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-28 13:39:17] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:39:17] [INFO ] Invariant cache hit.
[2024-05-28 13:39:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:39:21] [INFO ] Implicit Places using invariants and state equation in 3615 ms returned []
Implicit Place search using SMT with State Equation took 3889 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2024-05-28 13:39:21] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:39:21] [INFO ] Invariant cache hit.
[2024-05-28 13:39:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:39:38] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-28 13:39:42] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:39:44] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:39:44] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-05-28 13:39:44] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-28 13:39:47] [INFO ] Deduced a trap composed of 432 places in 413 ms of which 6 ms to minimize.
[2024-05-28 13:39:47] [INFO ] Deduced a trap composed of 397 places in 381 ms of which 5 ms to minimize.
[2024-05-28 13:39:47] [INFO ] Deduced a trap composed of 369 places in 361 ms of which 4 ms to minimize.
[2024-05-28 13:39:48] [INFO ] Deduced a trap composed of 384 places in 301 ms of which 5 ms to minimize.
[2024-05-28 13:39:48] [INFO ] Deduced a trap composed of 424 places in 349 ms of which 6 ms to minimize.
[2024-05-28 13:39:52] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 67 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 244 places in 398 ms of which 6 ms to minimize.
[2024-05-28 13:39:56] [INFO ] Deduced a trap composed of 181 places in 259 ms of which 4 ms to minimize.
[2024-05-28 13:39:56] [INFO ] Deduced a trap composed of 240 places in 365 ms of which 5 ms to minimize.
[2024-05-28 13:40:07] [INFO ] Deduced a trap composed of 508 places in 405 ms of which 6 ms to minimize.
[2024-05-28 13:40:07] [INFO ] Deduced a trap composed of 492 places in 355 ms of which 5 ms to minimize.
[2024-05-28 13:40:10] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 4 ms to minimize.
[2024-05-28 13:40:15] [INFO ] Deduced a trap composed of 377 places in 415 ms of which 5 ms to minimize.
[2024-05-28 13:40:15] [INFO ] Deduced a trap composed of 367 places in 423 ms of which 5 ms to minimize.
[2024-05-28 13:40:18] [INFO ] Deduced a trap composed of 395 places in 386 ms of which 5 ms to minimize.
[2024-05-28 13:40:21] [INFO ] Deduced a trap composed of 459 places in 411 ms of which 5 ms to minimize.
[2024-05-28 13:40:21] [INFO ] Deduced a trap composed of 451 places in 312 ms of which 4 ms to minimize.
[2024-05-28 13:40:22] [INFO ] Deduced a trap composed of 459 places in 258 ms of which 4 ms to minimize.
[2024-05-28 13:40:22] [INFO ] Deduced a trap composed of 442 places in 248 ms of which 4 ms to minimize.
[2024-05-28 13:40:22] [INFO ] Deduced a trap composed of 459 places in 393 ms of which 5 ms to minimize.
[2024-05-28 13:40:23] [INFO ] Deduced a trap composed of 450 places in 378 ms of which 7 ms to minimize.
SMT process timed out in 62206ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62235ms
Finished structural reductions in LTL mode , in 1 iterations and 108624 ms. Remains : 752/752 places, 1412/1412 transitions.
Support contains 630 out of 752 places after structural reductions.
[2024-05-28 13:40:23] [INFO ] Flatten gal took : 121 ms
[2024-05-28 13:40:23] [INFO ] Flatten gal took : 118 ms
[2024-05-28 13:40:24] [INFO ] Input system was already deterministic with 1412 transitions.
Reduction of identical properties reduced properties to check from 64 to 63
RANDOM walk for 40000 steps (9 resets) in 1845 ms. (21 steps per ms) remains 16/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 373 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 144 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 119 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 80 ms. (49 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 116 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 119 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 126 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
[2024-05-28 13:40:25] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:40:25] [INFO ] Invariant cache hit.
[2024-05-28 13:40:25] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 198/492 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 12/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 4 (OVERLAPS) 256/748 variables, 25/50 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 0/50 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/750 variables, 2/52 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 0/52 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/752 variables, 2/54 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/54 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1392/2144 variables, 752/806 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2144 variables, 120/926 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 11 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 926 constraints, problems are : Problem set: 11 solved, 5 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 262/321 variables, 6/6 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 1/7 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 33/354 variables, 6/13 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 373/727 variables, 26/39 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-05-28 13:40:31] [INFO ] Deduced a trap composed of 65 places in 542 ms of which 6 ms to minimize.
[2024-05-28 13:40:32] [INFO ] Deduced a trap composed of 65 places in 512 ms of which 5 ms to minimize.
[2024-05-28 13:40:32] [INFO ] Deduced a trap composed of 65 places in 367 ms of which 4 ms to minimize.
[2024-05-28 13:40:33] [INFO ] Deduced a trap composed of 65 places in 366 ms of which 4 ms to minimize.
[2024-05-28 13:40:33] [INFO ] Deduced a trap composed of 66 places in 429 ms of which 4 ms to minimize.
[2024-05-28 13:40:33] [INFO ] Deduced a trap composed of 95 places in 306 ms of which 4 ms to minimize.
[2024-05-28 13:40:34] [INFO ] Deduced a trap composed of 65 places in 296 ms of which 4 ms to minimize.
[2024-05-28 13:40:34] [INFO ] Deduced a trap composed of 65 places in 381 ms of which 5 ms to minimize.
[2024-05-28 13:40:34] [INFO ] Deduced a trap composed of 376 places in 356 ms of which 6 ms to minimize.
[2024-05-28 13:40:35] [INFO ] Deduced a trap composed of 440 places in 359 ms of which 6 ms to minimize.
[2024-05-28 13:40:35] [INFO ] Deduced a trap composed of 65 places in 463 ms of which 5 ms to minimize.
[2024-05-28 13:40:36] [INFO ] Deduced a trap composed of 435 places in 335 ms of which 4 ms to minimize.
SMT process timed out in 10723ms, After SMT, problems are : Problem set: 11 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 752 transition count 1352
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 692 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 682 transition count 1342
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 140 place count 682 transition count 1262
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 300 place count 602 transition count 1262
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 380 place count 562 transition count 1222
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 400 place count 562 transition count 1202
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 420 place count 542 transition count 1202
Applied a total of 420 rules in 231 ms. Remains 542 /752 variables (removed 210) and now considering 1202/1412 (removed 210) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-28 13:40:36] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
// Phase 1: matrix 1182 rows 542 cols
[2024-05-28 13:40:36] [INFO ] Computed 54 invariants in 37 ms
[2024-05-28 13:40:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:40:47] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 4 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:40:49] [INFO ] Deduced a trap composed of 209 places in 332 ms of which 4 ms to minimize.
[2024-05-28 13:40:51] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:40:53] [INFO ] Deduced a trap composed of 330 places in 291 ms of which 3 ms to minimize.
[2024-05-28 13:40:55] [INFO ] Deduced a trap composed of 231 places in 333 ms of which 4 ms to minimize.
[2024-05-28 13:40:57] [INFO ] Deduced a trap composed of 278 places in 289 ms of which 4 ms to minimize.
[2024-05-28 13:40:57] [INFO ] Deduced a trap composed of 276 places in 290 ms of which 4 ms to minimize.
[2024-05-28 13:40:58] [INFO ] Deduced a trap composed of 88 places in 289 ms of which 4 ms to minimize.
[2024-05-28 13:40:58] [INFO ] Deduced a trap composed of 133 places in 256 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1724 variables, and 67 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/542 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 13:41:04] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 4 ms to minimize.
[2024-05-28 13:41:05] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:41:07] [INFO ] Deduced a trap composed of 56 places in 308 ms of which 4 ms to minimize.
[2024-05-28 13:41:12] [INFO ] Deduced a trap composed of 202 places in 271 ms of which 4 ms to minimize.
[2024-05-28 13:41:13] [INFO ] Deduced a trap composed of 241 places in 369 ms of which 4 ms to minimize.
[2024-05-28 13:41:14] [INFO ] Deduced a trap composed of 242 places in 309 ms of which 5 ms to minimize.
[2024-05-28 13:41:14] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 4 ms to minimize.
[2024-05-28 13:41:14] [INFO ] Deduced a trap composed of 211 places in 292 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1724 variables, and 75 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/542 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 25/25 constraints]
After SMT, in 42417ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 42434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42669 ms. Remains : 542/752 places, 1202/1412 transitions.
RANDOM walk for 40000 steps (16 resets) in 845 ms. (47 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 250 ms. (159 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 275 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (9 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (12 resets) in 304 ms. (131 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 115776 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 5
Probabilistic random walk after 115776 steps, saw 69945 distinct states, run finished after 3007 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-28 13:41:22] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:41:22] [INFO ] Invariant cache hit.
[2024-05-28 13:41:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 373/432 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11/443 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 97/540 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:41:23] [INFO ] Deduced a trap composed of 209 places in 243 ms of which 3 ms to minimize.
[2024-05-28 13:41:23] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 3 ms to minimize.
[2024-05-28 13:41:23] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 3 ms to minimize.
[2024-05-28 13:41:23] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 3 ms to minimize.
[2024-05-28 13:41:24] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-05-28 13:41:24] [INFO ] Deduced a trap composed of 44 places in 308 ms of which 4 ms to minimize.
[2024-05-28 13:41:24] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 3 ms to minimize.
[2024-05-28 13:41:25] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 3 ms to minimize.
[2024-05-28 13:41:25] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 4 ms to minimize.
[2024-05-28 13:41:25] [INFO ] Deduced a trap composed of 243 places in 305 ms of which 3 ms to minimize.
[2024-05-28 13:41:26] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 3 ms to minimize.
[2024-05-28 13:41:26] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 4 ms to minimize.
[2024-05-28 13:41:26] [INFO ] Deduced a trap composed of 218 places in 252 ms of which 4 ms to minimize.
[2024-05-28 13:41:26] [INFO ] Deduced a trap composed of 249 places in 254 ms of which 3 ms to minimize.
[2024-05-28 13:41:27] [INFO ] Deduced a trap composed of 211 places in 238 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/542 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1182/1724 variables, 542/611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1724 variables, 120/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1724 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/1724 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1724/1724 variables, and 731 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9694 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 542/542 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 373/432 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11/443 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 97/540 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/542 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1182/1724 variables, 542/611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1724 variables, 120/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1724 variables, 5/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:41:58] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1724 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/1724 variables, and 737 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 542/542 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 16/16 constraints]
After SMT, in 54754ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1202/1202 transitions.
Applied a total of 0 rules in 60 ms. Remains 542 /542 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 542/542 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1202/1202 transitions.
Applied a total of 0 rules in 42 ms. Remains 542 /542 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-28 13:42:17] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:42:17] [INFO ] Invariant cache hit.
[2024-05-28 13:42:18] [INFO ] Implicit Places using invariants in 580 ms returned [486, 487, 488, 489, 490, 491, 492, 493, 494, 495]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 585 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 532/542 places, 1202/1202 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 522 transition count 1192
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 522 transition count 1192
Applied a total of 20 rules in 33 ms. Remains 522 /532 variables (removed 10) and now considering 1192/1202 (removed 10) transitions.
[2024-05-28 13:42:18] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 522 cols
[2024-05-28 13:42:18] [INFO ] Computed 44 invariants in 42 ms
[2024-05-28 13:42:18] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-28 13:42:18] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:42:18] [INFO ] Invariant cache hit.
[2024-05-28 13:42:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:42:23] [INFO ] Implicit Places using invariants and state equation in 4775 ms returned []
Implicit Place search using SMT with State Equation took 5305 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 522/542 places, 1192/1202 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5969 ms. Remains : 522/542 places, 1192/1202 transitions.
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:42:23] [INFO ] Flatten gal took : 102 ms
[2024-05-28 13:42:23] [INFO ] Flatten gal took : 109 ms
[2024-05-28 13:42:24] [INFO ] Input system was already deterministic with 1412 transitions.
Support contains 599 out of 752 places (down from 619) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 750 transition count 1352
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 690 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 680 transition count 1342
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 140 place count 680 transition count 1282
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 260 place count 620 transition count 1282
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 400 place count 550 transition count 1212
Applied a total of 400 rules in 89 ms. Remains 550 /752 variables (removed 202) and now considering 1212/1412 (removed 200) transitions.
Running 1210 sub problems to find dead transitions.
[2024-05-28 13:42:24] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
// Phase 1: matrix 1192 rows 550 cols
[2024-05-28 13:42:24] [INFO ] Computed 52 invariants in 29 ms
[2024-05-28 13:42:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-28 13:42:34] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:42:34] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:42:34] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:42:34] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:42:34] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2024-05-28 13:42:34] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:42:34] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:42:34] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:42:35] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 254 places in 307 ms of which 4 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 255 places in 285 ms of which 4 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 233 places in 308 ms of which 4 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 255 places in 287 ms of which 4 ms to minimize.
[2024-05-28 13:42:37] [INFO ] Deduced a trap composed of 222 places in 277 ms of which 3 ms to minimize.
[2024-05-28 13:42:38] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1742 variables, and 65 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-28 13:42:52] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:42:55] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 4 ms to minimize.
[2024-05-28 13:43:04] [INFO ] Deduced a trap composed of 222 places in 312 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1742 variables, and 68 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1210 constraints, Known Traps: 18/18 constraints]
After SMT, in 42152ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 42166ms
[2024-05-28 13:43:06] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
[2024-05-28 13:43:06] [INFO ] Invariant cache hit.
[2024-05-28 13:43:06] [INFO ] Implicit Places using invariants in 498 ms returned [494, 495, 496, 497, 498, 499, 500, 501, 502, 503]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 500 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 540/752 places, 1212/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 530 transition count 1202
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 530 transition count 1202
Applied a total of 20 rules in 44 ms. Remains 530 /540 variables (removed 10) and now considering 1202/1212 (removed 10) transitions.
[2024-05-28 13:43:06] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
// Phase 1: matrix 1182 rows 530 cols
[2024-05-28 13:43:06] [INFO ] Computed 42 invariants in 13 ms
[2024-05-28 13:43:07] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-28 13:43:07] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 13:43:07] [INFO ] Invariant cache hit.
[2024-05-28 13:43:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:43:12] [INFO ] Implicit Places using invariants and state equation in 5576 ms returned []
Implicit Place search using SMT with State Equation took 6065 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 530/752 places, 1202/1412 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 48874 ms. Remains : 530/752 places, 1202/1412 transitions.
[2024-05-28 13:43:13] [INFO ] Flatten gal took : 105 ms
[2024-05-28 13:43:13] [INFO ] Flatten gal took : 94 ms
[2024-05-28 13:43:13] [INFO ] Input system was already deterministic with 1202 transitions.
[2024-05-28 13:43:13] [INFO ] Flatten gal took : 45 ms
[2024-05-28 13:43:13] [INFO ] Flatten gal took : 45 ms
[2024-05-28 13:43:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16508657751696016084.gal : 23 ms
[2024-05-28 13:43:13] [INFO ] Time to serialize properties into /tmp/CTLFireability15172417250584533308.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16508657751696016084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15172417250584533308.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 64 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:44:14] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 13:44:14] [INFO ] Computed 52 invariants in 29 ms
[2024-05-28 13:44:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:44:30] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:44:30] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 5 ms to minimize.
[2024-05-28 13:44:30] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-28 13:44:30] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:44:30] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:44:30] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-28 13:44:31] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:44:31] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:44:31] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:44:32] [INFO ] Deduced a trap composed of 404 places in 420 ms of which 5 ms to minimize.
[2024-05-28 13:44:32] [INFO ] Deduced a trap composed of 209 places in 355 ms of which 5 ms to minimize.
[2024-05-28 13:44:33] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 2 ms to minimize.
[2024-05-28 13:44:34] [INFO ] Deduced a trap composed of 440 places in 399 ms of which 5 ms to minimize.
[2024-05-28 13:44:34] [INFO ] Deduced a trap composed of 432 places in 407 ms of which 5 ms to minimize.
[2024-05-28 13:44:35] [INFO ] Deduced a trap composed of 393 places in 336 ms of which 4 ms to minimize.
[2024-05-28 13:44:35] [INFO ] Deduced a trap composed of 411 places in 310 ms of which 4 ms to minimize.
[2024-05-28 13:44:35] [INFO ] Deduced a trap composed of 392 places in 280 ms of which 4 ms to minimize.
[2024-05-28 13:44:36] [INFO ] Deduced a trap composed of 370 places in 278 ms of which 3 ms to minimize.
[2024-05-28 13:44:36] [INFO ] Deduced a trap composed of 404 places in 326 ms of which 4 ms to minimize.
SMT process timed out in 22035ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22056ms
[2024-05-28 13:44:36] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:44:36] [INFO ] Invariant cache hit.
[2024-05-28 13:44:37] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-28 13:44:37] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:44:37] [INFO ] Invariant cache hit.
[2024-05-28 13:44:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:44:48] [INFO ] Implicit Places using invariants and state equation in 11688 ms returned []
Implicit Place search using SMT with State Equation took 12067 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:44:48] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:44:48] [INFO ] Invariant cache hit.
[2024-05-28 13:44:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:45:06] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 2 ms to minimize.
[2024-05-28 13:45:08] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:45:08] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 2 ms to minimize.
[2024-05-28 13:45:08] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:45:08] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:45:08] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:45:08] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:45:08] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:45:09] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:45:13] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:45:17] [INFO ] Deduced a trap composed of 395 places in 436 ms of which 5 ms to minimize.
[2024-05-28 13:45:18] [INFO ] Deduced a trap composed of 420 places in 288 ms of which 4 ms to minimize.
[2024-05-28 13:45:18] [INFO ] Deduced a trap composed of 436 places in 276 ms of which 4 ms to minimize.
[2024-05-28 13:45:18] [INFO ] Deduced a trap composed of 394 places in 260 ms of which 3 ms to minimize.
[2024-05-28 13:45:19] [INFO ] Deduced a trap composed of 351 places in 253 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 65 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:45:22] [INFO ] Deduced a trap composed of 175 places in 274 ms of which 4 ms to minimize.
[2024-05-28 13:45:22] [INFO ] Deduced a trap composed of 226 places in 333 ms of which 5 ms to minimize.
[2024-05-28 13:45:23] [INFO ] Deduced a trap composed of 369 places in 417 ms of which 5 ms to minimize.
[2024-05-28 13:45:24] [INFO ] Deduced a trap composed of 431 places in 302 ms of which 4 ms to minimize.
[2024-05-28 13:45:25] [INFO ] Deduced a trap composed of 409 places in 409 ms of which 5 ms to minimize.
[2024-05-28 13:45:25] [INFO ] Deduced a trap composed of 430 places in 359 ms of which 5 ms to minimize.
[2024-05-28 13:45:26] [INFO ] Deduced a trap composed of 379 places in 399 ms of which 5 ms to minimize.
[2024-05-28 13:45:26] [INFO ] Deduced a trap composed of 393 places in 379 ms of which 6 ms to minimize.
[2024-05-28 13:45:27] [INFO ] Deduced a trap composed of 380 places in 391 ms of which 5 ms to minimize.
[2024-05-28 13:45:27] [INFO ] Deduced a trap composed of 388 places in 361 ms of which 6 ms to minimize.
[2024-05-28 13:45:27] [INFO ] Deduced a trap composed of 403 places in 403 ms of which 5 ms to minimize.
[2024-05-28 13:45:41] [INFO ] Deduced a trap composed of 367 places in 376 ms of which 5 ms to minimize.
[2024-05-28 13:45:42] [INFO ] Deduced a trap composed of 370 places in 342 ms of which 5 ms to minimize.
[2024-05-28 13:45:42] [INFO ] Deduced a trap composed of 373 places in 283 ms of which 4 ms to minimize.
[2024-05-28 13:45:42] [INFO ] Deduced a trap composed of 370 places in 272 ms of which 4 ms to minimize.
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 372 places in 272 ms of which 4 ms to minimize.
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 371 places in 269 ms of which 3 ms to minimize.
[2024-05-28 13:45:44] [INFO ] Deduced a trap composed of 71 places in 413 ms of which 6 ms to minimize.
[2024-05-28 13:45:45] [INFO ] Deduced a trap composed of 222 places in 414 ms of which 5 ms to minimize.
[2024-05-28 13:45:48] [INFO ] Deduced a trap composed of 431 places in 325 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/728 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:45:50] [INFO ] Deduced a trap composed of 115 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 86 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 36/36 constraints]
After SMT, in 61835ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61850ms
Starting structural reductions in LTL mode, iteration 1 : 730/752 places, 1392/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96046 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-05-28 13:45:50] [INFO ] Flatten gal took : 43 ms
[2024-05-28 13:45:50] [INFO ] Flatten gal took : 39 ms
[2024-05-28 13:45:50] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:45:50] [INFO ] Flatten gal took : 47 ms
[2024-05-28 13:45:50] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:45:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16704395188510874384.gal : 7 ms
[2024-05-28 13:45:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17153809739818406190.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16704395188510874384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17153809739818406190.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:46:21] [INFO ] Flatten gal took : 91 ms
[2024-05-28 13:46:21] [INFO ] Applying decomposition
[2024-05-28 13:46:21] [INFO ] Flatten gal took : 70 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/graph17237312348834171090.txt' '-o' '/tmp/graph17237312348834171090.bin' '-w' '/tmp/graph17237312348834171090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17237312348834171090.bin' '-l' '-1' '-v' '-w' '/tmp/graph17237312348834171090.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:46:21] [INFO ] Decomposing Gal with order
[2024-05-28 13:46:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:46:21] [INFO ] Removed a total of 885 redundant transitions.
[2024-05-28 13:46:21] [INFO ] Flatten gal took : 148 ms
[2024-05-28 13:46:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 46 ms.
[2024-05-28 13:46:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10415997874596027614.gal : 15 ms
[2024-05-28 13:46:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2657393091815730866.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10415997874596027614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2657393091815730866.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 660 transition count 1322
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 660 transition count 1262
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 600 transition count 1262
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 460 place count 520 transition count 1182
Applied a total of 460 rules in 81 ms. Remains 520 /752 variables (removed 232) and now considering 1182/1412 (removed 230) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-28 13:46:51] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 520 cols
[2024-05-28 13:46:51] [INFO ] Computed 52 invariants in 33 ms
[2024-05-28 13:46:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 2 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 220 places in 294 ms of which 4 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 192 places in 261 ms of which 4 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 213 places in 316 ms of which 3 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 212 places in 258 ms of which 2 ms to minimize.
[2024-05-28 13:47:06] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1682 variables, and 64 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:47:17] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2024-05-28 13:47:17] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:47:30] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 13:47:31] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:47:32] [INFO ] Deduced a trap composed of 190 places in 264 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1682 variables, and 69 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 19/19 constraints]
After SMT, in 41696ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 41710ms
[2024-05-28 13:47:33] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:47:33] [INFO ] Invariant cache hit.
[2024-05-28 13:47:34] [INFO ] Implicit Places using invariants in 412 ms returned [464, 465, 466, 467, 468, 469, 470, 471, 472, 473]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 415 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 510/752 places, 1182/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 500 transition count 1172
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 500 transition count 1172
Applied a total of 20 rules in 25 ms. Remains 500 /510 variables (removed 10) and now considering 1172/1182 (removed 10) transitions.
[2024-05-28 13:47:34] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 500 cols
[2024-05-28 13:47:34] [INFO ] Computed 42 invariants in 17 ms
[2024-05-28 13:47:34] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-28 13:47:34] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-28 13:47:34] [INFO ] Invariant cache hit.
[2024-05-28 13:47:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:47:41] [INFO ] Implicit Places using invariants and state equation in 6815 ms returned []
Implicit Place search using SMT with State Equation took 7202 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 500/752 places, 1172/1412 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 49437 ms. Remains : 500/752 places, 1172/1412 transitions.
[2024-05-28 13:47:41] [INFO ] Flatten gal took : 45 ms
[2024-05-28 13:47:41] [INFO ] Flatten gal took : 48 ms
[2024-05-28 13:47:41] [INFO ] Input system was already deterministic with 1172 transitions.
RANDOM walk for 517 steps (0 resets) in 7 ms. (64 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 13:47:41] [INFO ] Flatten gal took : 77 ms
[2024-05-28 13:47:41] [INFO ] Flatten gal took : 58 ms
[2024-05-28 13:47:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9803121034786764625.gal : 17 ms
[2024-05-28 13:47:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12784509630242173360.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9803121034786764625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12784509630242173360.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 750 transition count 1382
Reduce places removed 30 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 40 rules applied. Total rules applied 70 place count 720 transition count 1372
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 80 place count 710 transition count 1372
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 80 place count 710 transition count 1292
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 240 place count 630 transition count 1292
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 280 place count 610 transition count 1272
Applied a total of 280 rules in 55 ms. Remains 610 /752 variables (removed 142) and now considering 1272/1412 (removed 140) transitions.
Running 1270 sub problems to find dead transitions.
[2024-05-28 13:47:41] [INFO ] Flow matrix only has 1252 transitions (discarded 20 similar events)
// Phase 1: matrix 1252 rows 610 cols
[2024-05-28 13:47:41] [INFO ] Computed 52 invariants in 14 ms
[2024-05-28 13:47:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-05-28 13:47:57] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:47:57] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 2 ms to minimize.
[2024-05-28 13:47:57] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:47:57] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:47:57] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:47:57] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:47:58] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:47:58] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:47:58] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:47:58] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:48:00] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
[2024-05-28 13:48:01] [INFO ] Deduced a trap composed of 213 places in 264 ms of which 5 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1862 variables, and 62 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/610 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1270/1270 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-05-28 13:48:05] [INFO ] Deduced a trap composed of 331 places in 377 ms of which 18 ms to minimize.
[2024-05-28 13:48:05] [INFO ] Deduced a trap composed of 332 places in 387 ms of which 5 ms to minimize.
[2024-05-28 13:48:05] [INFO ] Deduced a trap composed of 384 places in 288 ms of which 4 ms to minimize.
[2024-05-28 13:48:06] [INFO ] Deduced a trap composed of 374 places in 346 ms of which 6 ms to minimize.
[2024-05-28 13:48:06] [INFO ] Deduced a trap composed of 433 places in 311 ms of which 5 ms to minimize.
[2024-05-28 13:48:11] [INFO ] Deduced a trap composed of 110 places in 300 ms of which 5 ms to minimize.
[2024-05-28 13:48:11] [INFO ] Deduced a trap composed of 161 places in 286 ms of which 4 ms to minimize.
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 328 places in 386 ms of which 6 ms to minimize.
[2024-05-28 13:48:15] [INFO ] Deduced a trap composed of 266 places in 328 ms of which 4 ms to minimize.
[2024-05-28 13:48:16] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-05-28 13:48:20] [INFO ] Deduced a trap composed of 242 places in 316 ms of which 4 ms to minimize.
[2024-05-28 13:48:21] [INFO ] Deduced a trap composed of 332 places in 308 ms of which 5 ms to minimize.
[2024-05-28 13:48:21] [INFO ] Deduced a trap composed of 268 places in 283 ms of which 4 ms to minimize.
[2024-05-28 13:48:22] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 5 ms to minimize.
[2024-05-28 13:48:23] [INFO ] Deduced a trap composed of 401 places in 302 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/1862 variables, and 77 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/610 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1270 constraints, Known Traps: 27/27 constraints]
After SMT, in 41894ms problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 41906ms
[2024-05-28 13:48:23] [INFO ] Flow matrix only has 1252 transitions (discarded 20 similar events)
[2024-05-28 13:48:23] [INFO ] Invariant cache hit.
[2024-05-28 13:48:24] [INFO ] Implicit Places using invariants in 490 ms returned [494, 495, 496, 497, 498, 499, 500, 501, 502, 503]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 493 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 600/752 places, 1272/1412 transitions.
Applied a total of 0 rules in 26 ms. Remains 600 /600 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 42484 ms. Remains : 600/752 places, 1272/1412 transitions.
[2024-05-28 13:48:24] [INFO ] Flatten gal took : 63 ms
[2024-05-28 13:48:24] [INFO ] Flatten gal took : 55 ms
[2024-05-28 13:48:24] [INFO ] Input system was already deterministic with 1272 transitions.
[2024-05-28 13:48:24] [INFO ] Flatten gal took : 54 ms
[2024-05-28 13:48:24] [INFO ] Flatten gal took : 56 ms
[2024-05-28 13:48:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1066507218002184727.gal : 9 ms
[2024-05-28 13:48:24] [INFO ] Time to serialize properties into /tmp/CTLFireability1930633264390513233.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/CTLFireability1066507218002184727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1930633264390513233.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Applied a total of 22 rules in 34 ms. Remains 740 /752 variables (removed 12) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-28 13:49:25] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2024-05-28 13:49:25] [INFO ] Computed 52 invariants in 17 ms
[2024-05-28 13:49:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:49:40] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:49:41] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 3 ms to minimize.
[2024-05-28 13:49:41] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 3 ms to minimize.
[2024-05-28 13:49:41] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-05-28 13:49:41] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:49:41] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-28 13:49:41] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:49:41] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:49:41] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:49:42] [INFO ] Deduced a trap composed of 420 places in 388 ms of which 5 ms to minimize.
[2024-05-28 13:49:43] [INFO ] Deduced a trap composed of 393 places in 384 ms of which 6 ms to minimize.
[2024-05-28 13:49:43] [INFO ] Deduced a trap composed of 396 places in 400 ms of which 5 ms to minimize.
[2024-05-28 13:49:43] [INFO ] Deduced a trap composed of 421 places in 359 ms of which 6 ms to minimize.
[2024-05-28 13:49:44] [INFO ] Deduced a trap composed of 216 places in 357 ms of which 6 ms to minimize.
[2024-05-28 13:49:46] [INFO ] Deduced a trap composed of 395 places in 413 ms of which 5 ms to minimize.
[2024-05-28 13:49:46] [INFO ] Deduced a trap composed of 416 places in 414 ms of which 5 ms to minimize.
[2024-05-28 13:49:46] [INFO ] Deduced a trap composed of 412 places in 376 ms of which 5 ms to minimize.
[2024-05-28 13:49:47] [INFO ] Deduced a trap composed of 404 places in 409 ms of which 5 ms to minimize.
SMT process timed out in 22441ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 22459ms
[2024-05-28 13:49:47] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:49:47] [INFO ] Invariant cache hit.
[2024-05-28 13:49:47] [INFO ] Implicit Places using invariants in 425 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 428 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/752 places, 1402/1412 transitions.
Applied a total of 0 rules in 8 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22934 ms. Remains : 730/752 places, 1402/1412 transitions.
[2024-05-28 13:49:48] [INFO ] Flatten gal took : 86 ms
[2024-05-28 13:49:48] [INFO ] Flatten gal took : 70 ms
[2024-05-28 13:49:48] [INFO ] Input system was already deterministic with 1402 transitions.
[2024-05-28 13:49:48] [INFO ] Flatten gal took : 58 ms
[2024-05-28 13:49:48] [INFO ] Flatten gal took : 57 ms
[2024-05-28 13:49:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14395968061744049283.gal : 8 ms
[2024-05-28 13:49:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3561687367502520235.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14395968061744049283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3561687367502520235.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:50:18] [INFO ] Flatten gal took : 59 ms
[2024-05-28 13:50:18] [INFO ] Applying decomposition
[2024-05-28 13:50:18] [INFO ] Flatten gal took : 58 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/graph2845918041076511638.txt' '-o' '/tmp/graph2845918041076511638.bin' '-w' '/tmp/graph2845918041076511638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2845918041076511638.bin' '-l' '-1' '-v' '-w' '/tmp/graph2845918041076511638.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:50:18] [INFO ] Decomposing Gal with order
[2024-05-28 13:50:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:50:18] [INFO ] Removed a total of 928 redundant transitions.
[2024-05-28 13:50:18] [INFO ] Flatten gal took : 125 ms
[2024-05-28 13:50:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 396 labels/synchronizations in 21 ms.
[2024-05-28 13:50:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12716410295066103760.gal : 15 ms
[2024-05-28 13:50:19] [INFO ] Time to serialize properties into /tmp/CTLFireability6661872173456281929.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12716410295066103760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6661872173456281929.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 39 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:50:49] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 13:50:49] [INFO ] Computed 52 invariants in 42 ms
[2024-05-28 13:50:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 3 ms to minimize.
[2024-05-28 13:51:04] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:51:04] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:51:04] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:51:04] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:51:04] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:51:04] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-28 13:51:04] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:51:04] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:51:05] [INFO ] Deduced a trap composed of 404 places in 386 ms of which 6 ms to minimize.
[2024-05-28 13:51:06] [INFO ] Deduced a trap composed of 209 places in 365 ms of which 6 ms to minimize.
[2024-05-28 13:51:07] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:51:08] [INFO ] Deduced a trap composed of 440 places in 395 ms of which 6 ms to minimize.
[2024-05-28 13:51:08] [INFO ] Deduced a trap composed of 432 places in 363 ms of which 5 ms to minimize.
[2024-05-28 13:51:08] [INFO ] Deduced a trap composed of 393 places in 389 ms of which 5 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 411 places in 378 ms of which 5 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 392 places in 349 ms of which 5 ms to minimize.
[2024-05-28 13:51:10] [INFO ] Deduced a trap composed of 370 places in 393 ms of which 5 ms to minimize.
[2024-05-28 13:51:10] [INFO ] Deduced a trap composed of 404 places in 316 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 69 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:51:12] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:51:14] [INFO ] Deduced a trap composed of 324 places in 304 ms of which 5 ms to minimize.
[2024-05-28 13:51:15] [INFO ] Deduced a trap composed of 49 places in 263 ms of which 4 ms to minimize.
[2024-05-28 13:51:15] [INFO ] Deduced a trap composed of 383 places in 260 ms of which 4 ms to minimize.
[2024-05-28 13:51:15] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:51:24] [INFO ] Deduced a trap composed of 507 places in 400 ms of which 6 ms to minimize.
[2024-05-28 13:51:24] [INFO ] Deduced a trap composed of 491 places in 384 ms of which 5 ms to minimize.
[2024-05-28 13:51:24] [INFO ] Deduced a trap composed of 491 places in 375 ms of which 5 ms to minimize.
[2024-05-28 13:51:25] [INFO ] Deduced a trap composed of 514 places in 395 ms of which 6 ms to minimize.
[2024-05-28 13:51:25] [INFO ] Deduced a trap composed of 491 places in 360 ms of which 6 ms to minimize.
[2024-05-28 13:51:26] [INFO ] Deduced a trap composed of 502 places in 399 ms of which 5 ms to minimize.
[2024-05-28 13:51:28] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 81 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 31/31 constraints]
After SMT, in 42184ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42205ms
[2024-05-28 13:51:31] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:51:31] [INFO ] Invariant cache hit.
[2024-05-28 13:51:31] [INFO ] Implicit Places using invariants in 397 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 403 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 8 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42661 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 13:51:31] [INFO ] Flatten gal took : 54 ms
[2024-05-28 13:51:31] [INFO ] Flatten gal took : 58 ms
[2024-05-28 13:51:32] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:51:32] [INFO ] Flatten gal took : 49 ms
[2024-05-28 13:51:32] [INFO ] Flatten gal took : 47 ms
[2024-05-28 13:51:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14220299727125092195.gal : 7 ms
[2024-05-28 13:51:32] [INFO ] Time to serialize properties into /tmp/CTLFireability12227863494673196443.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14220299727125092195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12227863494673196443.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:52:02] [INFO ] Flatten gal took : 82 ms
[2024-05-28 13:52:02] [INFO ] Applying decomposition
[2024-05-28 13:52:02] [INFO ] Flatten gal took : 59 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/graph15990437478801823092.txt' '-o' '/tmp/graph15990437478801823092.bin' '-w' '/tmp/graph15990437478801823092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15990437478801823092.bin' '-l' '-1' '-v' '-w' '/tmp/graph15990437478801823092.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:52:02] [INFO ] Decomposing Gal with order
[2024-05-28 13:52:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:52:02] [INFO ] Removed a total of 946 redundant transitions.
[2024-05-28 13:52:02] [INFO ] Flatten gal took : 99 ms
[2024-05-28 13:52:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 11 ms.
[2024-05-28 13:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17135939285187012835.gal : 10 ms
[2024-05-28 13:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12555703407781192201.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17135939285187012835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12555703407781192201.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 742 transition count 1402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 742 transition count 1402
Applied a total of 20 rules in 33 ms. Remains 742 /752 variables (removed 10) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-28 13:52:32] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 742 cols
[2024-05-28 13:52:32] [INFO ] Computed 54 invariants in 36 ms
[2024-05-28 13:52:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 3 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-28 13:52:50] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:52:50] [INFO ] Deduced a trap composed of 414 places in 363 ms of which 5 ms to minimize.
[2024-05-28 13:52:51] [INFO ] Deduced a trap composed of 235 places in 346 ms of which 5 ms to minimize.
[2024-05-28 13:52:52] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:52:52] [INFO ] Deduced a trap composed of 387 places in 398 ms of which 5 ms to minimize.
[2024-05-28 13:52:53] [INFO ] Deduced a trap composed of 413 places in 370 ms of which 5 ms to minimize.
[2024-05-28 13:52:53] [INFO ] Deduced a trap composed of 352 places in 438 ms of which 5 ms to minimize.
[2024-05-28 13:52:54] [INFO ] Deduced a trap composed of 429 places in 353 ms of which 4 ms to minimize.
[2024-05-28 13:52:54] [INFO ] Deduced a trap composed of 413 places in 334 ms of which 4 ms to minimize.
[2024-05-28 13:52:54] [INFO ] Deduced a trap composed of 387 places in 304 ms of which 3 ms to minimize.
SMT process timed out in 22047ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 22068ms
[2024-05-28 13:52:54] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:52:54] [INFO ] Invariant cache hit.
[2024-05-28 13:52:55] [INFO ] Implicit Places using invariants in 365 ms returned [576, 577, 578, 579, 580, 581, 582, 583, 584, 585]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 367 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 732/752 places, 1402/1412 transitions.
Applied a total of 0 rules in 15 ms. Remains 732 /732 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22489 ms. Remains : 732/752 places, 1402/1412 transitions.
[2024-05-28 13:52:55] [INFO ] Flatten gal took : 36 ms
[2024-05-28 13:52:55] [INFO ] Flatten gal took : 40 ms
[2024-05-28 13:52:55] [INFO ] Input system was already deterministic with 1402 transitions.
[2024-05-28 13:52:55] [INFO ] Flatten gal took : 43 ms
[2024-05-28 13:52:55] [INFO ] Flatten gal took : 45 ms
[2024-05-28 13:52:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13173180846035843220.gal : 5 ms
[2024-05-28 13:52:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16157170772406763708.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/CTLFireability13173180846035843220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16157170772406763708.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:53:25] [INFO ] Flatten gal took : 54 ms
[2024-05-28 13:53:25] [INFO ] Applying decomposition
[2024-05-28 13:53:25] [INFO ] Flatten gal took : 78 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/graph9582007450588369063.txt' '-o' '/tmp/graph9582007450588369063.bin' '-w' '/tmp/graph9582007450588369063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9582007450588369063.bin' '-l' '-1' '-v' '-w' '/tmp/graph9582007450588369063.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:53:25] [INFO ] Decomposing Gal with order
[2024-05-28 13:53:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:53:26] [INFO ] Removed a total of 1298 redundant transitions.
[2024-05-28 13:53:26] [INFO ] Flatten gal took : 115 ms
[2024-05-28 13:53:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 20 ms.
[2024-05-28 13:53:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3685661694879036015.gal : 12 ms
[2024-05-28 13:53:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1851826030461495697.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3685661694879036015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1851826030461495697.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 180 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 340 place count 580 transition count 1242
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 460 place count 520 transition count 1182
Applied a total of 460 rules in 77 ms. Remains 520 /752 variables (removed 232) and now considering 1182/1412 (removed 230) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-28 13:53:56] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 520 cols
[2024-05-28 13:53:56] [INFO ] Computed 52 invariants in 28 ms
[2024-05-28 13:53:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 192 places in 324 ms of which 4 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 228 places in 317 ms of which 4 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 229 places in 270 ms of which 4 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 4 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 113 places in 226 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1682 variables, and 65 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:54:20] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:54:20] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 4 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1682 variables, and 69 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 19/19 constraints]
After SMT, in 42049ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42064ms
[2024-05-28 13:54:38] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:54:38] [INFO ] Invariant cache hit.
[2024-05-28 13:54:38] [INFO ] Implicit Places using invariants in 499 ms returned [464, 465, 466, 467, 468, 469, 470, 471, 472, 473]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 515 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 510/752 places, 1182/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 500 transition count 1172
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 500 transition count 1172
Applied a total of 20 rules in 32 ms. Remains 500 /510 variables (removed 10) and now considering 1172/1182 (removed 10) transitions.
[2024-05-28 13:54:38] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 500 cols
[2024-05-28 13:54:38] [INFO ] Computed 42 invariants in 15 ms
[2024-05-28 13:54:39] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-28 13:54:39] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-28 13:54:39] [INFO ] Invariant cache hit.
[2024-05-28 13:54:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:54:44] [INFO ] Implicit Places using invariants and state equation in 4880 ms returned []
Implicit Place search using SMT with State Equation took 5338 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 500/752 places, 1172/1412 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 48030 ms. Remains : 500/752 places, 1172/1412 transitions.
[2024-05-28 13:54:44] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:54:44] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:54:44] [INFO ] Input system was already deterministic with 1172 transitions.
[2024-05-28 13:54:44] [INFO ] Flatten gal took : 36 ms
[2024-05-28 13:54:44] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:54:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17208114405753337634.gal : 5 ms
[2024-05-28 13:54:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8848097711540903675.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/CTLFireability17208114405753337634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8848097711540903675.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 750 transition count 1362
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 700 transition count 1352
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 690 transition count 1352
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 120 place count 690 transition count 1292
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 240 place count 630 transition count 1292
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 300 place count 600 transition count 1262
Applied a total of 300 rules in 65 ms. Remains 600 /752 variables (removed 152) and now considering 1262/1412 (removed 150) transitions.
Running 1260 sub problems to find dead transitions.
[2024-05-28 13:55:45] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 600 cols
[2024-05-28 13:55:45] [INFO ] Computed 52 invariants in 14 ms
[2024-05-28 13:55:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 3 ms to minimize.
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:55:58] [INFO ] Deduced a trap composed of 241 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:55:58] [INFO ] Deduced a trap composed of 255 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:55:58] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 3 ms to minimize.
[2024-05-28 13:55:59] [INFO ] Deduced a trap composed of 259 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:55:59] [INFO ] Deduced a trap composed of 213 places in 333 ms of which 4 ms to minimize.
[2024-05-28 13:55:59] [INFO ] Deduced a trap composed of 212 places in 265 ms of which 3 ms to minimize.
[2024-05-28 13:56:00] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 0 ms to minimize.
[2024-05-28 13:56:05] [INFO ] Deduced a trap composed of 258 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:56:06] [INFO ] Deduced a trap composed of 278 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:56:06] [INFO ] Deduced a trap composed of 257 places in 334 ms of which 4 ms to minimize.
[2024-05-28 13:56:06] [INFO ] Deduced a trap composed of 257 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1842 variables, and 70 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/600 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1260/1260 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2024-05-28 13:56:12] [INFO ] Deduced a trap composed of 132 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:56:12] [INFO ] Deduced a trap composed of 120 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:56:15] [INFO ] Deduced a trap composed of 270 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:56:15] [INFO ] Deduced a trap composed of 249 places in 223 ms of which 4 ms to minimize.
[2024-05-28 13:56:20] [INFO ] Deduced a trap composed of 236 places in 348 ms of which 4 ms to minimize.
[2024-05-28 13:56:21] [INFO ] Deduced a trap composed of 66 places in 332 ms of which 4 ms to minimize.
[2024-05-28 13:56:22] [INFO ] Deduced a trap composed of 387 places in 235 ms of which 3 ms to minimize.
[2024-05-28 13:56:22] [INFO ] Deduced a trap composed of 277 places in 318 ms of which 4 ms to minimize.
[2024-05-28 13:56:23] [INFO ] Deduced a trap composed of 306 places in 319 ms of which 4 ms to minimize.
[2024-05-28 13:56:23] [INFO ] Deduced a trap composed of 299 places in 213 ms of which 3 ms to minimize.
[2024-05-28 13:56:23] [INFO ] Deduced a trap composed of 307 places in 327 ms of which 3 ms to minimize.
[2024-05-28 13:56:24] [INFO ] Deduced a trap composed of 309 places in 307 ms of which 5 ms to minimize.
[2024-05-28 13:56:24] [INFO ] Deduced a trap composed of 330 places in 253 ms of which 3 ms to minimize.
[2024-05-28 13:56:24] [INFO ] Deduced a trap composed of 307 places in 231 ms of which 3 ms to minimize.
[2024-05-28 13:56:24] [INFO ] Deduced a trap composed of 307 places in 287 ms of which 4 ms to minimize.
[2024-05-28 13:56:25] [INFO ] Deduced a trap composed of 272 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1842 variables, and 86 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/600 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1260 constraints, Known Traps: 36/36 constraints]
After SMT, in 42232ms problems are : Problem set: 0 solved, 1260 unsolved
Search for dead transitions found 0 dead transitions in 42250ms
[2024-05-28 13:56:27] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
[2024-05-28 13:56:27] [INFO ] Invariant cache hit.
[2024-05-28 13:56:27] [INFO ] Implicit Places using invariants in 305 ms returned [514, 515, 516, 517, 518, 519, 520, 521, 522, 523]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 308 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 590/752 places, 1262/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 580 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 580 transition count 1252
Applied a total of 20 rules in 26 ms. Remains 580 /590 variables (removed 10) and now considering 1252/1262 (removed 10) transitions.
[2024-05-28 13:56:27] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
// Phase 1: matrix 1232 rows 580 cols
[2024-05-28 13:56:27] [INFO ] Computed 42 invariants in 14 ms
[2024-05-28 13:56:28] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-28 13:56:28] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2024-05-28 13:56:28] [INFO ] Invariant cache hit.
[2024-05-28 13:56:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:56:34] [INFO ] Implicit Places using invariants and state equation in 6808 ms returned []
Implicit Place search using SMT with State Equation took 7160 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 580/752 places, 1252/1412 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 49813 ms. Remains : 580/752 places, 1252/1412 transitions.
[2024-05-28 13:56:35] [INFO ] Flatten gal took : 60 ms
[2024-05-28 13:56:35] [INFO ] Flatten gal took : 61 ms
[2024-05-28 13:56:35] [INFO ] Input system was already deterministic with 1252 transitions.
[2024-05-28 13:56:35] [INFO ] Flatten gal took : 49 ms
[2024-05-28 13:56:35] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:56:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6612368883432365426.gal : 7 ms
[2024-05-28 13:56:35] [INFO ] Time to serialize properties into /tmp/CTLFireability412447488268081903.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6612368883432365426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability412447488268081903.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 45 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:57:36] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 13:57:36] [INFO ] Computed 52 invariants in 35 ms
[2024-05-28 13:57:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:57:49] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:57:50] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:57:50] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-05-28 13:57:50] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:57:50] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2024-05-28 13:57:50] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:57:50] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:57:50] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:57:50] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:57:51] [INFO ] Deduced a trap composed of 404 places in 294 ms of which 3 ms to minimize.
[2024-05-28 13:57:51] [INFO ] Deduced a trap composed of 209 places in 324 ms of which 4 ms to minimize.
[2024-05-28 13:57:52] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 2 ms to minimize.
[2024-05-28 13:57:53] [INFO ] Deduced a trap composed of 440 places in 290 ms of which 3 ms to minimize.
[2024-05-28 13:57:53] [INFO ] Deduced a trap composed of 432 places in 306 ms of which 4 ms to minimize.
[2024-05-28 13:57:53] [INFO ] Deduced a trap composed of 393 places in 267 ms of which 4 ms to minimize.
[2024-05-28 13:57:54] [INFO ] Deduced a trap composed of 411 places in 395 ms of which 6 ms to minimize.
[2024-05-28 13:57:54] [INFO ] Deduced a trap composed of 392 places in 378 ms of which 5 ms to minimize.
[2024-05-28 13:57:54] [INFO ] Deduced a trap composed of 370 places in 271 ms of which 3 ms to minimize.
[2024-05-28 13:57:55] [INFO ] Deduced a trap composed of 404 places in 342 ms of which 4 ms to minimize.
[2024-05-28 13:57:56] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:58:00] [INFO ] Deduced a trap composed of 360 places in 341 ms of which 5 ms to minimize.
[2024-05-28 13:58:08] [INFO ] Deduced a trap composed of 491 places in 233 ms of which 4 ms to minimize.
[2024-05-28 13:58:08] [INFO ] Deduced a trap composed of 493 places in 354 ms of which 4 ms to minimize.
[2024-05-28 13:58:08] [INFO ] Deduced a trap composed of 389 places in 255 ms of which 4 ms to minimize.
[2024-05-28 13:58:09] [INFO ] Deduced a trap composed of 381 places in 396 ms of which 5 ms to minimize.
[2024-05-28 13:58:09] [INFO ] Deduced a trap composed of 379 places in 337 ms of which 6 ms to minimize.
[2024-05-28 13:58:10] [INFO ] Deduced a trap composed of 448 places in 257 ms of which 3 ms to minimize.
[2024-05-28 13:58:10] [INFO ] Deduced a trap composed of 357 places in 364 ms of which 5 ms to minimize.
[2024-05-28 13:58:12] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:58:12] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 2 ms to minimize.
[2024-05-28 13:58:16] [INFO ] Deduced a trap composed of 384 places in 387 ms of which 6 ms to minimize.
[2024-05-28 13:58:17] [INFO ] Deduced a trap composed of 387 places in 354 ms of which 5 ms to minimize.
[2024-05-28 13:58:17] [INFO ] Deduced a trap composed of 383 places in 315 ms of which 4 ms to minimize.
[2024-05-28 13:58:17] [INFO ] Deduced a trap composed of 469 places in 295 ms of which 4 ms to minimize.
SMT process timed out in 41909ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41928ms
[2024-05-28 13:58:17] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:58:17] [INFO ] Invariant cache hit.
[2024-05-28 13:58:18] [INFO ] Implicit Places using invariants in 393 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 396 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 9 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42384 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 13:58:18] [INFO ] Flatten gal took : 39 ms
[2024-05-28 13:58:18] [INFO ] Flatten gal took : 43 ms
[2024-05-28 13:58:18] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:58:18] [INFO ] Flatten gal took : 42 ms
[2024-05-28 13:58:18] [INFO ] Flatten gal took : 40 ms
[2024-05-28 13:58:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17551042171535970200.gal : 6 ms
[2024-05-28 13:58:18] [INFO ] Time to serialize properties into /tmp/CTLFireability4734720844006238246.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/CTLFireability17551042171535970200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4734720844006238246.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 23 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:59:19] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:59:19] [INFO ] Invariant cache hit.
[2024-05-28 13:59:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:59:36] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 9.0)
(s203 0.0)
(s204 1.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:59:42] [INFO ] Deduced a trap composed of 203 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:59:42] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:59:43] [INFO ] Deduced a trap composed of 367 places in 242 ms of which 4 ms to minimize.
[2024-05-28 13:59:51] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2024-05-28 13:59:51] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 491 places in 316 ms of which 4 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 491 places in 280 ms of which 3 ms to minimize.
[2024-05-28 13:59:53] [INFO ] Deduced a trap composed of 491 places in 341 ms of which 5 ms to minimize.
[2024-05-28 13:59:59] [INFO ] Deduced a trap composed of 384 places in 240 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 18/18 constraints]
After SMT, in 41573ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41585ms
[2024-05-28 14:00:00] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:00:00] [INFO ] Invariant cache hit.
[2024-05-28 14:00:01] [INFO ] Implicit Places using invariants in 635 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 638 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 7 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42256 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 14:00:01] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:00:01] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:00:01] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 14:00:01] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:00:01] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:00:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14092709359683209934.gal : 5 ms
[2024-05-28 14:00:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10359883432020204309.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/CTLFireability14092709359683209934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10359883432020204309.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Applied a total of 2 rules in 8 ms. Remains 750 /752 variables (removed 2) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-28 14:01:02] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 750 cols
[2024-05-28 14:01:02] [INFO ] Computed 52 invariants in 38 ms
[2024-05-28 14:01:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 14:01:17] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:01:17] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:01:17] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-05-28 14:01:17] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 2 ms to minimize.
[2024-05-28 14:01:18] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:01:18] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:01:18] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:01:18] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:01:18] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:01:19] [INFO ] Deduced a trap composed of 414 places in 386 ms of which 6 ms to minimize.
[2024-05-28 14:01:19] [INFO ] Deduced a trap composed of 389 places in 367 ms of which 5 ms to minimize.
[2024-05-28 14:01:19] [INFO ] Deduced a trap composed of 406 places in 392 ms of which 5 ms to minimize.
[2024-05-28 14:01:20] [INFO ] Deduced a trap composed of 243 places in 314 ms of which 5 ms to minimize.
[2024-05-28 14:01:20] [INFO ] Deduced a trap composed of 376 places in 303 ms of which 4 ms to minimize.
[2024-05-28 14:01:21] [INFO ] Deduced a trap composed of 247 places in 267 ms of which 4 ms to minimize.
[2024-05-28 14:01:22] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:01:22] [INFO ] Deduced a trap composed of 413 places in 383 ms of which 4 ms to minimize.
[2024-05-28 14:01:23] [INFO ] Deduced a trap composed of 400 places in 319 ms of which 5 ms to minimize.
[2024-05-28 14:01:23] [INFO ] Deduced a trap composed of 393 places in 295 ms of which 4 ms to minimize.
[2024-05-28 14:01:24] [INFO ] Deduced a trap composed of 475 places in 427 ms of which 5 ms to minimize.
SMT process timed out in 21818ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 21830ms
[2024-05-28 14:01:24] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 14:01:24] [INFO ] Invariant cache hit.
[2024-05-28 14:01:24] [INFO ] Implicit Places using invariants in 499 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 502 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 740/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 12 ms. Remains 740 /740 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22357 ms. Remains : 740/752 places, 1412/1412 transitions.
[2024-05-28 14:01:24] [INFO ] Flatten gal took : 55 ms
[2024-05-28 14:01:24] [INFO ] Flatten gal took : 49 ms
[2024-05-28 14:01:24] [INFO ] Input system was already deterministic with 1412 transitions.
[2024-05-28 14:01:24] [INFO ] Flatten gal took : 48 ms
[2024-05-28 14:01:24] [INFO ] Flatten gal took : 52 ms
[2024-05-28 14:01:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8958456851574062430.gal : 17 ms
[2024-05-28 14:01:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17627453498643441649.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/CTLFireability8958456851574062430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17627453498643441649.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:28:58] [INFO ] Applying decomposition
[2024-05-28 14:28:58] [INFO ] Flatten gal took : 71 ms
[2024-05-28 14:28:58] [INFO ] Decomposing Gal with order
[2024-05-28 14:28:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:28:58] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, Idle_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, Try_Check_Sources_E_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, Idle_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, Try_Check_Sources_E_7, P_1617_7, ScheduleTaskE_Idle_7],[AwakeTasks_8, IdleTasks_8, NotifyEventJobQueuedE_8, QueueJobE_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingE_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, NotifyEventSourceAddedB_8, Insert_Source_E_8, NotifyEventSourceAddedE_8, P_1113_8, ProcessingEvt_8, P_1155_8, nyo_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, NotifyEventEndOfCheckSourcesE_8, Check_Sources_B_8, Check_Sources_E_8, Idle_8, NotifyEventJobCompletedE_8, NotifyEventJobCompletedB_8, RunE_8, RunB_8, Perform_Work_E_8, Try_Check_Sources_B_8, Try_Check_Sources_E_8, P_1617_8, ScheduleTaskE_Idle_8],[AwakeTasks_9, IdleTasks_9, NotifyEventJobQueuedE_9, QueueJobE_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingE_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, NotifyEventSourceAddedB_9, Insert_Source_E_9, NotifyEventSourceAddedE_9, P_1113_9, ProcessingEvt_9, P_1155_9, nyo_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, NotifyEventEndOfCheckSourcesE_9, Check_Sources_B_9, Check_Sources_E_9, Idle_9, NotifyEventJobCompletedE_9, NotifyEventJobCompletedB_9, RunE_9, RunB_9, Perform_Work_E_9, Try_Check_Sources_B_9, Try_Check_Sources_E_9, P_1617_9, ScheduleTaskE_Idle_9],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 14:28:59] [INFO ] Flatten gal took : 55 ms
[2024-05-28 14:28:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7403148377610861915.gal : 7 ms
[2024-05-28 14:28:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9532779618218571111.ctl : 12 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/CTLFireability7403148377610861915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9532779618218571111.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 11 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;