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-171654446300082.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-S02J04T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 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.6K 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.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716903285041

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-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-28 13:34:46] [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:34:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:34:46] [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:34:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:34:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 784 ms
[2024-05-28 13:34:47] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2024-05-28 13:34:47] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-28 13:34:47] [INFO ] Skeletonized 15 HLPN properties in 3 ms. Removed 1 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 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 62 to 61
RANDOM walk for 40000 steps (17 resets) in 1697 ms. (23 steps per ms) remains 14/61 properties
BEST_FIRST walk for 40001 steps (12 resets) in 303 ms. (131 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40001 steps (9 resets) in 215 ms. (185 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 236 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (15 resets) in 323 ms. (123 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 154 ms. (258 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (9 resets) in 354 ms. (112 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (13 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (11 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (12 resets) in 205 ms. (194 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (12 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 117 ms. (338 steps per ms) remains 13/13 properties
[2024-05-28 13:34:48] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:34:48] [INFO ] Computed 26 invariants in 6 ms
[2024-05-28 13:34:48] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/58 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/9 constraints. Problems are: Problem set: 4 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/61 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 6 (OVERLAPS) 16/77 variables, 11/23 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-05-28 13:34:49] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/24 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 9 solved, 4 unsolved in 503 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: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/46 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/52 variables, 4/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/53 variables, 1/10 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/73 variables, 11/21 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 4/117 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/117 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/119 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/120 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/145 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 120 constraints, problems are : Problem set: 9 solved, 4 unsolved in 310 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/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 875ms problems are : Problem set: 9 solved, 4 unsolved
Parikh walk visited 0 properties in 3279 ms.
Support contains 11 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 60
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 75 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 15 place count 73 transition count 55
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 70 transition count 55
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 31 place count 65 transition count 50
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 65 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 63 transition count 48
Applied a total of 35 rules in 25 ms. Remains 63 /81 variables (removed 18) and now considering 48/65 (removed 17) transitions.
Running 47 sub problems to find dead transitions.
[2024-05-28 13:34:53] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 63 cols
[2024-05-28 13:34:53] [INFO ] Computed 25 invariants in 4 ms
[2024-05-28 13:34:53] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-28 13:34:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-28 13:34:53] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:34:53] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:34:53] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:34:53] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 13:34:53] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 5/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-28 13:34:53] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-28 13:34:54] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:34:54] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:34:54] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 47/110 variables, 63/98 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 106 constraints, problems are : Problem set: 2 solved, 45 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 2 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 47/110 variables, 63/98 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 45/151 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-28 13:34:55] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 1/152 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-28 13:34:56] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/110 variables, 1/153 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 0/110 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 153 constraints, problems are : Problem set: 2 solved, 45 unsolved in 2139 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/47 constraints, Known Traps: 12/12 constraints]
After SMT, in 4006ms problems are : Problem set: 2 solved, 45 unsolved
Search for dead transitions found 2 dead transitions in 4007ms
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 : 63/81 places, 46/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 0 places and 2 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4052 ms. Remains : 63/81 places, 42/65 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S02J04T08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:34:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 13:34:57] [INFO ] Flatten gal took : 69 ms
FORMULA PolyORBLF-COL-S02J04T08-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:34:57] [INFO ] Flatten gal took : 10 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:34:57] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 34 ms.
[2024-05-28 13:34:57] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-05-28 13:34:57] [INFO ] Reduced 88 identical enabling conditions.
[2024-05-28 13:34:57] [INFO ] Reduced 32 identical enabling conditions.
[2024-05-28 13:34:57] [INFO ] Reduced 88 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 571 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 16 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-28 13:34:57] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-05-28 13:34:57] [INFO ] Computed 48 invariants in 46 ms
[2024-05-28 13:34:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 13:35:10] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 4 ms to minimize.
[2024-05-28 13:35:10] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:35:11] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:35:11] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:35:11] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 3 ms to minimize.
[2024-05-28 13:35:11] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-28 13:35:11] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-05-28 13:35:11] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-28 13:35:13] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 2 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 300 places in 311 ms of which 4 ms to minimize.
[2024-05-28 13:35:18] [INFO ] Deduced a trap composed of 312 places in 296 ms of which 5 ms to minimize.
[2024-05-28 13:35:18] [INFO ] Deduced a trap composed of 322 places in 303 ms of which 5 ms to minimize.
[2024-05-28 13:35:19] [INFO ] Deduced a trap composed of 318 places in 411 ms of which 5 ms to minimize.
SMT process timed out in 21617ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 21664ms
[2024-05-28 13:35:19] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 13:35:19] [INFO ] Invariant cache hit.
[2024-05-28 13:35:19] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 13:35:19] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 13:35:19] [INFO ] Invariant cache hit.
[2024-05-28 13:35:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:35:20] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2024-05-28 13:35:20] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 13:35:20] [INFO ] Invariant cache hit.
[2024-05-28 13:35:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 13:35:32] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 2 ms to minimize.
[2024-05-28 13:35:34] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 2 ms to minimize.
[2024-05-28 13:35:34] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:35:34] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:35:34] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:35:34] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:35:34] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:35:34] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 2 ms to minimize.
[2024-05-28 13:35:37] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 8 ms to minimize.
[2024-05-28 13:35:38] [INFO ] Deduced a trap composed of 308 places in 331 ms of which 5 ms to minimize.
[2024-05-28 13:35:38] [INFO ] Deduced a trap composed of 326 places in 307 ms of which 4 ms to minimize.
[2024-05-28 13:35:39] [INFO ] Deduced a trap composed of 340 places in 306 ms of which 5 ms to minimize.
[2024-05-28 13:35:39] [INFO ] Deduced a trap composed of 338 places in 317 ms of which 5 ms to minimize.
[2024-05-28 13:35:43] [INFO ] Deduced a trap composed of 70 places in 298 ms of which 6 ms to minimize.
[2024-05-28 13:35:44] [INFO ] Deduced a trap composed of 328 places in 254 ms of which 3 ms to minimize.
[2024-05-28 13:35:44] [INFO ] Deduced a trap composed of 344 places in 266 ms of which 4 ms to minimize.
[2024-05-28 13:35:44] [INFO ] Deduced a trap composed of 332 places in 265 ms of which 5 ms to minimize.
[2024-05-28 13:35:44] [INFO ] Deduced a trap composed of 333 places in 215 ms of which 4 ms to minimize.
[2024-05-28 13:35:45] [INFO ] Deduced a trap composed of 333 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:35:45] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 13:35:46] [INFO ] Deduced a trap composed of 314 places in 294 ms of which 4 ms to minimize.
[2024-05-28 13:35:47] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 5 ms to minimize.
[2024-05-28 13:35:47] [INFO ] Deduced a trap composed of 183 places in 251 ms of which 4 ms to minimize.
[2024-05-28 13:35:47] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 5 ms to minimize.
[2024-05-28 13:35:48] [INFO ] Deduced a trap composed of 201 places in 260 ms of which 5 ms to minimize.
[2024-05-28 13:35:48] [INFO ] Deduced a trap composed of 369 places in 325 ms of which 4 ms to minimize.
[2024-05-28 13:35:49] [INFO ] Deduced a trap composed of 372 places in 303 ms of which 4 ms to minimize.
[2024-05-28 13:35:50] [INFO ] Deduced a trap composed of 314 places in 327 ms of which 8 ms to minimize.
[2024-05-28 13:35:50] [INFO ] Deduced a trap composed of 331 places in 293 ms of which 4 ms to minimize.
[2024-05-28 13:35:50] [INFO ] Deduced a trap composed of 320 places in 276 ms of which 3 ms to minimize.
[2024-05-28 13:35:50] [INFO ] Deduced a trap composed of 322 places in 287 ms of which 5 ms to minimize.
[2024-05-28 13:35:51] [INFO ] Deduced a trap composed of 329 places in 255 ms of which 4 ms to minimize.
[2024-05-28 13:35:51] [INFO ] Deduced a trap composed of 348 places in 242 ms of which 4 ms to minimize.
[2024-05-28 13:35:51] [INFO ] Deduced a trap composed of 333 places in 252 ms of which 3 ms to minimize.
[2024-05-28 13:35:52] [INFO ] Deduced a trap composed of 332 places in 302 ms of which 5 ms to minimize.
[2024-05-28 13:35:52] [INFO ] Deduced a trap composed of 300 places in 277 ms of which 6 ms to minimize.
SMT process timed out in 31755ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 31778ms
Starting structural reductions in LTL mode, iteration 1 : 612/614 places, 1114/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54912 ms. Remains : 612/614 places, 1114/1114 transitions.
Support contains 571 out of 612 places after structural reductions.
[2024-05-28 13:35:52] [INFO ] Flatten gal took : 109 ms
[2024-05-28 13:35:52] [INFO ] Flatten gal took : 98 ms
[2024-05-28 13:35:52] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 563 out of 612 places (down from 571) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 66 to 63
RANDOM walk for 40000 steps (15 resets) in 1055 ms. (37 steps per ms) remains 12/63 properties
BEST_FIRST walk for 40002 steps (8 resets) in 483 ms. (82 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (9 resets) in 334 ms. (119 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 382 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 295 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (10 resets) in 291 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (11 resets) in 256 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 249 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 271 ms. (147 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (10 resets) in 240 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (9 resets) in 247 ms. (161 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 277 ms. (143 steps per ms) remains 12/12 properties
[2024-05-28 13:35:54] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 13:35:54] [INFO ] Invariant cache hit.
[2024-05-28 13:35:54] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 323/544 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp55 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 3/17 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/545 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 7 (OVERLAPS) 59/604 variables, 23/41 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/41 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/610 variables, 6/47 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/47 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1098/1708 variables, 610/657 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1708 variables, 96/753 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-05-28 13:35:57] [INFO ] Deduced a trap composed of 381 places in 324 ms of which 5 ms to minimize.
[2024-05-28 13:35:57] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1708 variables, 2/755 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1708 variables, 0/755 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1710 variables, 2/757 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1710 variables, 1/758 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1710 variables, 0/758 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1710/1710 variables, and 758 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 612/612 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 463/523 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/525 variables, 2/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 79/604 variables, 33/41 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 2/43 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-05-28 13:36:00] [INFO ] Deduced a trap composed of 65 places in 345 ms of which 5 ms to minimize.
[2024-05-28 13:36:00] [INFO ] Deduced a trap composed of 65 places in 319 ms of which 5 ms to minimize.
[2024-05-28 13:36:01] [INFO ] Deduced a trap composed of 66 places in 288 ms of which 3 ms to minimize.
[2024-05-28 13:36:01] [INFO ] Deduced a trap composed of 324 places in 233 ms of which 3 ms to minimize.
[2024-05-28 13:36:01] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:36:01] [INFO ] Deduced a trap composed of 284 places in 230 ms of which 3 ms to minimize.
[2024-05-28 13:36:02] [INFO ] Deduced a trap composed of 315 places in 290 ms of which 5 ms to minimize.
[2024-05-28 13:36:02] [INFO ] Deduced a trap composed of 315 places in 286 ms of which 5 ms to minimize.
[2024-05-28 13:36:02] [INFO ] Deduced a trap composed of 329 places in 267 ms of which 4 ms to minimize.
[2024-05-28 13:36:02] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:36:03] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 11/54 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/610 variables, 6/60 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/60 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1710 variables, and 670 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 610/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 13/13 constraints]
After SMT, in 10139ms problems are : Problem set: 8 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 612 transition count 1074
Reduce places removed 40 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 56 rules applied. Total rules applied 96 place count 572 transition count 1058
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 112 place count 556 transition count 1058
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 112 place count 556 transition count 994
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 240 place count 492 transition count 994
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 336 place count 444 transition count 946
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 352 place count 444 transition count 930
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 368 place count 428 transition count 930
Applied a total of 368 rules in 139 ms. Remains 428 /612 variables (removed 184) and now considering 930/1114 (removed 184) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-28 13:36:05] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 428 cols
[2024-05-28 13:36:05] [INFO ] Computed 48 invariants in 25 ms
[2024-05-28 13:36:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 13:36:11] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 181 places in 246 ms of which 3 ms to minimize.
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 164 places in 267 ms of which 5 ms to minimize.
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:36:14] [INFO ] Deduced a trap composed of 148 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 13:36:23] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:36:26] [INFO ] Deduced a trap composed of 173 places in 230 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1342 variables, and 60 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 13:36:31] [INFO ] Deduced a trap composed of 250 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:36:32] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:36:32] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:36:36] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 13:36:43] [INFO ] Deduced a trap composed of 215 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:36:44] [INFO ] Deduced a trap composed of 187 places in 239 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1342 variables, and 66 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 20/20 constraints]
After SMT, in 41748ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41760ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41903 ms. Remains : 428/612 places, 930/1114 transitions.
RANDOM walk for 40000 steps (11 resets) in 363 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (11 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 160911 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 4
Probabilistic random walk after 160911 steps, saw 94562 distinct states, run finished after 3005 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-28 13:36:50] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 13:36:50] [INFO ] Invariant cache hit.
[2024-05-28 13:36:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 313/381 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/392 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/425 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/426 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 914/1340 variables, 426/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1340 variables, 96/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1340 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/1342 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1342 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1342 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1342/1342 variables, and 572 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 428/428 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 313/381 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:52] [INFO ] Deduced a trap composed of 204 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:36:52] [INFO ] Deduced a trap composed of 194 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/392 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 33/425 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:53] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 3 ms to minimize.
[2024-05-28 13:36:53] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:36:53] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:36:53] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:36:53] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:36:53] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:36:53] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 914/1340 variables, 426/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1340 variables, 96/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1340 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:37:04] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1340 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1340 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/1342 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 47030ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10057 ms.
Support contains 60 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 930/930 transitions.
Applied a total of 0 rules in 35 ms. Remains 428 /428 variables (removed 0) and now considering 930/930 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 428/428 places, 930/930 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 930/930 transitions.
Applied a total of 0 rules in 17 ms. Remains 428 /428 variables (removed 0) and now considering 930/930 (removed 0) transitions.
[2024-05-28 13:37:47] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 13:37:47] [INFO ] Invariant cache hit.
[2024-05-28 13:37:47] [INFO ] Implicit Places using invariants in 376 ms returned [382, 383, 384, 385, 386, 387, 388, 389]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 380 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 420/428 places, 930/930 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 412 transition count 922
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 412 transition count 922
Applied a total of 16 rules in 32 ms. Remains 412 /420 variables (removed 8) and now considering 922/930 (removed 8) transitions.
[2024-05-28 13:37:47] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
// Phase 1: matrix 906 rows 412 cols
[2024-05-28 13:37:47] [INFO ] Computed 40 invariants in 39 ms
[2024-05-28 13:37:48] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-28 13:37:48] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 13:37:48] [INFO ] Invariant cache hit.
[2024-05-28 13:37:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:37:53] [INFO ] Implicit Places using invariants and state equation in 5670 ms returned []
Implicit Place search using SMT with State Equation took 6168 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 412/428 places, 922/930 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6600 ms. Remains : 412/428 places, 922/930 transitions.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
[2024-05-28 13:37:54] [INFO ] Flatten gal took : 96 ms
[2024-05-28 13:37:54] [INFO ] Flatten gal took : 84 ms
[2024-05-28 13:37:54] [INFO ] Input system was already deterministic with 1114 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 46 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:37:54] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-28 13:37:54] [INFO ] Computed 48 invariants in 32 ms
[2024-05-28 13:37:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:38:04] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:38:04] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 1 ms to minimize.
[2024-05-28 13:38:04] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:38:04] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 328 places in 310 ms of which 5 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 316 places in 253 ms of which 3 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 327 places in 238 ms of which 3 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 320 places in 261 ms of which 4 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 302 places in 274 ms of which 4 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 183 places in 192 ms of which 4 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 327 places in 316 ms of which 5 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 379 places in 235 ms of which 4 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 313 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 388 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 301 places in 194 ms of which 4 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 314 places in 289 ms of which 4 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 324 places in 281 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:38:10] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:38:11] [INFO ] Deduced a trap composed of 356 places in 252 ms of which 3 ms to minimize.
[2024-05-28 13:38:14] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 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 9.0)
(s163 1.0)
(s164 0.0)
(s165 1.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 1.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 (/ 2.0 3.0))
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 (/ 1.0 3.0))
(s210 (/ 1.0 3.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 0.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 1.0)
(s263 0.0)
(s264 0.0)
(s265 (/ 2.0 3.0))
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:38:28] [INFO ] Deduced a trap composed of 294 places in 288 ms of which 4 ms to minimize.
[2024-05-28 13:38:28] [INFO ] Deduced a trap composed of 314 places in 315 ms of which 4 ms to minimize.
[2024-05-28 13:38:31] [INFO ] Deduced a trap composed of 365 places in 278 ms of which 5 ms to minimize.
[2024-05-28 13:38:31] [INFO ] Deduced a trap composed of 409 places in 262 ms of which 4 ms to minimize.
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 318 places in 229 ms of which 4 ms to minimize.
[2024-05-28 13:38:32] [INFO ] Deduced a trap composed of 347 places in 224 ms of which 4 ms to minimize.
[2024-05-28 13:38:34] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 76 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 30/30 constraints]
After SMT, in 41739ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41755ms
[2024-05-28 13:38:36] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:38:36] [INFO ] Invariant cache hit.
[2024-05-28 13:38:36] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-28 13:38:36] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:38:36] [INFO ] Invariant cache hit.
[2024-05-28 13:38:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:38:42] [INFO ] Implicit Places using invariants and state equation in 5608 ms returned []
Implicit Place search using SMT with State Equation took 6011 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:38:42] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:38:42] [INFO ] Invariant cache hit.
[2024-05-28 13:38:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:38:52] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 2 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:38:57] [INFO ] Deduced a trap composed of 347 places in 302 ms of which 5 ms to minimize.
[2024-05-28 13:38:57] [INFO ] Deduced a trap composed of 338 places in 268 ms of which 5 ms to minimize.
[2024-05-28 13:38:57] [INFO ] Deduced a trap composed of 276 places in 292 ms of which 5 ms to minimize.
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 300 places in 260 ms of which 3 ms to minimize.
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 340 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 315 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 323 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:39:02] [INFO ] Deduced a trap composed of 185 places in 306 ms of which 4 ms to minimize.
[2024-05-28 13:39:03] [INFO ] Deduced a trap composed of 114 places in 271 ms of which 4 ms to minimize.
[2024-05-28 13:39:06] [INFO ] Deduced a trap composed of 293 places in 198 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:39:06] [INFO ] Deduced a trap composed of 316 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:39:07] [INFO ] Deduced a trap composed of 311 places in 196 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:39:27] [INFO ] Deduced a trap composed of 417 places in 311 ms of which 4 ms to minimize.
[2024-05-28 13:39:28] [INFO ] Deduced a trap composed of 341 places in 270 ms of which 3 ms to minimize.
[2024-05-28 13:39:28] [INFO ] Deduced a trap composed of 355 places in 269 ms of which 4 ms to minimize.
[2024-05-28 13:39:28] [INFO ] Deduced a trap composed of 355 places in 257 ms of which 4 ms to minimize.
[2024-05-28 13:39:29] [INFO ] Deduced a trap composed of 353 places in 263 ms of which 4 ms to minimize.
[2024-05-28 13:39:29] [INFO ] Deduced a trap composed of 353 places in 286 ms of which 4 ms to minimize.
[2024-05-28 13:39:29] [INFO ] Deduced a trap composed of 355 places in 231 ms of which 3 ms to minimize.
[2024-05-28 13:39:29] [INFO ] Deduced a trap composed of 355 places in 295 ms of which 4 ms to minimize.
[2024-05-28 13:39:30] [INFO ] Deduced a trap composed of 355 places in 264 ms of which 3 ms to minimize.
[2024-05-28 13:39:30] [INFO ] Deduced a trap composed of 330 places in 234 ms of which 3 ms to minimize.
[2024-05-28 13:39:30] [INFO ] Deduced a trap composed of 357 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:39:30] [INFO ] Deduced a trap composed of 342 places in 206 ms of which 3 ms to minimize.
[2024-05-28 13:39:31] [INFO ] Deduced a trap composed of 352 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:39:31] [INFO ] Deduced a trap composed of 352 places in 262 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:39:35] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:39:35] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 84 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 38/38 constraints]
After SMT, in 61151ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61165ms
Starting structural reductions in LTL mode, iteration 1 : 596/612 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108990 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-28 13:39:43] [INFO ] Flatten gal took : 36 ms
[2024-05-28 13:39:43] [INFO ] Flatten gal took : 40 ms
[2024-05-28 13:39:43] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:39:43] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:39:43] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:39:43] [INFO ] Time to serialize gal into /tmp/CTLFireability12166290855017857234.gal : 16 ms
[2024-05-28 13:39:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14578095609089280483.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/CTLFireability12166290855017857234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14578095609089280483.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:40:14] [INFO ] Flatten gal took : 67 ms
[2024-05-28 13:40:14] [INFO ] Applying decomposition
[2024-05-28 13:40:14] [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/graph7872725399601661726.txt' '-o' '/tmp/graph7872725399601661726.bin' '-w' '/tmp/graph7872725399601661726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7872725399601661726.bin' '-l' '-1' '-v' '-w' '/tmp/graph7872725399601661726.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:40:14] [INFO ] Decomposing Gal with order
[2024-05-28 13:40:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:40:14] [INFO ] Removed a total of 686 redundant transitions.
[2024-05-28 13:40:14] [INFO ] Flatten gal took : 180 ms
[2024-05-28 13:40:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 316 labels/synchronizations in 41 ms.
[2024-05-28 13:40:14] [INFO ] Time to serialize gal into /tmp/CTLFireability583895803950190662.gal : 17 ms
[2024-05-28 13:40:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11055562691503315021.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/CTLFireability583895803950190662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11055562691503315021.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 38 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:40:44] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:40:44] [INFO ] Invariant cache hit.
[2024-05-28 13:40:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:40:55] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:40:57] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 19 ms to minimize.
[2024-05-28 13:40:57] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:40:57] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2024-05-28 13:40:57] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:40:57] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2024-05-28 13:40:57] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:40:58] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 0 ms to minimize.
[2024-05-28 13:40:58] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2024-05-28 13:40:58] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 0 ms to minimize.
[2024-05-28 13:41:00] [INFO ] Deduced a trap composed of 347 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:41:00] [INFO ] Deduced a trap composed of 338 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:41:00] [INFO ] Deduced a trap composed of 276 places in 225 ms of which 2 ms to minimize.
[2024-05-28 13:41:00] [INFO ] Deduced a trap composed of 300 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:41:01] [INFO ] Deduced a trap composed of 340 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:41:01] [INFO ] Deduced a trap composed of 315 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:41:01] [INFO ] Deduced a trap composed of 323 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:41:05] [INFO ] Deduced a trap composed of 185 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:41:08] [INFO ] Deduced a trap composed of 280 places in 243 ms of which 3 ms to minimize.
[2024-05-28 13:41:15] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:41:20] [INFO ] Deduced a trap composed of 180 places in 257 ms of which 3 ms to minimize.
[2024-05-28 13:41:21] [INFO ] Deduced a trap composed of 311 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:41:24] [INFO ] Deduced a trap composed of 321 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41386ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41396ms
[2024-05-28 13:41:26] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:41:26] [INFO ] Invariant cache hit.
[2024-05-28 13:41:26] [INFO ] Implicit Places using invariants in 303 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 317 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 8 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41761 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 13:41:26] [INFO ] Flatten gal took : 57 ms
[2024-05-28 13:41:26] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:41:26] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:41:26] [INFO ] Flatten gal took : 68 ms
[2024-05-28 13:41:26] [INFO ] Flatten gal took : 57 ms
[2024-05-28 13:41:26] [INFO ] Time to serialize gal into /tmp/CTLFireability4756020482629879055.gal : 7 ms
[2024-05-28 13:41:27] [INFO ] Time to serialize properties into /tmp/CTLFireability960411065294926807.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/CTLFireability4756020482629879055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability960411065294926807.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:41:57] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:41:57] [INFO ] Applying decomposition
[2024-05-28 13:41:57] [INFO ] Flatten gal took : 53 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/graph5702623477096451571.txt' '-o' '/tmp/graph5702623477096451571.bin' '-w' '/tmp/graph5702623477096451571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5702623477096451571.bin' '-l' '-1' '-v' '-w' '/tmp/graph5702623477096451571.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:41:57] [INFO ] Decomposing Gal with order
[2024-05-28 13:41:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:41:57] [INFO ] Removed a total of 920 redundant transitions.
[2024-05-28 13:41:57] [INFO ] Flatten gal took : 110 ms
[2024-05-28 13:41:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 226 labels/synchronizations in 30 ms.
[2024-05-28 13:41:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13315070842634172696.gal : 14 ms
[2024-05-28 13:41:57] [INFO ] Time to serialize properties into /tmp/CTLFireability116170148949706420.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/CTLFireability13315070842634172696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability116170148949706420.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 40 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:42:27] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:42:27] [INFO ] Invariant cache hit.
[2024-05-28 13:42:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:42:38] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 63 places in 200 ms of which 3 ms to minimize.
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 2 ms to minimize.
[2024-05-28 13:42:42] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:42:42] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-28 13:42:44] [INFO ] Deduced a trap composed of 347 places in 297 ms of which 4 ms to minimize.
[2024-05-28 13:42:44] [INFO ] Deduced a trap composed of 338 places in 279 ms of which 4 ms to minimize.
[2024-05-28 13:42:45] [INFO ] Deduced a trap composed of 276 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:42:45] [INFO ] Deduced a trap composed of 300 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:42:45] [INFO ] Deduced a trap composed of 340 places in 217 ms of which 4 ms to minimize.
[2024-05-28 13:42:45] [INFO ] Deduced a trap composed of 315 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:42:46] [INFO ] Deduced a trap composed of 323 places in 209 ms of which 3 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 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 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 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:42:50] [INFO ] Deduced a trap composed of 148 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:42:50] [INFO ] Deduced a trap composed of 167 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:42:50] [INFO ] Deduced a trap composed of 180 places in 193 ms of which 3 ms to minimize.
[2024-05-28 13:42:51] [INFO ] Deduced a trap composed of 185 places in 244 ms of which 3 ms to minimize.
[2024-05-28 13:42:51] [INFO ] Deduced a trap composed of 293 places in 326 ms of which 4 ms to minimize.
[2024-05-28 13:42:59] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:43:01] [INFO ] Deduced a trap composed of 305 places in 281 ms of which 4 ms to minimize.
[2024-05-28 13:43:02] [INFO ] Deduced a trap composed of 414 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:43:07] [INFO ] Deduced a trap composed of 355 places in 236 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 72 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 41315ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41340ms
[2024-05-28 13:43:09] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:43:09] [INFO ] Invariant cache hit.
[2024-05-28 13:43:09] [INFO ] Implicit Places using invariants in 289 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 304 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41694 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 13:43:09] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:43:09] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:43:09] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:43:09] [INFO ] Flatten gal took : 30 ms
[2024-05-28 13:43:09] [INFO ] Flatten gal took : 31 ms
[2024-05-28 13:43:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8945259893260174751.gal : 9 ms
[2024-05-28 13:43:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13983469072116274637.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/CTLFireability8945259893260174751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13983469072116274637.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:43:39] [INFO ] Flatten gal took : 59 ms
[2024-05-28 13:43:39] [INFO ] Applying decomposition
[2024-05-28 13:43:39] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5649922610887533290.txt' '-o' '/tmp/graph5649922610887533290.bin' '-w' '/tmp/graph5649922610887533290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5649922610887533290.bin' '-l' '-1' '-v' '-w' '/tmp/graph5649922610887533290.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:43:39] [INFO ] Decomposing Gal with order
[2024-05-28 13:43:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:43:40] [INFO ] Removed a total of 794 redundant transitions.
[2024-05-28 13:43:40] [INFO ] Flatten gal took : 158 ms
[2024-05-28 13:43:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 18 ms.
[2024-05-28 13:43:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12247428047049259218.gal : 39 ms
[2024-05-28 13:43:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17680368895269588559.ctl : 11 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/CTLFireability12247428047049259218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17680368895269588559.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 48 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:44:10] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:44:10] [INFO ] Invariant cache hit.
[2024-05-28 13:44:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:44:20] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:44:22] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 2 ms to minimize.
[2024-05-28 13:44:22] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:44:22] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 0 ms to minimize.
[2024-05-28 13:44:22] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 0 ms to minimize.
[2024-05-28 13:44:22] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:44:22] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:44:22] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2024-05-28 13:44:22] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 4 ms to minimize.
[2024-05-28 13:44:23] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:44:25] [INFO ] Deduced a trap composed of 347 places in 278 ms of which 3 ms to minimize.
[2024-05-28 13:44:25] [INFO ] Deduced a trap composed of 338 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:44:25] [INFO ] Deduced a trap composed of 276 places in 294 ms of which 4 ms to minimize.
[2024-05-28 13:44:26] [INFO ] Deduced a trap composed of 300 places in 275 ms of which 4 ms to minimize.
[2024-05-28 13:44:26] [INFO ] Deduced a trap composed of 340 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:44:26] [INFO ] Deduced a trap composed of 315 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:44:26] [INFO ] Deduced a trap composed of 323 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:44:29] [INFO ] Deduced a trap composed of 185 places in 290 ms of which 4 ms to minimize.
[2024-05-28 13:44:31] [INFO ] Deduced a trap composed of 114 places in 295 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 65 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:44:33] [INFO ] Deduced a trap composed of 294 places in 227 ms of which 5 ms to minimize.
[2024-05-28 13:44:33] [INFO ] Deduced a trap composed of 355 places in 283 ms of which 4 ms to minimize.
[2024-05-28 13:44:37] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:44:42] [INFO ] Deduced a trap composed of 306 places in 293 ms of which 5 ms to minimize.
[2024-05-28 13:44:42] [INFO ] Deduced a trap composed of 71 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:44:43] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41178ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41188ms
[2024-05-28 13:44:51] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:44:51] [INFO ] Invariant cache hit.
[2024-05-28 13:44:51] [INFO ] Implicit Places using invariants in 376 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 391 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 4 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41641 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 13:44:52] [INFO ] Flatten gal took : 26 ms
[2024-05-28 13:44:52] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:44:52] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:44:52] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:44:52] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:44:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4611119573283604064.gal : 5 ms
[2024-05-28 13:44:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13291888432153335742.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/CTLFireability4611119573283604064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13291888432153335742.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:45:22] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:45:22] [INFO ] Applying decomposition
[2024-05-28 13:45:22] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3956644436933420185.txt' '-o' '/tmp/graph3956644436933420185.bin' '-w' '/tmp/graph3956644436933420185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3956644436933420185.bin' '-l' '-1' '-v' '-w' '/tmp/graph3956644436933420185.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:45:22] [INFO ] Decomposing Gal with order
[2024-05-28 13:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:45:22] [INFO ] Removed a total of 1021 redundant transitions.
[2024-05-28 13:45:22] [INFO ] Flatten gal took : 97 ms
[2024-05-28 13:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 21 ms.
[2024-05-28 13:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16772393945949915027.gal : 12 ms
[2024-05-28 13:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7793371120362582300.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/CTLFireability16772393945949915027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7793371120362582300.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 26 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:45:52] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:45:52] [INFO ] Invariant cache hit.
[2024-05-28 13:45:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:46:03] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:46:05] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 3 ms to minimize.
[2024-05-28 13:46:05] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:46:05] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:46:05] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:46:05] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:46:05] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2024-05-28 13:46:05] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 2 ms to minimize.
[2024-05-28 13:46:06] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 6 ms to minimize.
[2024-05-28 13:46:06] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:46:08] [INFO ] Deduced a trap composed of 347 places in 273 ms of which 4 ms to minimize.
[2024-05-28 13:46:08] [INFO ] Deduced a trap composed of 338 places in 236 ms of which 4 ms to minimize.
[2024-05-28 13:46:08] [INFO ] Deduced a trap composed of 276 places in 265 ms of which 4 ms to minimize.
[2024-05-28 13:46:09] [INFO ] Deduced a trap composed of 300 places in 252 ms of which 4 ms to minimize.
[2024-05-28 13:46:09] [INFO ] Deduced a trap composed of 340 places in 283 ms of which 4 ms to minimize.
[2024-05-28 13:46:09] [INFO ] Deduced a trap composed of 315 places in 265 ms of which 4 ms to minimize.
[2024-05-28 13:46:10] [INFO ] Deduced a trap composed of 323 places in 242 ms of which 4 ms to minimize.
[2024-05-28 13:46:13] [INFO ] Deduced a trap composed of 185 places in 275 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:46:15] [INFO ] Deduced a trap composed of 280 places in 292 ms of which 5 ms to minimize.
[2024-05-28 13:46:21] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:46:26] [INFO ] Deduced a trap composed of 180 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:46:26] [INFO ] Deduced a trap composed of 311 places in 174 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:46:30] [INFO ] Deduced a trap composed of 321 places in 185 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41192ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41202ms
[2024-05-28 13:46:33] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:46:33] [INFO ] Invariant cache hit.
[2024-05-28 13:46:34] [INFO ] Implicit Places using invariants in 407 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 422 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41678 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 13:46:34] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:46:34] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:46:34] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:46:34] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:46:34] [INFO ] Flatten gal took : 26 ms
[2024-05-28 13:46:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14151072160289150134.gal : 6 ms
[2024-05-28 13:46:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1242209398424719274.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/CTLFireability14151072160289150134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1242209398424719274.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:47:04] [INFO ] Flatten gal took : 62 ms
[2024-05-28 13:47:04] [INFO ] Applying decomposition
[2024-05-28 13:47:04] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3623951400000981132.txt' '-o' '/tmp/graph3623951400000981132.bin' '-w' '/tmp/graph3623951400000981132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3623951400000981132.bin' '-l' '-1' '-v' '-w' '/tmp/graph3623951400000981132.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:47:04] [INFO ] Decomposing Gal with order
[2024-05-28 13:47:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:47:04] [INFO ] Removed a total of 879 redundant transitions.
[2024-05-28 13:47:05] [INFO ] Flatten gal took : 93 ms
[2024-05-28 13:47:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 261 labels/synchronizations in 9 ms.
[2024-05-28 13:47:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3489953521258769768.gal : 20 ms
[2024-05-28 13:47:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4505975253397420511.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/CTLFireability3489953521258769768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4505975253397420511.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Applied a total of 16 rules in 26 ms. Remains 604 /612 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
Running 1104 sub problems to find dead transitions.
[2024-05-28 13:47:35] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 604 cols
[2024-05-28 13:47:35] [INFO ] Computed 48 invariants in 11 ms
[2024-05-28 13:47:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-28 13:47:45] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:47:47] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 0 ms to minimize.
[2024-05-28 13:47:47] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:47:47] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:47:47] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:47:47] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:47:47] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:47:48] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 0 ms to minimize.
[2024-05-28 13:47:49] [INFO ] Deduced a trap composed of 337 places in 211 ms of which 3 ms to minimize.
[2024-05-28 13:47:50] [INFO ] Deduced a trap composed of 299 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:47:50] [INFO ] Deduced a trap composed of 329 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:47:50] [INFO ] Deduced a trap composed of 367 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:47:50] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:47:50] [INFO ] Deduced a trap composed of 342 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:47:51] [INFO ] Deduced a trap composed of 350 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:47:51] [INFO ] Deduced a trap composed of 333 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:47:51] [INFO ] Deduced a trap composed of 322 places in 220 ms of which 3 ms to minimize.
[2024-05-28 13:47:51] [INFO ] Deduced a trap composed of 319 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:47:52] [INFO ] Deduced a trap composed of 316 places in 237 ms of which 3 ms to minimize.
[2024-05-28 13:47:52] [INFO ] Deduced a trap composed of 300 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-28 13:47:53] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 3 ms to minimize.
[2024-05-28 13:47:53] [INFO ] Deduced a trap composed of 176 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:47:53] [INFO ] Deduced a trap composed of 195 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:47:53] [INFO ] Deduced a trap composed of 146 places in 220 ms of which 3 ms to minimize.
[2024-05-28 13:47:54] [INFO ] Deduced a trap composed of 297 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:47:54] [INFO ] Deduced a trap composed of 190 places in 182 ms of which 3 ms to minimize.
[2024-05-28 13:47:54] [INFO ] Deduced a trap composed of 302 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:47:55] [INFO ] Deduced a trap composed of 363 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:47:55] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:47:56] [INFO ] Deduced a trap composed of 302 places in 255 ms of which 4 ms to minimize.
[2024-05-28 13:47:56] [INFO ] Deduced a trap composed of 384 places in 253 ms of which 3 ms to minimize.
[2024-05-28 13:47:56] [INFO ] Deduced a trap composed of 368 places in 251 ms of which 3 ms to minimize.
SMT process timed out in 21520ms, After SMT, problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 21537ms
[2024-05-28 13:47:56] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2024-05-28 13:47:56] [INFO ] Invariant cache hit.
[2024-05-28 13:47:57] [INFO ] Implicit Places using invariants in 349 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 355 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/612 places, 1106/1114 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21931 ms. Remains : 596/612 places, 1106/1114 transitions.
[2024-05-28 13:47:57] [INFO ] Flatten gal took : 41 ms
[2024-05-28 13:47:57] [INFO ] Flatten gal took : 53 ms
[2024-05-28 13:47:57] [INFO ] Input system was already deterministic with 1106 transitions.
[2024-05-28 13:47:57] [INFO ] Flatten gal took : 42 ms
[2024-05-28 13:47:57] [INFO ] Flatten gal took : 43 ms
[2024-05-28 13:47:57] [INFO ] Time to serialize gal into /tmp/CTLFireability12336710078730484636.gal : 9 ms
[2024-05-28 13:47:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2546560286452221520.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/CTLFireability12336710078730484636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2546560286452221520.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:48:27] [INFO ] Flatten gal took : 72 ms
[2024-05-28 13:48:27] [INFO ] Applying decomposition
[2024-05-28 13:48:27] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph163798883503393161.txt' '-o' '/tmp/graph163798883503393161.bin' '-w' '/tmp/graph163798883503393161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph163798883503393161.bin' '-l' '-1' '-v' '-w' '/tmp/graph163798883503393161.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:48:27] [INFO ] Decomposing Gal with order
[2024-05-28 13:48:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:48:27] [INFO ] Removed a total of 852 redundant transitions.
[2024-05-28 13:48:27] [INFO ] Flatten gal took : 92 ms
[2024-05-28 13:48:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 283 labels/synchronizations in 15 ms.
[2024-05-28 13:48:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4795888963140006683.gal : 12 ms
[2024-05-28 13:48:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6796347551223948173.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/CTLFireability4795888963140006683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6796347551223948173.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 : 612/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 10 ms. Remains 612 /612 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-28 13:48:58] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-05-28 13:48:58] [INFO ] Computed 48 invariants in 29 ms
[2024-05-28 13:48:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 3 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 3 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 3 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 0 ms to minimize.
[2024-05-28 13:49:13] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:49:15] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 5 ms to minimize.
[2024-05-28 13:49:18] [INFO ] Deduced a trap composed of 312 places in 297 ms of which 5 ms to minimize.
[2024-05-28 13:49:18] [INFO ] Deduced a trap composed of 322 places in 283 ms of which 4 ms to minimize.
[2024-05-28 13:49:19] [INFO ] Deduced a trap composed of 318 places in 297 ms of which 4 ms to minimize.
[2024-05-28 13:49:19] [INFO ] Deduced a trap composed of 310 places in 279 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 60 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 13:49:23] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 4 ms to minimize.
[2024-05-28 13:49:23] [INFO ] Deduced a trap composed of 178 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:49:23] [INFO ] Deduced a trap composed of 310 places in 211 ms of which 3 ms to minimize.
[2024-05-28 13:49:26] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-05-28 13:49:38] [INFO ] Deduced a trap composed of 333 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 65 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 19/19 constraints]
After SMT, in 41551ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41572ms
[2024-05-28 13:49:39] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 13:49:39] [INFO ] Invariant cache hit.
[2024-05-28 13:49:39] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-28 13:49:39] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 13:49:39] [INFO ] Invariant cache hit.
[2024-05-28 13:49:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:49:44] [INFO ] Implicit Places using invariants and state equation in 4444 ms returned []
Implicit Place search using SMT with State Equation took 4779 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2024-05-28 13:49:44] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 13:49:44] [INFO ] Invariant cache hit.
[2024-05-28 13:49:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 13:49:56] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 0 ms to minimize.
[2024-05-28 13:49:57] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 1 ms to minimize.
[2024-05-28 13:49:57] [INFO ] Deduced a trap composed of 66 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:49:57] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:49:57] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:49:57] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:49:57] [INFO ] Deduced a trap composed of 65 places in 33 ms of which 0 ms to minimize.
[2024-05-28 13:49:57] [INFO ] Deduced a trap composed of 65 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:49:59] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 0 ms to minimize.
[2024-05-28 13:50:00] [INFO ] Deduced a trap composed of 308 places in 252 ms of which 3 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 326 places in 268 ms of which 3 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 340 places in 207 ms of which 4 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 338 places in 301 ms of which 4 ms to minimize.
[2024-05-28 13:50:05] [INFO ] Deduced a trap composed of 70 places in 263 ms of which 3 ms to minimize.
[2024-05-28 13:50:06] [INFO ] Deduced a trap composed of 328 places in 278 ms of which 5 ms to minimize.
[2024-05-28 13:50:06] [INFO ] Deduced a trap composed of 344 places in 253 ms of which 4 ms to minimize.
[2024-05-28 13:50:06] [INFO ] Deduced a trap composed of 332 places in 245 ms of which 3 ms to minimize.
[2024-05-28 13:50:06] [INFO ] Deduced a trap composed of 333 places in 240 ms of which 4 ms to minimize.
[2024-05-28 13:50:07] [INFO ] Deduced a trap composed of 333 places in 251 ms of which 4 ms to minimize.
[2024-05-28 13:50:08] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 13:50:08] [INFO ] Deduced a trap composed of 314 places in 326 ms of which 4 ms to minimize.
[2024-05-28 13:50:09] [INFO ] Deduced a trap composed of 164 places in 334 ms of which 4 ms to minimize.
[2024-05-28 13:50:09] [INFO ] Deduced a trap composed of 183 places in 261 ms of which 4 ms to minimize.
[2024-05-28 13:50:10] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:50:10] [INFO ] Deduced a trap composed of 201 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:50:10] [INFO ] Deduced a trap composed of 369 places in 289 ms of which 4 ms to minimize.
[2024-05-28 13:50:11] [INFO ] Deduced a trap composed of 372 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:50:11] [INFO ] Deduced a trap composed of 314 places in 302 ms of which 4 ms to minimize.
[2024-05-28 13:50:12] [INFO ] Deduced a trap composed of 331 places in 288 ms of which 5 ms to minimize.
[2024-05-28 13:50:12] [INFO ] Deduced a trap composed of 320 places in 280 ms of which 4 ms to minimize.
[2024-05-28 13:50:12] [INFO ] Deduced a trap composed of 322 places in 269 ms of which 4 ms to minimize.
[2024-05-28 13:50:13] [INFO ] Deduced a trap composed of 329 places in 237 ms of which 3 ms to minimize.
[2024-05-28 13:50:13] [INFO ] Deduced a trap composed of 348 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:50:13] [INFO ] Deduced a trap composed of 333 places in 220 ms of which 3 ms to minimize.
[2024-05-28 13:50:13] [INFO ] Deduced a trap composed of 332 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:50:14] [INFO ] Deduced a trap composed of 300 places in 214 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 82 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-05-28 13:50:29] [INFO ] Deduced a trap composed of 311 places in 292 ms of which 4 ms to minimize.
[2024-05-28 13:50:29] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:50:30] [INFO ] Deduced a trap composed of 342 places in 301 ms of which 4 ms to minimize.
[2024-05-28 13:50:30] [INFO ] Deduced a trap composed of 344 places in 270 ms of which 4 ms to minimize.
[2024-05-28 13:50:32] [INFO ] Deduced a trap composed of 371 places in 259 ms of which 3 ms to minimize.
[2024-05-28 13:50:32] [INFO ] Deduced a trap composed of 302 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 423 places in 285 ms of which 4 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 397 places in 259 ms of which 4 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 Int declared 610/1710 variables, and 91 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 45/45 constraints]
After SMT, in 61550ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 61573ms
Finished structural reductions in LTL mode , in 1 iterations and 107945 ms. Remains : 612/612 places, 1114/1114 transitions.
[2024-05-28 13:50:45] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:50:45] [INFO ] Flatten gal took : 36 ms
[2024-05-28 13:50:46] [INFO ] Input system was already deterministic with 1114 transitions.
[2024-05-28 13:50:46] [INFO ] Flatten gal took : 47 ms
[2024-05-28 13:50:46] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:50:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15012538157299285663.gal : 5 ms
[2024-05-28 13:50:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4254857433803788841.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/CTLFireability15012538157299285663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4254857433803788841.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:51:16] [INFO ] Flatten gal took : 57 ms
[2024-05-28 13:51:16] [INFO ] Applying decomposition
[2024-05-28 13:51:16] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7431020036016815333.txt' '-o' '/tmp/graph7431020036016815333.bin' '-w' '/tmp/graph7431020036016815333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7431020036016815333.bin' '-l' '-1' '-v' '-w' '/tmp/graph7431020036016815333.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:51:16] [INFO ] Decomposing Gal with order
[2024-05-28 13:51:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:51:16] [INFO ] Removed a total of 782 redundant transitions.
[2024-05-28 13:51:16] [INFO ] Flatten gal took : 81 ms
[2024-05-28 13:51:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 306 labels/synchronizations in 10 ms.
[2024-05-28 13:51:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8751695549830841612.gal : 8 ms
[2024-05-28 13:51:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11409950293107523806.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/CTLFireability8751695549830841612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11409950293107523806.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 15 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:51:46] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-28 13:51:46] [INFO ] Computed 48 invariants in 25 ms
[2024-05-28 13:51:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 328 places in 276 ms of which 4 ms to minimize.
[2024-05-28 13:51:57] [INFO ] Deduced a trap composed of 316 places in 227 ms of which 4 ms to minimize.
[2024-05-28 13:51:57] [INFO ] Deduced a trap composed of 327 places in 221 ms of which 4 ms to minimize.
[2024-05-28 13:51:57] [INFO ] Deduced a trap composed of 320 places in 254 ms of which 4 ms to minimize.
[2024-05-28 13:51:57] [INFO ] Deduced a trap composed of 302 places in 245 ms of which 4 ms to minimize.
[2024-05-28 13:51:58] [INFO ] Deduced a trap composed of 183 places in 260 ms of which 4 ms to minimize.
[2024-05-28 13:51:59] [INFO ] Deduced a trap composed of 327 places in 304 ms of which 4 ms to minimize.
[2024-05-28 13:51:59] [INFO ] Deduced a trap composed of 379 places in 336 ms of which 4 ms to minimize.
[2024-05-28 13:51:59] [INFO ] Deduced a trap composed of 313 places in 298 ms of which 4 ms to minimize.
[2024-05-28 13:52:00] [INFO ] Deduced a trap composed of 388 places in 235 ms of which 3 ms to minimize.
[2024-05-28 13:52:00] [INFO ] Deduced a trap composed of 301 places in 213 ms of which 3 ms to minimize.
[2024-05-28 13:52:00] [INFO ] Deduced a trap composed of 314 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:52:00] [INFO ] Deduced a trap composed of 324 places in 283 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:52:01] [INFO ] Deduced a trap composed of 63 places in 30 ms of which 1 ms to minimize.
[2024-05-28 13:52:01] [INFO ] Deduced a trap composed of 356 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:52:05] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 2 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 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 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 9.0)
(s163 1.0)
(s164 0.0)
(s165 1.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 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 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 0.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 1.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 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 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 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.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 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:52:17] [INFO ] Deduced a trap composed of 294 places in 289 ms of which 4 ms to minimize.
[2024-05-28 13:52:18] [INFO ] Deduced a trap composed of 314 places in 230 ms of which 3 ms to minimize.
[2024-05-28 13:52:20] [INFO ] Deduced a trap composed of 365 places in 290 ms of which 5 ms to minimize.
[2024-05-28 13:52:20] [INFO ] Deduced a trap composed of 409 places in 209 ms of which 2 ms to minimize.
[2024-05-28 13:52:21] [INFO ] Deduced a trap composed of 318 places in 232 ms of which 4 ms to minimize.
[2024-05-28 13:52:21] [INFO ] Deduced a trap composed of 347 places in 175 ms of which 2 ms to minimize.
[2024-05-28 13:52:22] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 76 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 30/30 constraints]
After SMT, in 41289ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41298ms
[2024-05-28 13:52:28] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:52:28] [INFO ] Invariant cache hit.
[2024-05-28 13:52:28] [INFO ] Implicit Places using invariants in 231 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 233 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 7 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41568 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 13:52:28] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:52:28] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:52:28] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:52:28] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:52:28] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:52:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13543690760771767146.gal : 4 ms
[2024-05-28 13:52:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8780629144084120265.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/CTLFireability13543690760771767146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8780629144084120265.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:52:58] [INFO ] Flatten gal took : 51 ms
[2024-05-28 13:52:58] [INFO ] Applying decomposition
[2024-05-28 13:52:58] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7024364099291303835.txt' '-o' '/tmp/graph7024364099291303835.bin' '-w' '/tmp/graph7024364099291303835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7024364099291303835.bin' '-l' '-1' '-v' '-w' '/tmp/graph7024364099291303835.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:52:58] [INFO ] Decomposing Gal with order
[2024-05-28 13:52:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:52:58] [INFO ] Removed a total of 794 redundant transitions.
[2024-05-28 13:52:58] [INFO ] Flatten gal took : 93 ms
[2024-05-28 13:52:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 16 ms.
[2024-05-28 13:52:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15561953018569757494.gal : 12 ms
[2024-05-28 13:52:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13073984288841967946.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/CTLFireability15561953018569757494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13073984288841967946.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 31 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:53:29] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:53:29] [INFO ] Invariant cache hit.
[2024-05-28 13:53:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:53:39] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:53:40] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:53:41] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:53:41] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 0 ms to minimize.
[2024-05-28 13:53:41] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 0 ms to minimize.
[2024-05-28 13:53:41] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 0 ms to minimize.
[2024-05-28 13:53:41] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 2 ms to minimize.
[2024-05-28 13:53:41] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:53:41] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:53:42] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:53:43] [INFO ] Deduced a trap composed of 347 places in 273 ms of which 4 ms to minimize.
[2024-05-28 13:53:44] [INFO ] Deduced a trap composed of 338 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:53:44] [INFO ] Deduced a trap composed of 276 places in 266 ms of which 4 ms to minimize.
[2024-05-28 13:53:44] [INFO ] Deduced a trap composed of 300 places in 234 ms of which 3 ms to minimize.
[2024-05-28 13:53:44] [INFO ] Deduced a trap composed of 340 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:53:45] [INFO ] Deduced a trap composed of 315 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:53:45] [INFO ] Deduced a trap composed of 323 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:53:48] [INFO ] Deduced a trap composed of 185 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:53:49] [INFO ] Deduced a trap composed of 114 places in 327 ms of which 4 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 594/1678 variables, and 65 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:53:51] [INFO ] Deduced a trap composed of 294 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:53:52] [INFO ] Deduced a trap composed of 355 places in 267 ms of which 5 ms to minimize.
[2024-05-28 13:53:56] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-28 13:54:00] [INFO ] Deduced a trap composed of 306 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:54:01] [INFO ] Deduced a trap composed of 71 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:54:02] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 9)
(s163 0)
(s164 1)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41241ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41257ms
[2024-05-28 13:54:10] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:54:10] [INFO ] Invariant cache hit.
[2024-05-28 13:54:10] [INFO ] Implicit Places using invariants in 283 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 309 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 4 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41605 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 13:54:10] [INFO ] Flatten gal took : 26 ms
[2024-05-28 13:54:10] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:54:10] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:54:10] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:54:10] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:54:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4144246541410343935.gal : 5 ms
[2024-05-28 13:54:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9340937526948952286.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/CTLFireability4144246541410343935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9340937526948952286.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:54:40] [INFO ] Flatten gal took : 41 ms
[2024-05-28 13:54:40] [INFO ] Applying decomposition
[2024-05-28 13:54:41] [INFO ] Flatten gal took : 39 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/graph11665313951508986224.txt' '-o' '/tmp/graph11665313951508986224.bin' '-w' '/tmp/graph11665313951508986224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11665313951508986224.bin' '-l' '-1' '-v' '-w' '/tmp/graph11665313951508986224.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:54:41] [INFO ] Decomposing Gal with order
[2024-05-28 13:54:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:54:41] [INFO ] Removed a total of 825 redundant transitions.
[2024-05-28 13:54:41] [INFO ] Flatten gal took : 84 ms
[2024-05-28 13:54:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 319 labels/synchronizations in 12 ms.
[2024-05-28 13:54:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9946506082605679431.gal : 8 ms
[2024-05-28 13:54:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6209320387645290543.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/CTLFireability9946506082605679431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6209320387645290543.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 34 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:55:11] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:55:11] [INFO ] Invariant cache hit.
[2024-05-28 13:55:11] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:55:22] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:55:24] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:55:24] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:55:24] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:55:24] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:55:24] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:55:24] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 0 ms to minimize.
[2024-05-28 13:55:24] [INFO ] Deduced a trap composed of 63 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:55:24] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2024-05-28 13:55:25] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2024-05-28 13:55:27] [INFO ] Deduced a trap composed of 347 places in 294 ms of which 4 ms to minimize.
[2024-05-28 13:55:27] [INFO ] Deduced a trap composed of 338 places in 276 ms of which 4 ms to minimize.
[2024-05-28 13:55:27] [INFO ] Deduced a trap composed of 276 places in 328 ms of which 4 ms to minimize.
[2024-05-28 13:55:28] [INFO ] Deduced a trap composed of 300 places in 290 ms of which 4 ms to minimize.
[2024-05-28 13:55:28] [INFO ] Deduced a trap composed of 340 places in 318 ms of which 5 ms to minimize.
[2024-05-28 13:55:28] [INFO ] Deduced a trap composed of 315 places in 269 ms of which 5 ms to minimize.
[2024-05-28 13:55:29] [INFO ] Deduced a trap composed of 323 places in 257 ms of which 3 ms to minimize.
[2024-05-28 13:55:32] [INFO ] Deduced a trap composed of 185 places in 196 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:55:34] [INFO ] Deduced a trap composed of 280 places in 289 ms of which 5 ms to minimize.
[2024-05-28 13:55:42] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:55:47] [INFO ] Deduced a trap composed of 180 places in 284 ms of which 4 ms to minimize.
[2024-05-28 13:55:47] [INFO ] Deduced a trap composed of 311 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:55:51] [INFO ] Deduced a trap composed of 321 places in 284 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41572ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41591ms
[2024-05-28 13:55:52] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:55:52] [INFO ] Invariant cache hit.
[2024-05-28 13:55:53] [INFO ] Implicit Places using invariants in 385 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 387 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42024 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 13:55:53] [INFO ] Flatten gal took : 30 ms
[2024-05-28 13:55:53] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:55:53] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:55:53] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:55:53] [INFO ] Flatten gal took : 74 ms
[2024-05-28 13:55:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7403073610879897038.gal : 4 ms
[2024-05-28 13:55:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12680766703700021160.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/CTLFireability7403073610879897038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12680766703700021160.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:56:23] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:56:23] [INFO ] Applying decomposition
[2024-05-28 13:56:23] [INFO ] Flatten gal took : 28 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/graph3915088568680731439.txt' '-o' '/tmp/graph3915088568680731439.bin' '-w' '/tmp/graph3915088568680731439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3915088568680731439.bin' '-l' '-1' '-v' '-w' '/tmp/graph3915088568680731439.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:56:23] [INFO ] Decomposing Gal with order
[2024-05-28 13:56:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:56:23] [INFO ] Removed a total of 944 redundant transitions.
[2024-05-28 13:56:23] [INFO ] Flatten gal took : 94 ms
[2024-05-28 13:56:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 14 ms.
[2024-05-28 13:56:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9660628722957419832.gal : 11 ms
[2024-05-28 13:56:23] [INFO ] Time to serialize properties into /tmp/CTLFireability111702845578760246.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/CTLFireability9660628722957419832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability111702845578760246.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 14 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:56:54] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:56:54] [INFO ] Invariant cache hit.
[2024-05-28 13:56:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:57:04] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:57:06] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:57:06] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:57:06] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 2 ms to minimize.
[2024-05-28 13:57:06] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2024-05-28 13:57:06] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:57:06] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 0 ms to minimize.
[2024-05-28 13:57:06] [INFO ] Deduced a trap composed of 63 places in 32 ms of which 0 ms to minimize.
[2024-05-28 13:57:06] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
[2024-05-28 13:57:07] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:57:08] [INFO ] Deduced a trap composed of 347 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:57:08] [INFO ] Deduced a trap composed of 338 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:57:09] [INFO ] Deduced a trap composed of 276 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:57:09] [INFO ] Deduced a trap composed of 300 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:57:09] [INFO ] Deduced a trap composed of 340 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:57:09] [INFO ] Deduced a trap composed of 315 places in 211 ms of which 3 ms to minimize.
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 323 places in 200 ms of which 3 ms to minimize.
[2024-05-28 13:57:13] [INFO ] Deduced a trap composed of 185 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:57:14] [INFO ] Deduced a trap composed of 114 places in 199 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 65 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:57:16] [INFO ] Deduced a trap composed of 294 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:57:17] [INFO ] Deduced a trap composed of 355 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:57:21] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-05-28 13:57:25] [INFO ] Deduced a trap composed of 306 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:57:26] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:57:26] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41211ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41220ms
[2024-05-28 13:57:35] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:57:35] [INFO ] Invariant cache hit.
[2024-05-28 13:57:35] [INFO ] Implicit Places using invariants in 259 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 273 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 5 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41514 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 13:57:35] [INFO ] Flatten gal took : 26 ms
[2024-05-28 13:57:35] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:57:35] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:57:35] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:57:35] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:57:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14299033945998193856.gal : 5 ms
[2024-05-28 13:57:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18172865650321607278.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/CTLFireability14299033945998193856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18172865650321607278.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:58:05] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:58:05] [INFO ] Applying decomposition
[2024-05-28 13:58:05] [INFO ] Flatten gal took : 28 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/graph3459469427732472041.txt' '-o' '/tmp/graph3459469427732472041.bin' '-w' '/tmp/graph3459469427732472041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3459469427732472041.bin' '-l' '-1' '-v' '-w' '/tmp/graph3459469427732472041.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:58:05] [INFO ] Decomposing Gal with order
[2024-05-28 13:58:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:58:05] [INFO ] Removed a total of 905 redundant transitions.
[2024-05-28 13:58:05] [INFO ] Flatten gal took : 55 ms
[2024-05-28 13:58:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 7 ms.
[2024-05-28 13:58:06] [INFO ] Time to serialize gal into /tmp/CTLFireability83239815530790648.gal : 5 ms
[2024-05-28 13:58:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14968410586917506785.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/CTLFireability83239815530790648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14968410586917506785.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 26 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:58:36] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:58:36] [INFO ] Invariant cache hit.
[2024-05-28 13:58:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:58:46] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 63 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:58:49] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:58:50] [INFO ] Deduced a trap composed of 347 places in 275 ms of which 3 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 338 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 276 places in 206 ms of which 3 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 300 places in 225 ms of which 3 ms to minimize.
[2024-05-28 13:58:51] [INFO ] Deduced a trap composed of 340 places in 233 ms of which 3 ms to minimize.
[2024-05-28 13:58:52] [INFO ] Deduced a trap composed of 315 places in 209 ms of which 3 ms to minimize.
[2024-05-28 13:58:52] [INFO ] Deduced a trap composed of 323 places in 197 ms of which 3 ms to minimize.
[2024-05-28 13:58:55] [INFO ] Deduced a trap composed of 185 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:58:56] [INFO ] Deduced a trap composed of 114 places in 194 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 65 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:58:59] [INFO ] Deduced a trap composed of 294 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:58:59] [INFO ] Deduced a trap composed of 355 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:59:03] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:59:08] [INFO ] Deduced a trap composed of 306 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:59:09] [INFO ] Deduced a trap composed of 71 places in 230 ms of which 3 ms to minimize.
[2024-05-28 13:59:09] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
(s220 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 9)
(s163 0)
(s164 1)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41308ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41326ms
[2024-05-28 13:59:17] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:59:17] [INFO ] Invariant cache hit.
[2024-05-28 13:59:17] [INFO ] Implicit Places using invariants in 301 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 302 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 4 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41662 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 13:59:17] [INFO ] Flatten gal took : 26 ms
[2024-05-28 13:59:17] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:59:17] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 13:59:17] [INFO ] Flatten gal took : 30 ms
[2024-05-28 13:59:17] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:59:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11187959893210421264.gal : 4 ms
[2024-05-28 13:59:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6796629399553323651.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/CTLFireability11187959893210421264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6796629399553323651.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:59:48] [INFO ] Flatten gal took : 65 ms
[2024-05-28 13:59:48] [INFO ] Applying decomposition
[2024-05-28 13:59:48] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3650229008735055721.txt' '-o' '/tmp/graph3650229008735055721.bin' '-w' '/tmp/graph3650229008735055721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3650229008735055721.bin' '-l' '-1' '-v' '-w' '/tmp/graph3650229008735055721.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:59:48] [INFO ] Decomposing Gal with order
[2024-05-28 13:59:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:59:48] [INFO ] Removed a total of 896 redundant transitions.
[2024-05-28 13:59:48] [INFO ] Flatten gal took : 92 ms
[2024-05-28 13:59:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 295 labels/synchronizations in 10 ms.
[2024-05-28 13:59:48] [INFO ] Time to serialize gal into /tmp/CTLFireability7235392733171787690.gal : 7 ms
[2024-05-28 13:59:48] [INFO ] Time to serialize properties into /tmp/CTLFireability17684420418654777067.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/CTLFireability7235392733171787690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17684420418654777067.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 15 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:00:18] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:00:18] [INFO ] Invariant cache hit.
[2024-05-28 14:00:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:00:28] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:00:30] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 2 ms to minimize.
[2024-05-28 14:00:30] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:00:30] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:00:31] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:00:31] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:00:31] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:00:31] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:00:31] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:00:31] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:00:33] [INFO ] Deduced a trap composed of 347 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:00:33] [INFO ] Deduced a trap composed of 338 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:00:33] [INFO ] Deduced a trap composed of 276 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:00:34] [INFO ] Deduced a trap composed of 300 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:00:34] [INFO ] Deduced a trap composed of 340 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:00:34] [INFO ] Deduced a trap composed of 315 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:00:34] [INFO ] Deduced a trap composed of 323 places in 268 ms of which 5 ms to minimize.
[2024-05-28 14:00:38] [INFO ] Deduced a trap composed of 185 places in 296 ms of which 9 ms to minimize.
[2024-05-28 14:00:39] [INFO ] Deduced a trap composed of 114 places in 294 ms of which 3 ms to minimize.
SMT process timed out in 21366ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 21389ms
[2024-05-28 14:00:39] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:00:39] [INFO ] Invariant cache hit.
[2024-05-28 14:00:40] [INFO ] Implicit Places using invariants in 302 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 317 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21730 ms. Remains : 588/612 places, 1098/1114 transitions.
[2024-05-28 14:00:40] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:00:40] [INFO ] Flatten gal took : 39 ms
[2024-05-28 14:00:40] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 14:00:40] [INFO ] Flatten gal took : 39 ms
[2024-05-28 14:00:40] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:00:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16246340792627015092.gal : 5 ms
[2024-05-28 14:00:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16155041924932887339.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/CTLFireability16246340792627015092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16155041924932887339.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:01:10] [INFO ] Flatten gal took : 72 ms
[2024-05-28 14:01:10] [INFO ] Applying decomposition
[2024-05-28 14:01:10] [INFO ] Flatten gal took : 52 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/graph12379421031944787238.txt' '-o' '/tmp/graph12379421031944787238.bin' '-w' '/tmp/graph12379421031944787238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12379421031944787238.bin' '-l' '-1' '-v' '-w' '/tmp/graph12379421031944787238.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:01:10] [INFO ] Decomposing Gal with order
[2024-05-28 14:01:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:01:10] [INFO ] Removed a total of 978 redundant transitions.
[2024-05-28 14:01:10] [INFO ] Flatten gal took : 92 ms
[2024-05-28 14:01:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 8 ms.
[2024-05-28 14:01:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2948140999626138446.gal : 8 ms
[2024-05-28 14:01:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5772808048620020065.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/CTLFireability2948140999626138446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5772808048620020065.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 : 612/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 8 ms. Remains 612 /612 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-28 14:01:40] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-05-28 14:01:40] [INFO ] Computed 48 invariants in 10 ms
[2024-05-28 14:01:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:01:53] [INFO ] Deduced a trap composed of 66 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:01:53] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-05-28 14:01:54] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:01:56] [INFO ] Deduced a trap composed of 300 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:01:58] [INFO ] Deduced a trap composed of 312 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:01:58] [INFO ] Deduced a trap composed of 322 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:01:58] [INFO ] Deduced a trap composed of 318 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:01:59] [INFO ] Deduced a trap composed of 310 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:02:00] [INFO ] Deduced a trap composed of 339 places in 291 ms of which 4 ms to minimize.
[2024-05-28 14:02:00] [INFO ] Deduced a trap composed of 327 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:02:00] [INFO ] Deduced a trap composed of 320 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:02:01] [INFO ] Deduced a trap composed of 205 places in 297 ms of which 4 ms to minimize.
[2024-05-28 14:02:01] [INFO ] Deduced a trap composed of 181 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:02:01] [INFO ] Deduced a trap composed of 182 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 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 610/1710 variables, and 66 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:02:05] [INFO ] Deduced a trap composed of 310 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:02:11] [INFO ] Deduced a trap composed of 414 places in 263 ms of which 4 ms to minimize.
[2024-05-28 14:02:11] [INFO ] Deduced a trap composed of 414 places in 251 ms of which 4 ms to minimize.
[2024-05-28 14:02:14] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 1 ms to minimize.
[2024-05-28 14:02:17] [INFO ] Deduced a trap composed of 329 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:02:21] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 72 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 26/26 constraints]
After SMT, in 41422ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41447ms
[2024-05-28 14:02:22] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 14:02:22] [INFO ] Invariant cache hit.
[2024-05-28 14:02:22] [INFO ] Implicit Places using invariants in 289 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 314 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 604/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 12 ms. Remains 604 /604 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41788 ms. Remains : 604/612 places, 1114/1114 transitions.
[2024-05-28 14:02:22] [INFO ] Flatten gal took : 65 ms
[2024-05-28 14:02:22] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:02:22] [INFO ] Input system was already deterministic with 1114 transitions.
[2024-05-28 14:02:23] [INFO ] Flatten gal took : 46 ms
[2024-05-28 14:02:23] [INFO ] Flatten gal took : 47 ms
[2024-05-28 14:02:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14809598738771147444.gal : 7 ms
[2024-05-28 14:02:23] [INFO ] Time to serialize properties into /tmp/CTLFireability12749960626248065107.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/CTLFireability14809598738771147444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12749960626248065107.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:02:53] [INFO ] Flatten gal took : 65 ms
[2024-05-28 14:02:53] [INFO ] Applying decomposition
[2024-05-28 14:02:53] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17962160061939300547.txt' '-o' '/tmp/graph17962160061939300547.bin' '-w' '/tmp/graph17962160061939300547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17962160061939300547.bin' '-l' '-1' '-v' '-w' '/tmp/graph17962160061939300547.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:02:53] [INFO ] Decomposing Gal with order
[2024-05-28 14:02:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:02:53] [INFO ] Removed a total of 806 redundant transitions.
[2024-05-28 14:02:53] [INFO ] Flatten gal took : 91 ms
[2024-05-28 14:02:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 11 ms.
[2024-05-28 14:02:53] [INFO ] Time to serialize gal into /tmp/CTLFireability11592632847252522593.gal : 9 ms
[2024-05-28 14:02:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12347047895962140652.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/CTLFireability11592632847252522593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12347047895962140652.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:03:23] [INFO ] Flatten gal took : 48 ms
[2024-05-28 14:03:23] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:03:23] [INFO ] Applying decomposition
[2024-05-28 14:03:23] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9630674169239364267.txt' '-o' '/tmp/graph9630674169239364267.bin' '-w' '/tmp/graph9630674169239364267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9630674169239364267.bin' '-l' '-1' '-v' '-w' '/tmp/graph9630674169239364267.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:03:23] [INFO ] Decomposing Gal with order
[2024-05-28 14:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:03:24] [INFO ] Removed a total of 696 redundant transitions.
[2024-05-28 14:03:24] [INFO ] Flatten gal took : 96 ms
[2024-05-28 14:03:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 8 ms.
[2024-05-28 14:03:24] [INFO ] Time to serialize gal into /tmp/CTLFireability2460066724745280958.gal : 8 ms
[2024-05-28 14:03:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13450919324659961923.ctl : 8 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/CTLFireability2460066724745280958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13450919324659961923.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:14:33] [INFO ] Applying decomposition
[2024-05-28 14:14:33] [INFO ] Flatten gal took : 59 ms
[2024-05-28 14:14:33] [INFO ] Decomposing Gal with order
[2024-05-28 14:14:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:14:33] [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],[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],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[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],

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:14:33] [INFO ] Flatten gal took : 58 ms
[2024-05-28 14:14:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12605963587608768100.gal : 7 ms
[2024-05-28 14:14:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6080664970946802584.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/CTLFireability12605963587608768100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6080664970946802584.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:24:12] [INFO ] Flatten gal took : 51 ms
[2024-05-28 14:24:12] [INFO ] Input system was already deterministic with 1114 transitions.
[2024-05-28 14:24:12] [INFO ] Transformed 612 places.
[2024-05-28 14:24:12] [INFO ] Transformed 1114 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 14:24:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7994864764156489898.gal : 8 ms
[2024-05-28 14:24:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6539689818097368896.ctl : 7 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/CTLFireability7994864764156489898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6539689818097368896.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

BK_STOP 1716906865083

--------------------
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-S02J04T08"
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-S02J04T08, 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-171654446300082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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