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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 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-S02J04T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716903248226

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-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-28 13:34:09] [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:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:34:09] [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:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:34:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 756 ms
[2024-05-28 13:34:10] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2024-05-28 13:34:10] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-28 13:34:10] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
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 57 to 56
RANDOM walk for 40000 steps (20 resets) in 1882 ms. (21 steps per ms) remains 11/56 properties
BEST_FIRST walk for 40000 steps (12 resets) in 384 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (10 resets) in 322 ms. (123 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (13 resets) in 240 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (40 resets) in 455 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (14 resets) in 328 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (9 resets) in 250 ms. (159 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (10 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (10 resets) in 385 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (12 resets) in 209 ms. (190 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 337 ms. (118 steps per ms) remains 11/11 properties
[2024-05-28 13:34:12] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:34:12] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 13:34:12] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 2 (OVERLAPS) 30/61 variables, 7/8 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 7 (OVERLAPS) 15/77 variables, 12/23 constraints. Problems are: Problem set: 8 solved, 3 unsolved
[2024-05-28 13:34:13] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 22 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/24 constraints. Problems are: Problem set: 8 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 8 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 8 solved, 3 unsolved in 786 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: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 8 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 3/116 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 8 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 8 solved, 3 unsolved in 295 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: 3/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 1150ms problems are : Problem set: 8 solved, 3 unsolved
Parikh walk visited 0 properties in 1081 ms.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 27 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-05-28 13:34:15] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-28 13:34:15] [INFO ] Computed 25 invariants in 8 ms
[2024-05-28 13:34:15] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 13:34:15] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:34:15] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
[2024-05-28 13:34:15] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:34:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:34:15] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:34:15] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:34:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:34:15] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 13:34:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:34:16] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/95 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 103 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1733 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:34:16] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:34:17] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 3/37 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/97 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/105 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/147 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 147 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1580 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 12/12 constraints]
After SMT, in 3354ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 3355ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 1 rules in 5 ms. Remains 59 /60 variables (removed 1) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3398 ms. Remains : 59/81 places, 39/65 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S02J04T06-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:34:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 13:34:18] [INFO ] Flatten gal took : 56 ms
FORMULA PolyORBLF-COL-S02J04T06-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:34:18] [INFO ] Flatten gal took : 19 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:18] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 52 ms.
[2024-05-28 13:34:18] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2024-05-28 13:34:18] [INFO ] Reduced 66 identical enabling conditions.
[2024-05-28 13:34:18] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-28 13:34:18] [INFO ] Reduced 66 identical enabling conditions.
[2024-05-28 13:34:18] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-28 13:34:18] [INFO ] Reduced 66 identical enabling conditions.
[2024-05-28 13:34:18] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 421 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Applied a total of 0 rules in 21 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2024-05-28 13:34:18] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-28 13:34:18] [INFO ] Computed 46 invariants in 36 ms
[2024-05-28 13:34:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:34:25] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 2 ms to minimize.
[2024-05-28 13:34:26] [INFO ] Deduced a trap composed of 65 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:34:26] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:34:26] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 0 ms to minimize.
[2024-05-28 13:34:26] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:34:26] [INFO ] Deduced a trap composed of 249 places in 267 ms of which 7 ms to minimize.
[2024-05-28 13:34:26] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:34:27] [INFO ] Deduced a trap composed of 153 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:34:27] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:34:27] [INFO ] Deduced a trap composed of 273 places in 177 ms of which 3 ms to minimize.
[2024-05-28 13:34:27] [INFO ] Deduced a trap composed of 271 places in 162 ms of which 3 ms to minimize.
[2024-05-28 13:34:27] [INFO ] Deduced a trap composed of 283 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:34:28] [INFO ] Deduced a trap composed of 283 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:34:28] [INFO ] Deduced a trap composed of 248 places in 172 ms of which 3 ms to minimize.
[2024-05-28 13:34:33] [INFO ] Deduced a trap composed of 238 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:34:34] [INFO ] Deduced a trap composed of 223 places in 293 ms of which 3 ms to minimize.
[2024-05-28 13:34:34] [INFO ] Deduced a trap composed of 252 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:34:39] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
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 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.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 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 472/1288 variables, and 60 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:34:46] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 13:34:48] [INFO ] Deduced a trap composed of 258 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:34:48] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:34:49] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 64 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 22/22 constraints]
After SMT, in 41371ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41397ms
[2024-05-28 13:35:00] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 13:35:00] [INFO ] Invariant cache hit.
[2024-05-28 13:35:00] [INFO ] Implicit Places using invariants in 164 ms returned [368, 369, 370, 371, 372, 373]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 176 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 470/476 places, 824/824 transitions.
Applied a total of 0 rules in 14 ms. Remains 470 /470 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41617 ms. Remains : 470/476 places, 824/824 transitions.
Support contains 421 out of 470 places after structural reductions.
[2024-05-28 13:35:00] [INFO ] Flatten gal took : 108 ms
[2024-05-28 13:35:00] [INFO ] Flatten gal took : 67 ms
[2024-05-28 13:35:00] [INFO ] Input system was already deterministic with 824 transitions.
Reduction of identical properties reduced properties to check from 58 to 57
RANDOM walk for 40000 steps (19 resets) in 1320 ms. (30 steps per ms) remains 10/57 properties
BEST_FIRST walk for 40002 steps (8 resets) in 616 ms. (64 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (11 resets) in 441 ms. (90 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (23 resets) in 527 ms. (75 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (10 resets) in 476 ms. (83 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (11 resets) in 540 ms. (73 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 402 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 367 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 495 ms. (80 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 424 ms. (94 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 514 ms. (77 steps per ms) remains 10/10 properties
[2024-05-28 13:35:03] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 470 cols
[2024-05-28 13:35:03] [INFO ] Computed 40 invariants in 15 ms
[2024-05-28 13:35:03] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 141/264 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 9/273 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 6 (OVERLAPS) 194/467 variables, 23/38 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/38 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/468 variables, 1/39 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/39 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 812/1280 variables, 468/507 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1280 variables, 72/579 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1280 variables, 0/579 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/1282 variables, 2/581 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1282 variables, 1/582 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1282 variables, 0/582 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1282 variables, 0/582 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1282/1282 variables, and 582 constraints, problems are : Problem set: 7 solved, 3 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 132/146 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 48/194 variables, 3/6 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/203 variables, 5/11 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 258/461 variables, 21/32 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-28 13:35:06] [INFO ] Deduced a trap composed of 66 places in 665 ms of which 2 ms to minimize.
[2024-05-28 13:35:06] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 1 ms to minimize.
[2024-05-28 13:35:06] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 3/35 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/35 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/465 variables, 4/39 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-28 13:35:06] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 1/40 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/40 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/468 variables, 3/43 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 17 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 1/44 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 1/45 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 291 places in 217 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 2/47 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/468 variables, 0/47 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 812/1280 variables, 468/515 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1280 variables, 72/587 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1280 variables, 3/590 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1280 variables, 0/590 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/1282 variables, 2/592 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1282 variables, 1/593 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1282 variables, 0/593 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/1282 variables, 0/593 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1282/1282 variables, and 593 constraints, problems are : Problem set: 7 solved, 3 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/10 constraints, Known Traps: 8/8 constraints]
After SMT, in 6951ms problems are : Problem set: 7 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 468 transition count 782
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 92 place count 426 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 98 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 194 place count 372 transition count 728
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 200 place count 366 transition count 722
Iterating global reduction 3 with 6 rules applied. Total rules applied 206 place count 366 transition count 722
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 302 place count 318 transition count 674
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 314 place count 318 transition count 662
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 326 place count 306 transition count 662
Applied a total of 326 rules in 157 ms. Remains 306 /470 variables (removed 164) and now considering 662/824 (removed 162) transitions.
Running 660 sub problems to find dead transitions.
[2024-05-28 13:35:10] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
// Phase 1: matrix 650 rows 306 cols
[2024-05-28 13:35:10] [INFO ] Computed 38 invariants in 17 ms
[2024-05-28 13:35:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-28 13:35:14] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:35:14] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:35:14] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2024-05-28 13:35:14] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:35:14] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:35:14] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 118 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:35:18] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:35:19] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:35:19] [INFO ] Deduced a trap composed of 172 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:35:19] [INFO ] Deduced a trap composed of 145 places in 186 ms of which 6 ms to minimize.
[2024-05-28 13:35:19] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:35:20] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:35:20] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-28 13:35:21] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-05-28 13:35:22] [INFO ] Deduced a trap composed of 130 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 660 unsolved
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 9.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/956 variables, and 55 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-28 13:35:34] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/305 variables, 1/57 constraints. Problems are: Problem set: 36 solved, 624 unsolved
[2024-05-28 13:35:45] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 3 ms to minimize.
[2024-05-28 13:35:45] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/59 constraints. Problems are: Problem set: 36 solved, 624 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/59 constraints. Problems are: Problem set: 36 solved, 624 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/60 constraints. Problems are: Problem set: 36 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/956 variables, and 60 constraints, problems are : Problem set: 36 solved, 624 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 22/22 constraints]
After SMT, in 40889ms problems are : Problem set: 36 solved, 624 unsolved
Search for dead transitions found 36 dead transitions in 40896ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/470 places, 626/824 transitions.
Applied a total of 0 rules in 19 ms. Remains 306 /306 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41074 ms. Remains : 306/470 places, 626/824 transitions.
RANDOM walk for 40000 steps (21 resets) in 264 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (10 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 242798 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 3
Probabilistic random walk after 242798 steps, saw 118423 distinct states, run finished after 3008 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-28 13:35:54] [INFO ] Flow matrix only has 614 transitions (discarded 12 similar events)
// Phase 1: matrix 614 rows 306 cols
[2024-05-28 13:35:54] [INFO ] Computed 38 invariants in 10 ms
[2024-05-28 13:35:54] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 102/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 29/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/154 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 143/297 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:35:54] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 4 ms to minimize.
[2024-05-28 13:35:55] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/301 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/304 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 614/918 variables, 304/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/918 variables, 72/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/918 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/920 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/920 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/920 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/920 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 418 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1797 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 306/306 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 102/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 29/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/154 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 143/297 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:35:56] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:35:56] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:35:56] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/301 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/304 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/304 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 614/918 variables, 304/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/918 variables, 72/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/918 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/918 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/920 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/920 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/920 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/920 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:36:14] [INFO ] Deduced a trap composed of 118 places in 161 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/920 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:36:24] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:36:24] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/920 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 920/920 variables, and 428 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45007 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 306/306 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 46827ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 626/626 transitions.
Applied a total of 0 rules in 41 ms. Remains 306 /306 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 306/306 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 626/626 transitions.
Applied a total of 0 rules in 23 ms. Remains 306 /306 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-05-28 13:36:41] [INFO ] Flow matrix only has 614 transitions (discarded 12 similar events)
[2024-05-28 13:36:41] [INFO ] Invariant cache hit.
[2024-05-28 13:36:41] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-28 13:36:41] [INFO ] Flow matrix only has 614 transitions (discarded 12 similar events)
[2024-05-28 13:36:41] [INFO ] Invariant cache hit.
[2024-05-28 13:36:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:36:44] [INFO ] Implicit Places using invariants and state equation in 2270 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
[2024-05-28 13:36:44] [INFO ] Redundant transitions in 51 ms returned []
Running 624 sub problems to find dead transitions.
[2024-05-28 13:36:44] [INFO ] Flow matrix only has 614 transitions (discarded 12 similar events)
[2024-05-28 13:36:44] [INFO ] Invariant cache hit.
[2024-05-28 13:36:44] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 100 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:36:51] [INFO ] Deduced a trap composed of 118 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:36:51] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 2 ms to minimize.
[2024-05-28 13:36:51] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:36:51] [INFO ] Deduced a trap composed of 172 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:36:52] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 4 (OVERLAPS) 1/305 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/306 variables, 1/54 constraints. Problems are: Problem set: 30 solved, 594 unsolved
[2024-05-28 13:37:08] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:37:08] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:37:08] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:37:10] [INFO ] Deduced a trap composed of 146 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:37:10] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:37:10] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:37:10] [INFO ] Deduced a trap composed of 144 places in 177 ms of which 2 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 123 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 103 places in 181 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 9/63 constraints. Problems are: Problem set: 30 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/920 variables, and 63 constraints, problems are : Problem set: 30 solved, 594 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 30 solved, 594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 13/13 constraints. Problems are: Problem set: 30 solved, 594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 23/36 constraints. Problems are: Problem set: 30 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 20/56 constraints. Problems are: Problem set: 30 solved, 594 unsolved
[2024-05-28 13:37:16] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:37:16] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:37:19] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 3/59 constraints. Problems are: Problem set: 30 solved, 594 unsolved
[2024-05-28 13:37:22] [INFO ] Deduced a trap composed of 113 places in 97 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 1/60 constraints. Problems are: Problem set: 30 solved, 594 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/60 constraints. Problems are: Problem set: 30 solved, 594 unsolved
At refinement iteration 6 (OVERLAPS) 1/305 variables, 1/61 constraints. Problems are: Problem set: 30 solved, 594 unsolved
[2024-05-28 13:37:32] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/62 constraints. Problems are: Problem set: 30 solved, 594 unsolved
[2024-05-28 13:37:36] [INFO ] Deduced a trap composed of 178 places in 144 ms of which 1 ms to minimize.
[2024-05-28 13:37:36] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/64 constraints. Problems are: Problem set: 30 solved, 594 unsolved
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 305/920 variables, and 64 constraints, problems are : Problem set: 30 solved, 594 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/624 constraints, Known Traps: 27/32 constraints]
After SMT, in 60642ms problems are : Problem set: 30 solved, 594 unsolved
Search for dead transitions found 30 dead transitions in 60656ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/306 places, 596/626 transitions.
Reduce places removed 0 places and 12 transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 6 places and 12 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 300 transition count 572
Deduced a syphon composed of 8 places in 1 ms
Applied a total of 6 rules in 20 ms. Remains 300 /306 variables (removed 6) and now considering 572/596 (removed 24) transitions.
[2024-05-28 13:37:44] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
// Phase 1: matrix 560 rows 300 cols
[2024-05-28 13:37:44] [INFO ] Computed 46 invariants in 13 ms
[2024-05-28 13:37:45] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-28 13:37:45] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
[2024-05-28 13:37:45] [INFO ] Invariant cache hit.
[2024-05-28 13:37:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:37:46] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 300/306 places, 572/626 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65394 ms. Remains : 300/306 places, 572/626 transitions.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
[2024-05-28 13:37:46] [INFO ] Flatten gal took : 80 ms
[2024-05-28 13:37:47] [INFO ] Flatten gal took : 78 ms
[2024-05-28 13:37:47] [INFO ] Input system was already deterministic with 824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 14 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:37:47] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 13:37:47] [INFO ] Computed 38 invariants in 21 ms
[2024-05-28 13:37:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 64 places in 32 ms of which 0 ms to minimize.
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 240 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2024-05-28 13:37:53] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:37:53] [INFO ] Deduced a trap composed of 271 places in 174 ms of which 3 ms to minimize.
[2024-05-28 13:37:53] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:37:53] [INFO ] Deduced a trap composed of 265 places in 173 ms of which 3 ms to minimize.
[2024-05-28 13:37:57] [INFO ] Deduced a trap composed of 248 places in 156 ms of which 3 ms to minimize.
[2024-05-28 13:37:58] [INFO ] Deduced a trap composed of 223 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:37:58] [INFO ] Deduced a trap composed of 241 places in 197 ms of which 3 ms to minimize.
[2024-05-28 13:38:00] [INFO ] Deduced a trap composed of 110 places in 225 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:01] [INFO ] Deduced a trap composed of 262 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:38:02] [INFO ] Deduced a trap composed of 269 places in 165 ms of which 3 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:13] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:38:15] [INFO ] Deduced a trap composed of 226 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:38:15] [INFO ] Deduced a trap composed of 275 places in 188 ms of which 3 ms to minimize.
[2024-05-28 13:38:15] [INFO ] Deduced a trap composed of 240 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:38:17] [INFO ] Deduced a trap composed of 241 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 289 places in 255 ms of which 4 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 299 places in 193 ms of which 3 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 276 places in 175 ms of which 4 ms to minimize.
[2024-05-28 13:38:23] [INFO ] Deduced a trap composed of 252 places in 212 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 64 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 28/28 constraints]
After SMT, in 40913ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40920ms
[2024-05-28 13:38:28] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:38:28] [INFO ] Invariant cache hit.
[2024-05-28 13:38:28] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 13:38:28] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:38:28] [INFO ] Invariant cache hit.
[2024-05-28 13:38:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:38:32] [INFO ] Implicit Places using invariants and state equation in 4005 ms returned []
Implicit Place search using SMT with State Equation took 4170 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:38:32] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:38:32] [INFO ] Invariant cache hit.
[2024-05-28 13:38:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 270 places in 239 ms of which 3 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 286 places in 220 ms of which 3 ms to minimize.
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 256 places in 202 ms of which 4 ms to minimize.
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 268 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 4 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 241 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 288 places in 201 ms of which 4 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 232 places in 218 ms of which 4 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:38:45] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 4 ms to minimize.
[2024-05-28 13:38:46] [INFO ] Deduced a trap composed of 144 places in 219 ms of which 4 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 302 places in 154 ms of which 3 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 278 places in 138 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 296 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 249 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 261 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 247 places in 141 ms of which 3 ms to minimize.
[2024-05-28 13:38:52] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:39:02] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:39:09] [INFO ] Deduced a trap composed of 222 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:39:30] [INFO ] Deduced a trap composed of 145 places in 205 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
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 1)
(s10 0)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(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 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(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 9)
(s123 0)
(s124 1)
(s125 1)
(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 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(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 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(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 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)
(s234 1)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(s270 1)
(s271 0)
(s272 2)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 61011ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 61034ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 776/824 transitions.
Applied a total of 0 rules in 8 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106155 ms. Remains : 456/470 places, 776/824 transitions.
[2024-05-28 13:39:33] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:39:33] [INFO ] Flatten gal took : 30 ms
[2024-05-28 13:39:33] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:39:33] [INFO ] Flatten gal took : 26 ms
[2024-05-28 13:39:33] [INFO ] Flatten gal took : 43 ms
[2024-05-28 13:39:33] [INFO ] Time to serialize gal into /tmp/CTLFireability14268884859725267951.gal : 25 ms
[2024-05-28 13:39:33] [INFO ] Time to serialize properties into /tmp/CTLFireability239452521815417440.ctl : 14 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/CTLFireability14268884859725267951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability239452521815417440.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:40:03] [INFO ] Flatten gal took : 65 ms
[2024-05-28 13:40:03] [INFO ] Applying decomposition
[2024-05-28 13:40:03] [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/graph15093752541089935708.txt' '-o' '/tmp/graph15093752541089935708.bin' '-w' '/tmp/graph15093752541089935708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15093752541089935708.bin' '-l' '-1' '-v' '-w' '/tmp/graph15093752541089935708.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:40:04] [INFO ] Decomposing Gal with order
[2024-05-28 13:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:40:04] [INFO ] Removed a total of 651 redundant transitions.
[2024-05-28 13:40:04] [INFO ] Flatten gal took : 182 ms
[2024-05-28 13:40:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 43 ms.
[2024-05-28 13:40:04] [INFO ] Time to serialize gal into /tmp/CTLFireability290254369270590061.gal : 19 ms
[2024-05-28 13:40:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16896192744698800008.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/CTLFireability290254369270590061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16896192744698800008.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 37 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:40:34] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:40:34] [INFO ] Invariant cache hit.
[2024-05-28 13:40:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:41] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 4 ms to minimize.
[2024-05-28 13:40:41] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 11 ms to minimize.
[2024-05-28 13:40:41] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:40:41] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:40:42] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:40:42] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:40:44] [INFO ] Deduced a trap composed of 270 places in 225 ms of which 3 ms to minimize.
[2024-05-28 13:40:44] [INFO ] Deduced a trap composed of 286 places in 158 ms of which 2 ms to minimize.
[2024-05-28 13:40:44] [INFO ] Deduced a trap composed of 256 places in 149 ms of which 3 ms to minimize.
[2024-05-28 13:40:44] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:40:44] [INFO ] Deduced a trap composed of 268 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:40:45] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:40:45] [INFO ] Deduced a trap composed of 241 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:40:45] [INFO ] Deduced a trap composed of 288 places in 193 ms of which 4 ms to minimize.
[2024-05-28 13:40:45] [INFO ] Deduced a trap composed of 232 places in 202 ms of which 4 ms to minimize.
[2024-05-28 13:40:46] [INFO ] Deduced a trap composed of 248 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:40:47] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 144 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:40:49] [INFO ] Deduced a trap composed of 302 places in 232 ms of which 4 ms to minimize.
[2024-05-28 13:40:49] [INFO ] Deduced a trap composed of 278 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:50] [INFO ] Deduced a trap composed of 296 places in 181 ms of which 3 ms to minimize.
[2024-05-28 13:40:50] [INFO ] Deduced a trap composed of 249 places in 171 ms of which 2 ms to minimize.
[2024-05-28 13:40:50] [INFO ] Deduced a trap composed of 261 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:40:50] [INFO ] Deduced a trap composed of 247 places in 172 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:59] [INFO ] Deduced a trap composed of 297 places in 195 ms of which 2 ms to minimize.
[2024-05-28 13:41:02] [INFO ] Deduced a trap composed of 276 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:41:02] [INFO ] Deduced a trap composed of 246 places in 103 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 239 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 129 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 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 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40956ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40972ms
[2024-05-28 13:41:15] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:41:15] [INFO ] Invariant cache hit.
[2024-05-28 13:41:15] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-28 13:41:15] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:41:15] [INFO ] Invariant cache hit.
[2024-05-28 13:41:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:41:19] [INFO ] Implicit Places using invariants and state equation in 3801 ms returned []
Implicit Place search using SMT with State Equation took 4047 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:41:19] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:41:19] [INFO ] Invariant cache hit.
[2024-05-28 13:41:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:25] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 2 ms to minimize.
[2024-05-28 13:41:25] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:41:25] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:41:25] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:41:26] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:41:26] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:41:28] [INFO ] Deduced a trap composed of 270 places in 221 ms of which 4 ms to minimize.
[2024-05-28 13:41:28] [INFO ] Deduced a trap composed of 286 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:41:28] [INFO ] Deduced a trap composed of 256 places in 197 ms of which 3 ms to minimize.
[2024-05-28 13:41:28] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:41:29] [INFO ] Deduced a trap composed of 268 places in 152 ms of which 3 ms to minimize.
[2024-05-28 13:41:29] [INFO ] Deduced a trap composed of 245 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:41:29] [INFO ] Deduced a trap composed of 241 places in 150 ms of which 3 ms to minimize.
[2024-05-28 13:41:29] [INFO ] Deduced a trap composed of 288 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:41:29] [INFO ] Deduced a trap composed of 232 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:41:29] [INFO ] Deduced a trap composed of 248 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:41:31] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-05-28 13:41:32] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:41:32] [INFO ] Deduced a trap composed of 302 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:41:33] [INFO ] Deduced a trap composed of 278 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:33] [INFO ] Deduced a trap composed of 296 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:41:33] [INFO ] Deduced a trap composed of 249 places in 194 ms of which 2 ms to minimize.
[2024-05-28 13:41:34] [INFO ] Deduced a trap composed of 261 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:41:34] [INFO ] Deduced a trap composed of 247 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:41:39] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 4 ms to minimize.
[2024-05-28 13:41:40] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:47] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:56] [INFO ] Deduced a trap composed of 222 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:42:15] [INFO ] Deduced a trap composed of 145 places in 208 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60965ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60974ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 776/824 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106042 ms. Remains : 456/470 places, 776/824 transitions.
[2024-05-28 13:42:20] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:42:20] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:42:20] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:42:20] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:42:20] [INFO ] Flatten gal took : 24 ms
[2024-05-28 13:42:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14799889744085814876.gal : 4 ms
[2024-05-28 13:42:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8143878385327907271.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/CTLFireability14799889744085814876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8143878385327907271.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:42:50] [INFO ] Flatten gal took : 45 ms
[2024-05-28 13:42:50] [INFO ] Applying decomposition
[2024-05-28 13:42:50] [INFO ] Flatten gal took : 63 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/graph8043587464380052928.txt' '-o' '/tmp/graph8043587464380052928.bin' '-w' '/tmp/graph8043587464380052928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8043587464380052928.bin' '-l' '-1' '-v' '-w' '/tmp/graph8043587464380052928.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:42:51] [INFO ] Decomposing Gal with order
[2024-05-28 13:42:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:42:51] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 13:42:51] [INFO ] Flatten gal took : 72 ms
[2024-05-28 13:42:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 28 ms.
[2024-05-28 13:42:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9051381193583806061.gal : 18 ms
[2024-05-28 13:42:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13676510898313439974.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/CTLFireability9051381193583806061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13676510898313439974.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 21 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:43:21] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:43:21] [INFO ] Invariant cache hit.
[2024-05-28 13:43:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:27] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:43:27] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:43:27] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:43:27] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:43:27] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:43:28] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:43:29] [INFO ] Deduced a trap composed of 270 places in 205 ms of which 4 ms to minimize.
[2024-05-28 13:43:30] [INFO ] Deduced a trap composed of 286 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:43:30] [INFO ] Deduced a trap composed of 256 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:43:30] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:43:30] [INFO ] Deduced a trap composed of 268 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:43:30] [INFO ] Deduced a trap composed of 245 places in 195 ms of which 2 ms to minimize.
[2024-05-28 13:43:30] [INFO ] Deduced a trap composed of 241 places in 156 ms of which 3 ms to minimize.
[2024-05-28 13:43:31] [INFO ] Deduced a trap composed of 288 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:43:31] [INFO ] Deduced a trap composed of 232 places in 146 ms of which 3 ms to minimize.
[2024-05-28 13:43:31] [INFO ] Deduced a trap composed of 248 places in 153 ms of which 3 ms to minimize.
[2024-05-28 13:43:33] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:43:34] [INFO ] Deduced a trap composed of 144 places in 129 ms of which 3 ms to minimize.
[2024-05-28 13:43:35] [INFO ] Deduced a trap composed of 302 places in 227 ms of which 4 ms to minimize.
[2024-05-28 13:43:35] [INFO ] Deduced a trap composed of 278 places in 147 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:35] [INFO ] Deduced a trap composed of 296 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:43:35] [INFO ] Deduced a trap composed of 249 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:43:36] [INFO ] Deduced a trap composed of 261 places in 220 ms of which 4 ms to minimize.
[2024-05-28 13:43:36] [INFO ] Deduced a trap composed of 247 places in 177 ms of which 2 ms to minimize.
[2024-05-28 13:43:41] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 4 ms to minimize.
[2024-05-28 13:43:41] [INFO ] Deduced a trap composed of 242 places in 141 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:43] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:55] [INFO ] Deduced a trap composed of 244 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:43:55] [INFO ] Deduced a trap composed of 288 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:43:55] [INFO ] Deduced a trap composed of 222 places in 222 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 40764ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40772ms
[2024-05-28 13:44:02] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:44:02] [INFO ] Invariant cache hit.
[2024-05-28 13:44:02] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-28 13:44:02] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:44:02] [INFO ] Invariant cache hit.
[2024-05-28 13:44:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:44:06] [INFO ] Implicit Places using invariants and state equation in 3896 ms returned []
Implicit Place search using SMT with State Equation took 4102 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:44:06] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:44:06] [INFO ] Invariant cache hit.
[2024-05-28 13:44:06] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:12] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:44:12] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:44:12] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:44:12] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 2 ms to minimize.
[2024-05-28 13:44:12] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 4 ms to minimize.
[2024-05-28 13:44:13] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:44:14] [INFO ] Deduced a trap composed of 270 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:44:14] [INFO ] Deduced a trap composed of 286 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:44:15] [INFO ] Deduced a trap composed of 256 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:44:15] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:44:15] [INFO ] Deduced a trap composed of 268 places in 240 ms of which 4 ms to minimize.
[2024-05-28 13:44:15] [INFO ] Deduced a trap composed of 245 places in 217 ms of which 4 ms to minimize.
[2024-05-28 13:44:15] [INFO ] Deduced a trap composed of 241 places in 200 ms of which 3 ms to minimize.
[2024-05-28 13:44:16] [INFO ] Deduced a trap composed of 288 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:44:16] [INFO ] Deduced a trap composed of 232 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:44:16] [INFO ] Deduced a trap composed of 248 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:44:18] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 3 ms to minimize.
[2024-05-28 13:44:19] [INFO ] Deduced a trap composed of 144 places in 214 ms of which 4 ms to minimize.
[2024-05-28 13:44:19] [INFO ] Deduced a trap composed of 302 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:44:20] [INFO ] Deduced a trap composed of 278 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:20] [INFO ] Deduced a trap composed of 296 places in 228 ms of which 3 ms to minimize.
[2024-05-28 13:44:20] [INFO ] Deduced a trap composed of 249 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:44:21] [INFO ] Deduced a trap composed of 261 places in 185 ms of which 2 ms to minimize.
[2024-05-28 13:44:21] [INFO ] Deduced a trap composed of 247 places in 199 ms of which 2 ms to minimize.
[2024-05-28 13:44:26] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:44:27] [INFO ] Deduced a trap composed of 242 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:34] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:42] [INFO ] Deduced a trap composed of 222 places in 140 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:45:02] [INFO ] Deduced a trap composed of 145 places in 159 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60611ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60618ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 776/824 transitions.
Applied a total of 0 rules in 3 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105521 ms. Remains : 456/470 places, 776/824 transitions.
[2024-05-28 13:45:06] [INFO ] Flatten gal took : 20 ms
[2024-05-28 13:45:06] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:45:06] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:45:07] [INFO ] Flatten gal took : 34 ms
[2024-05-28 13:45:07] [INFO ] Flatten gal took : 48 ms
[2024-05-28 13:45:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5080870984012580465.gal : 19 ms
[2024-05-28 13:45:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9065455496295834357.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/CTLFireability5080870984012580465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9065455496295834357.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:45:37] [INFO ] Flatten gal took : 45 ms
[2024-05-28 13:45:37] [INFO ] Applying decomposition
[2024-05-28 13:45:37] [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/graph5102462670783048869.txt' '-o' '/tmp/graph5102462670783048869.bin' '-w' '/tmp/graph5102462670783048869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5102462670783048869.bin' '-l' '-1' '-v' '-w' '/tmp/graph5102462670783048869.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:45:37] [INFO ] Decomposing Gal with order
[2024-05-28 13:45:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:45:37] [INFO ] Removed a total of 654 redundant transitions.
[2024-05-28 13:45:37] [INFO ] Flatten gal took : 104 ms
[2024-05-28 13:45:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 30 ms.
[2024-05-28 13:45:37] [INFO ] Time to serialize gal into /tmp/CTLFireability12014260431920417708.gal : 9 ms
[2024-05-28 13:45:37] [INFO ] Time to serialize properties into /tmp/CTLFireability8726704592819113090.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/CTLFireability12014260431920417708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8726704592819113090.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 39 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:46:07] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:46:07] [INFO ] Invariant cache hit.
[2024-05-28 13:46:07] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:13] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:46:13] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:46:13] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:46:13] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:46:14] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:46:14] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:46:16] [INFO ] Deduced a trap composed of 270 places in 162 ms of which 2 ms to minimize.
[2024-05-28 13:46:16] [INFO ] Deduced a trap composed of 286 places in 161 ms of which 2 ms to minimize.
[2024-05-28 13:46:16] [INFO ] Deduced a trap composed of 256 places in 162 ms of which 2 ms to minimize.
[2024-05-28 13:46:16] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-05-28 13:46:16] [INFO ] Deduced a trap composed of 268 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:46:16] [INFO ] Deduced a trap composed of 245 places in 152 ms of which 3 ms to minimize.
[2024-05-28 13:46:17] [INFO ] Deduced a trap composed of 241 places in 157 ms of which 2 ms to minimize.
[2024-05-28 13:46:17] [INFO ] Deduced a trap composed of 288 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:46:17] [INFO ] Deduced a trap composed of 232 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:46:17] [INFO ] Deduced a trap composed of 248 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:46:19] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 2 ms to minimize.
[2024-05-28 13:46:20] [INFO ] Deduced a trap composed of 144 places in 182 ms of which 3 ms to minimize.
[2024-05-28 13:46:20] [INFO ] Deduced a trap composed of 302 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:46:21] [INFO ] Deduced a trap composed of 278 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:21] [INFO ] Deduced a trap composed of 296 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:46:21] [INFO ] Deduced a trap composed of 249 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:46:21] [INFO ] Deduced a trap composed of 261 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:46:22] [INFO ] Deduced a trap composed of 247 places in 157 ms of which 3 ms to minimize.
[2024-05-28 13:46:26] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:46:27] [INFO ] Deduced a trap composed of 242 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:29] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:41] [INFO ] Deduced a trap composed of 244 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:46:41] [INFO ] Deduced a trap composed of 288 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:46:41] [INFO ] Deduced a trap composed of 222 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 40847ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40860ms
[2024-05-28 13:46:48] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:46:48] [INFO ] Invariant cache hit.
[2024-05-28 13:46:48] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-28 13:46:48] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:46:48] [INFO ] Invariant cache hit.
[2024-05-28 13:46:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:46:53] [INFO ] Implicit Places using invariants and state equation in 4836 ms returned []
Implicit Place search using SMT with State Equation took 5101 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:46:53] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:46:53] [INFO ] Invariant cache hit.
[2024-05-28 13:46:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:59] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:46:59] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:46:59] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:46:59] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 0 ms to minimize.
[2024-05-28 13:47:00] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:47:00] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 270 places in 159 ms of which 3 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 286 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 256 places in 152 ms of which 3 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 268 places in 190 ms of which 2 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 245 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 241 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 288 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 232 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 248 places in 174 ms of which 3 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:47:06] [INFO ] Deduced a trap composed of 302 places in 209 ms of which 4 ms to minimize.
[2024-05-28 13:47:06] [INFO ] Deduced a trap composed of 278 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:47:07] [INFO ] Deduced a trap composed of 296 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:47:07] [INFO ] Deduced a trap composed of 249 places in 161 ms of which 2 ms to minimize.
[2024-05-28 13:47:07] [INFO ] Deduced a trap composed of 261 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:47:07] [INFO ] Deduced a trap composed of 247 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:47:12] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:47:13] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:47:21] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:47:30] [INFO ] Deduced a trap composed of 222 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:47:50] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60687ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60699ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 776/824 transitions.
Applied a total of 0 rules in 3 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106722 ms. Remains : 456/470 places, 776/824 transitions.
[2024-05-28 13:47:54] [INFO ] Flatten gal took : 18 ms
[2024-05-28 13:47:54] [INFO ] Flatten gal took : 19 ms
[2024-05-28 13:47:54] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:47:54] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:47:54] [INFO ] Flatten gal took : 45 ms
[2024-05-28 13:47:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11222232878602919429.gal : 6 ms
[2024-05-28 13:47:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8159372674759520838.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/CTLFireability11222232878602919429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8159372674759520838.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:24] [INFO ] Flatten gal took : 51 ms
[2024-05-28 13:48:24] [INFO ] Applying decomposition
[2024-05-28 13:48:24] [INFO ] Flatten gal took : 38 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/graph11602125085859275582.txt' '-o' '/tmp/graph11602125085859275582.bin' '-w' '/tmp/graph11602125085859275582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11602125085859275582.bin' '-l' '-1' '-v' '-w' '/tmp/graph11602125085859275582.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:48:24] [INFO ] Decomposing Gal with order
[2024-05-28 13:48:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:48:24] [INFO ] Removed a total of 632 redundant transitions.
[2024-05-28 13:48:24] [INFO ] Flatten gal took : 70 ms
[2024-05-28 13:48:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 191 labels/synchronizations in 15 ms.
[2024-05-28 13:48:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1008969129185281542.gal : 9 ms
[2024-05-28 13:48:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3796797798699170865.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/CTLFireability1008969129185281542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3796797798699170865.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 25 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:48:55] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:48:55] [INFO ] Invariant cache hit.
[2024-05-28 13:48:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 270 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 286 places in 198 ms of which 2 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 256 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 268 places in 179 ms of which 2 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 245 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 241 places in 178 ms of which 2 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 288 places in 164 ms of which 3 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 232 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:49:06] [INFO ] Deduced a trap composed of 248 places in 162 ms of which 3 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 144 places in 237 ms of which 4 ms to minimize.
[2024-05-28 13:49:09] [INFO ] Deduced a trap composed of 302 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:49:10] [INFO ] Deduced a trap composed of 278 places in 177 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:10] [INFO ] Deduced a trap composed of 296 places in 231 ms of which 3 ms to minimize.
[2024-05-28 13:49:10] [INFO ] Deduced a trap composed of 249 places in 175 ms of which 2 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 261 places in 176 ms of which 2 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 247 places in 220 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 1.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 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.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 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.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 1.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 1.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 0.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 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 8.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.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 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:20] [INFO ] Deduced a trap composed of 297 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:49:23] [INFO ] Deduced a trap composed of 276 places in 155 ms of which 3 ms to minimize.
[2024-05-28 13:49:24] [INFO ] Deduced a trap composed of 246 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:30] [INFO ] Deduced a trap composed of 239 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 129 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40789ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40801ms
[2024-05-28 13:49:35] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:49:35] [INFO ] Invariant cache hit.
[2024-05-28 13:49:36] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-28 13:49:36] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:49:36] [INFO ] Invariant cache hit.
[2024-05-28 13:49:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:49:39] [INFO ] Implicit Places using invariants and state equation in 3525 ms returned []
Implicit Place search using SMT with State Equation took 3807 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:49:39] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:49:39] [INFO ] Invariant cache hit.
[2024-05-28 13:49:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:45] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:49:45] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2024-05-28 13:49:46] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:49:46] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:49:46] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:49:47] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 0 ms to minimize.
[2024-05-28 13:49:48] [INFO ] Deduced a trap composed of 270 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:49:49] [INFO ] Deduced a trap composed of 286 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:49:49] [INFO ] Deduced a trap composed of 256 places in 252 ms of which 3 ms to minimize.
[2024-05-28 13:49:49] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 3 ms to minimize.
[2024-05-28 13:49:49] [INFO ] Deduced a trap composed of 268 places in 229 ms of which 4 ms to minimize.
[2024-05-28 13:49:50] [INFO ] Deduced a trap composed of 245 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:49:50] [INFO ] Deduced a trap composed of 241 places in 170 ms of which 3 ms to minimize.
[2024-05-28 13:49:50] [INFO ] Deduced a trap composed of 288 places in 225 ms of which 3 ms to minimize.
[2024-05-28 13:49:50] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:49:50] [INFO ] Deduced a trap composed of 248 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:49:52] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 2 ms to minimize.
[2024-05-28 13:49:53] [INFO ] Deduced a trap composed of 144 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:49:54] [INFO ] Deduced a trap composed of 302 places in 172 ms of which 2 ms to minimize.
[2024-05-28 13:49:54] [INFO ] Deduced a trap composed of 278 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:54] [INFO ] Deduced a trap composed of 296 places in 173 ms of which 2 ms to minimize.
[2024-05-28 13:49:54] [INFO ] Deduced a trap composed of 249 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:49:55] [INFO ] Deduced a trap composed of 261 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:49:55] [INFO ] Deduced a trap composed of 247 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:50:00] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:50:00] [INFO ] Deduced a trap composed of 242 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:50:08] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:50:16] [INFO ] Deduced a trap composed of 222 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:50:35] [INFO ] Deduced a trap composed of 145 places in 165 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60793ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60802ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 776/824 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105445 ms. Remains : 456/470 places, 776/824 transitions.
[2024-05-28 13:50:40] [INFO ] Flatten gal took : 20 ms
[2024-05-28 13:50:40] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:50:40] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:50:40] [INFO ] Flatten gal took : 34 ms
[2024-05-28 13:50:40] [INFO ] Flatten gal took : 20 ms
[2024-05-28 13:50:40] [INFO ] Time to serialize gal into /tmp/CTLFireability18053311584518226221.gal : 4 ms
[2024-05-28 13:50:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6065982252749025022.ctl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18053311584518226221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6065982252749025022.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:10] [INFO ] Flatten gal took : 20 ms
[2024-05-28 13:51:10] [INFO ] Applying decomposition
[2024-05-28 13:51:10] [INFO ] Flatten gal took : 20 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/graph10577989939776188293.txt' '-o' '/tmp/graph10577989939776188293.bin' '-w' '/tmp/graph10577989939776188293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10577989939776188293.bin' '-l' '-1' '-v' '-w' '/tmp/graph10577989939776188293.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:51:10] [INFO ] Decomposing Gal with order
[2024-05-28 13:51:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:51:10] [INFO ] Removed a total of 626 redundant transitions.
[2024-05-28 13:51:11] [INFO ] Flatten gal took : 122 ms
[2024-05-28 13:51:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 11 ms.
[2024-05-28 13:51:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1654444739573481674.gal : 20 ms
[2024-05-28 13:51:11] [INFO ] Time to serialize properties into /tmp/CTLFireability609724758529372587.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/CTLFireability1654444739573481674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability609724758529372587.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 11 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:51:41] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:51:41] [INFO ] Invariant cache hit.
[2024-05-28 13:51:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:51:46] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-28 13:51:47] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:51:47] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:51:47] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:51:48] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-28 13:51:48] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:51:50] [INFO ] Deduced a trap composed of 270 places in 235 ms of which 3 ms to minimize.
[2024-05-28 13:51:50] [INFO ] Deduced a trap composed of 286 places in 234 ms of which 3 ms to minimize.
[2024-05-28 13:51:50] [INFO ] Deduced a trap composed of 256 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:51:50] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:51:50] [INFO ] Deduced a trap composed of 268 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 245 places in 197 ms of which 3 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 241 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 288 places in 182 ms of which 2 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 232 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 248 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:51:53] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-05-28 13:51:54] [INFO ] Deduced a trap composed of 144 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 302 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 278 places in 183 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 296 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 249 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 261 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 247 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:52:01] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 20659ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 20666ms
[2024-05-28 13:52:01] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:52:01] [INFO ] Invariant cache hit.
[2024-05-28 13:52:02] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-28 13:52:02] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:52:02] [INFO ] Invariant cache hit.
[2024-05-28 13:52:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:52:05] [INFO ] Implicit Places using invariants and state equation in 3727 ms returned []
Implicit Place search using SMT with State Equation took 4019 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:52:05] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:52:05] [INFO ] Invariant cache hit.
[2024-05-28 13:52:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:52:11] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:52:11] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:52:11] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-05-28 13:52:11] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:52:12] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:52:12] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:52:14] [INFO ] Deduced a trap composed of 270 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:52:14] [INFO ] Deduced a trap composed of 286 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:52:15] [INFO ] Deduced a trap composed of 256 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:52:15] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 4 ms to minimize.
[2024-05-28 13:52:15] [INFO ] Deduced a trap composed of 268 places in 185 ms of which 2 ms to minimize.
[2024-05-28 13:52:15] [INFO ] Deduced a trap composed of 245 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 241 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 288 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 232 places in 181 ms of which 2 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 248 places in 207 ms of which 2 ms to minimize.
[2024-05-28 13:52:18] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 4 ms to minimize.
[2024-05-28 13:52:19] [INFO ] Deduced a trap composed of 144 places in 243 ms of which 4 ms to minimize.
[2024-05-28 13:52:20] [INFO ] Deduced a trap composed of 302 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:52:20] [INFO ] Deduced a trap composed of 278 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:52:20] [INFO ] Deduced a trap composed of 296 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:52:20] [INFO ] Deduced a trap composed of 249 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:52:21] [INFO ] Deduced a trap composed of 261 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:52:21] [INFO ] Deduced a trap composed of 247 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:52:25] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
[2024-05-28 13:52:26] [INFO ] Deduced a trap composed of 242 places in 133 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:52:34] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:52:43] [INFO ] Deduced a trap composed of 222 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 145 places in 183 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60759ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60769ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 776/824 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85475 ms. Remains : 456/470 places, 776/824 transitions.
[2024-05-28 13:53:06] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:53:06] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:53:06] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:53:06] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:53:06] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:53:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8973352564028303646.gal : 3 ms
[2024-05-28 13:53:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3020876361805295800.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/CTLFireability8973352564028303646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3020876361805295800.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:53:36] [INFO ] Flatten gal took : 44 ms
[2024-05-28 13:53:36] [INFO ] Applying decomposition
[2024-05-28 13:53:36] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10346442559647037023.txt' '-o' '/tmp/graph10346442559647037023.bin' '-w' '/tmp/graph10346442559647037023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10346442559647037023.bin' '-l' '-1' '-v' '-w' '/tmp/graph10346442559647037023.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:53:37] [INFO ] Decomposing Gal with order
[2024-05-28 13:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:53:37] [INFO ] Removed a total of 651 redundant transitions.
[2024-05-28 13:53:37] [INFO ] Flatten gal took : 71 ms
[2024-05-28 13:53:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 9 ms.
[2024-05-28 13:53:37] [INFO ] Time to serialize gal into /tmp/CTLFireability2404852072171962496.gal : 6 ms
[2024-05-28 13:53:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12607338669946144796.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/CTLFireability2404852072171962496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12607338669946144796.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Applied a total of 14 rules in 9 ms. Remains 462 /470 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-28 13:54:07] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-05-28 13:54:07] [INFO ] Computed 38 invariants in 20 ms
[2024-05-28 13:54:07] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 0 ms to minimize.
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 130 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 2 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 235 places in 197 ms of which 4 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 277 places in 173 ms of which 3 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:54:15] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 228 places in 245 ms of which 3 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 223 places in 257 ms of which 4 ms to minimize.
[2024-05-28 13:54:19] [INFO ] Deduced a trap composed of 264 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:54:19] [INFO ] Deduced a trap composed of 256 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:54:19] [INFO ] Deduced a trap composed of 214 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
SMT process timed out in 20725ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 20734ms
[2024-05-28 13:54:28] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 13:54:28] [INFO ] Invariant cache hit.
[2024-05-28 13:54:28] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-28 13:54:28] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 13:54:28] [INFO ] Invariant cache hit.
[2024-05-28 13:54:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:54:31] [INFO ] Implicit Places using invariants and state equation in 2762 ms returned []
Implicit Place search using SMT with State Equation took 3032 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2024-05-28 13:54:31] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 13:54:31] [INFO ] Invariant cache hit.
[2024-05-28 13:54:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 0 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 251 places in 165 ms of which 3 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 278 places in 150 ms of which 3 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 254 places in 170 ms of which 2 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 264 places in 171 ms of which 2 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 259 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 247 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-28 13:54:41] [INFO ] Deduced a trap composed of 228 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 327 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 239 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:54:43] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:54:43] [INFO ] Deduced a trap composed of 233 places in 198 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:54:48] [INFO ] Deduced a trap composed of 225 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:54:50] [INFO ] Deduced a trap composed of 275 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 247 places in 235 ms of which 5 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 60 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:55:04] [INFO ] Deduced a trap composed of 247 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/462 variables, 2/63 constraints. Problems are: Problem set: 66 solved, 750 unsolved
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 219 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:55:25] [INFO ] Deduced a trap composed of 197 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 214 places in 212 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 4/67 constraints. Problems are: Problem set: 66 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1268 variables, and 67 constraints, problems are : Problem set: 66 solved, 750 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 29/29 constraints]
After SMT, in 60583ms problems are : Problem set: 66 solved, 750 unsolved
Search for dead transitions found 66 dead transitions in 60593ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 462/470 places, 752/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 460 transition count 740
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 448 transition count 728
Applied a total of 14 rules in 9 ms. Remains 448 /462 variables (removed 14) and now considering 728/752 (removed 24) transitions.
[2024-05-28 13:55:31] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
// Phase 1: matrix 716 rows 448 cols
[2024-05-28 13:55:31] [INFO ] Computed 38 invariants in 6 ms
[2024-05-28 13:55:31] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-28 13:55:31] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
[2024-05-28 13:55:31] [INFO ] Invariant cache hit.
[2024-05-28 13:55:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:55:35] [INFO ] Implicit Places using invariants and state equation in 3829 ms returned []
Implicit Place search using SMT with State Equation took 4065 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 448/470 places, 728/824 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88446 ms. Remains : 448/470 places, 728/824 transitions.
[2024-05-28 13:55:35] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:55:35] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:55:35] [INFO ] Input system was already deterministic with 728 transitions.
[2024-05-28 13:55:35] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:55:35] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:55:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8273066761958407583.gal : 10 ms
[2024-05-28 13:55:35] [INFO ] Time to serialize properties into /tmp/CTLFireability92371452415908689.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/CTLFireability8273066761958407583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability92371452415908689.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:56:06] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:56:06] [INFO ] Applying decomposition
[2024-05-28 13:56:06] [INFO ] Flatten gal took : 30 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/graph5596143952375504052.txt' '-o' '/tmp/graph5596143952375504052.bin' '-w' '/tmp/graph5596143952375504052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5596143952375504052.bin' '-l' '-1' '-v' '-w' '/tmp/graph5596143952375504052.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:56:06] [INFO ] Decomposing Gal with order
[2024-05-28 13:56:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:56:06] [INFO ] Removed a total of 684 redundant transitions.
[2024-05-28 13:56:06] [INFO ] Flatten gal took : 63 ms
[2024-05-28 13:56:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 7 ms.
[2024-05-28 13:56:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3171043968805507688.gal : 7 ms
[2024-05-28 13:56:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15316184307920433438.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/CTLFireability3171043968805507688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15316184307920433438.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 : 470/470 places, 824/824 transitions.
Applied a total of 0 rules in 5 ms. Remains 470 /470 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2024-05-28 13:56:36] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 470 cols
[2024-05-28 13:56:36] [INFO ] Computed 40 invariants in 17 ms
[2024-05-28 13:56:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 66 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 66 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 66 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 266 places in 180 ms of which 4 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 151 places in 168 ms of which 3 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 283 places in 168 ms of which 3 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 250 places in 213 ms of which 2 ms to minimize.
[2024-05-28 13:56:44] [INFO ] Deduced a trap composed of 250 places in 188 ms of which 3 ms to minimize.
[2024-05-28 13:56:44] [INFO ] Deduced a trap composed of 220 places in 168 ms of which 3 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 243 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 241 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 278 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 231 places in 182 ms of which 15 ms to minimize.
[2024-05-28 13:56:50] [INFO ] Deduced a trap composed of 223 places in 174 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1282 variables, and 54 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/470 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:56:58] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:56:58] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:57:02] [INFO ] Deduced a trap composed of 253 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:57:05] [INFO ] Deduced a trap composed of 259 places in 158 ms of which 2 ms to minimize.
[2024-05-28 13:57:05] [INFO ] Deduced a trap composed of 262 places in 193 ms of which 2 ms to minimize.
[2024-05-28 13:57:05] [INFO ] Deduced a trap composed of 260 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:57:06] [INFO ] Deduced a trap composed of 255 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:57:12] [INFO ] Deduced a trap composed of 312 places in 191 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1282 variables, and 62 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/470 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 26/26 constraints]
After SMT, in 40902ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40910ms
[2024-05-28 13:57:17] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 13:57:17] [INFO ] Invariant cache hit.
[2024-05-28 13:57:17] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-28 13:57:17] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 13:57:17] [INFO ] Invariant cache hit.
[2024-05-28 13:57:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:57:21] [INFO ] Implicit Places using invariants and state equation in 4004 ms returned []
Implicit Place search using SMT with State Equation took 4234 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-28 13:57:21] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 13:57:21] [INFO ] Invariant cache hit.
[2024-05-28 13:57:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:57:27] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:57:27] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:57:27] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:57:28] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 3 ms to minimize.
[2024-05-28 13:57:28] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 3 ms to minimize.
[2024-05-28 13:57:28] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:57:28] [INFO ] Deduced a trap composed of 283 places in 218 ms of which 4 ms to minimize.
[2024-05-28 13:57:29] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:57:30] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:57:30] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:57:31] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:57:32] [INFO ] Deduced a trap composed of 228 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:57:34] [INFO ] Deduced a trap composed of 239 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:57:34] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:57:34] [INFO ] Deduced a trap composed of 249 places in 175 ms of which 2 ms to minimize.
[2024-05-28 13:57:35] [INFO ] Deduced a trap composed of 239 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:57:35] [INFO ] Deduced a trap composed of 225 places in 184 ms of which 2 ms to minimize.
[2024-05-28 13:57:36] [INFO ] Deduced a trap composed of 325 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:57:36] [INFO ] Deduced a trap composed of 231 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:57:36] [INFO ] Deduced a trap composed of 258 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:57:42] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 3 ms to minimize.
[2024-05-28 13:57:42] [INFO ] Deduced a trap composed of 254 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:57:42] [INFO ] Deduced a trap composed of 252 places in 199 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1282 variables, and 59 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/470 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:58:01] [INFO ] Deduced a trap composed of 299 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:58:11] [INFO ] Deduced a trap composed of 254 places in 197 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1282 variables, and 61 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/470 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 25/25 constraints]
After SMT, in 60811ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60822ms
Finished structural reductions in LTL mode , in 1 iterations and 105975 ms. Remains : 470/470 places, 824/824 transitions.
[2024-05-28 13:58:22] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:58:22] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:58:22] [INFO ] Input system was already deterministic with 824 transitions.
[2024-05-28 13:58:22] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:58:22] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:58:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4355102926402249949.gal : 3 ms
[2024-05-28 13:58:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12008599215371376310.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/CTLFireability4355102926402249949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12008599215371376310.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 468 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 414 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 108 place count 414 transition count 722
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 204 place count 366 transition count 722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 210 place count 360 transition count 716
Iterating global reduction 2 with 6 rules applied. Total rules applied 216 place count 360 transition count 716
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 312 place count 312 transition count 668
Applied a total of 312 rules in 77 ms. Remains 312 /470 variables (removed 158) and now considering 668/824 (removed 156) transitions.
Running 666 sub problems to find dead transitions.
[2024-05-28 13:59:22] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2024-05-28 13:59:23] [INFO ] Computed 38 invariants in 8 ms
[2024-05-28 13:59:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 14 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 142 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 115 places in 190 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 6 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:59:28] [INFO ] Deduced a trap composed of 178 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:59:29] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:59:31] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 2 ms to minimize.
[2024-05-28 13:59:31] [INFO ] Deduced a trap composed of 135 places in 183 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 13:59:36] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 13:59:42] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.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 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 310/968 variables, and 52 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 13:59:47] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 116 places in 98 ms of which 1 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 14:00:02] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 56 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 20/20 constraints]
After SMT, in 40707ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 40714ms
[2024-05-28 14:00:03] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2024-05-28 14:00:03] [INFO ] Invariant cache hit.
[2024-05-28 14:00:03] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 14:00:03] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2024-05-28 14:00:03] [INFO ] Invariant cache hit.
[2024-05-28 14:00:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:00:06] [INFO ] Implicit Places using invariants and state equation in 2126 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
[2024-05-28 14:00:06] [INFO ] Redundant transitions in 3 ms returned []
Running 666 sub problems to find dead transitions.
[2024-05-28 14:00:06] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2024-05-28 14:00:06] [INFO ] Invariant cache hit.
[2024-05-28 14:00:06] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 14:00:10] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:00:10] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-28 14:00:10] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:00:10] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:00:10] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-05-28 14:00:10] [INFO ] Deduced a trap composed of 133 places in 233 ms of which 2 ms to minimize.
[2024-05-28 14:00:10] [INFO ] Deduced a trap composed of 117 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:00:11] [INFO ] Deduced a trap composed of 123 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:00:11] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:00:14] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-28 14:00:15] [INFO ] Deduced a trap composed of 114 places in 166 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 14:00:15] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 14:00:24] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2024-05-28 14:00:24] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:00:24] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:00:25] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 14:00:26] [INFO ] Deduced a trap composed of 178 places in 167 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/311 variables, 1/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/968 variables, and 54 constraints, problems are : Problem set: 36 solved, 630 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 36 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 17/53 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2024-05-28 14:00:40] [INFO ] Deduced a trap composed of 108 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2024-05-28 14:00:42] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 1/55 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2024-05-28 14:00:51] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/56 constraints. Problems are: Problem set: 36 solved, 630 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 310/968 variables, and 56 constraints, problems are : Problem set: 36 solved, 630 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 20/20 constraints]
After SMT, in 60680ms problems are : Problem set: 36 solved, 630 unsolved
Search for dead transitions found 36 dead transitions in 60687ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 312/470 places, 632/824 transitions.
Applied a total of 0 rules in 18 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
[2024-05-28 14:01:06] [INFO ] Redundant transitions in 32 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 103904 ms. Remains : 312/470 places, 632/824 transitions.
[2024-05-28 14:01:06] [INFO ] Flatten gal took : 17 ms
[2024-05-28 14:01:06] [INFO ] Flatten gal took : 18 ms
[2024-05-28 14:01:06] [INFO ] Input system was already deterministic with 632 transitions.
[2024-05-28 14:01:06] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:01:06] [INFO ] Flatten gal took : 51 ms
[2024-05-28 14:01:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14510008681828515374.gal : 7 ms
[2024-05-28 14:01:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13958342626935223452.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/CTLFireability14510008681828515374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13958342626935223452.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:37] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:01:37] [INFO ] Applying decomposition
[2024-05-28 14:01:37] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph194945377244285230.txt' '-o' '/tmp/graph194945377244285230.bin' '-w' '/tmp/graph194945377244285230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph194945377244285230.bin' '-l' '-1' '-v' '-w' '/tmp/graph194945377244285230.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:01:37] [INFO ] Decomposing Gal with order
[2024-05-28 14:01:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:01:37] [INFO ] Removed a total of 485 redundant transitions.
[2024-05-28 14:01:37] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:01:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 8 ms.
[2024-05-28 14:01:37] [INFO ] Time to serialize gal into /tmp/CTLFireability256749920474683415.gal : 4 ms
[2024-05-28 14:01:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9170227281595583925.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/CTLFireability256749920474683415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9170227281595583925.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 468 transition count 806
Reduce places removed 18 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 30 rules applied. Total rules applied 48 place count 450 transition count 794
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 60 place count 438 transition count 794
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 60 place count 438 transition count 776
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 96 place count 420 transition count 776
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 414 transition count 770
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 414 transition count 770
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 156 place count 390 transition count 746
Applied a total of 156 rules in 52 ms. Remains 390 /470 variables (removed 80) and now considering 746/824 (removed 78) transitions.
Running 744 sub problems to find dead transitions.
[2024-05-28 14:02:07] [INFO ] Flow matrix only has 734 transitions (discarded 12 similar events)
// Phase 1: matrix 734 rows 390 cols
[2024-05-28 14:02:07] [INFO ] Computed 38 invariants in 13 ms
[2024-05-28 14:02:07] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-28 14:02:12] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:02:12] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:02:12] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:02:12] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-28 14:02:12] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:02:12] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:02:13] [INFO ] Deduced a trap composed of 178 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:02:13] [INFO ] Deduced a trap composed of 197 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:02:13] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:02:13] [INFO ] Deduced a trap composed of 191 places in 130 ms of which 2 ms to minimize.
[2024-05-28 14:02:13] [INFO ] Deduced a trap composed of 184 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:02:13] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 2 ms to minimize.
[2024-05-28 14:02:14] [INFO ] Deduced a trap composed of 198 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:02:14] [INFO ] Deduced a trap composed of 208 places in 159 ms of which 2 ms to minimize.
[2024-05-28 14:02:14] [INFO ] Deduced a trap composed of 203 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:02:17] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:02:17] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:02:19] [INFO ] Deduced a trap composed of 215 places in 107 ms of which 1 ms to minimize.
[2024-05-28 14:02:19] [INFO ] Deduced a trap composed of 246 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:02:19] [INFO ] Deduced a trap composed of 245 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-28 14:02:22] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 2 ms to minimize.
[2024-05-28 14:02:22] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 2 ms to minimize.
[2024-05-28 14:02:23] [INFO ] Deduced a trap composed of 200 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1124 variables, and 59 constraints, problems are : Problem set: 0 solved, 744 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-28 14:02:32] [INFO ] Deduced a trap composed of 224 places in 157 ms of which 3 ms to minimize.
[2024-05-28 14:02:33] [INFO ] Deduced a trap composed of 217 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 5 (OVERLAPS) 1/389 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/1124 variables, and 62 constraints, problems are : Problem set: 0 solved, 744 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/744 constraints, Known Traps: 25/25 constraints]
After SMT, in 40841ms problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 40848ms
[2024-05-28 14:02:48] [INFO ] Flow matrix only has 734 transitions (discarded 12 similar events)
[2024-05-28 14:02:48] [INFO ] Invariant cache hit.
[2024-05-28 14:02:48] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-28 14:02:48] [INFO ] Flow matrix only has 734 transitions (discarded 12 similar events)
[2024-05-28 14:02:48] [INFO ] Invariant cache hit.
[2024-05-28 14:02:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:02:50] [INFO ] Implicit Places using invariants and state equation in 2174 ms returned []
Implicit Place search using SMT with State Equation took 2440 ms to find 0 implicit places.
[2024-05-28 14:02:50] [INFO ] Redundant transitions in 12 ms returned []
Running 744 sub problems to find dead transitions.
[2024-05-28 14:02:50] [INFO ] Flow matrix only has 734 transitions (discarded 12 similar events)
[2024-05-28 14:02:50] [INFO ] Invariant cache hit.
[2024-05-28 14:02:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 53 places in 26 ms of which 1 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:02:56] [INFO ] Deduced a trap composed of 192 places in 167 ms of which 3 ms to minimize.
[2024-05-28 14:02:56] [INFO ] Deduced a trap composed of 185 places in 165 ms of which 2 ms to minimize.
[2024-05-28 14:02:56] [INFO ] Deduced a trap composed of 205 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:02:56] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:02:59] [INFO ] Deduced a trap composed of 186 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:02:59] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:02:59] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-28 14:03:05] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:03:05] [INFO ] Deduced a trap composed of 176 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-28 14:03:11] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 3 ms to minimize.
[2024-05-28 14:03:12] [INFO ] Deduced a trap composed of 182 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-28 14:03:15] [INFO ] Deduced a trap composed of 206 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:03:15] [INFO ] Deduced a trap composed of 183 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:03:16] [INFO ] Deduced a trap composed of 245 places in 130 ms of which 2 ms to minimize.
[2024-05-28 14:03:20] [INFO ] Deduced a trap composed of 170 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:03:20] [INFO ] Deduced a trap composed of 204 places in 187 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 744 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 Real declared 388/1124 variables, and 58 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/389 variables, 1/59 constraints. Problems are: Problem set: 36 solved, 708 unsolved
[2024-05-28 14:03:35] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 1/60 constraints. Problems are: Problem set: 36 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/60 constraints. Problems are: Problem set: 36 solved, 708 unsolved
SMT process timed out in 60728ms, After SMT, problems are : Problem set: 36 solved, 708 unsolved
Search for dead transitions found 36 dead transitions in 60736ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 390/470 places, 710/824 transitions.
Applied a total of 0 rules in 28 ms. Remains 390 /390 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-05-28 14:03:51] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 104152 ms. Remains : 390/470 places, 710/824 transitions.
[2024-05-28 14:03:51] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:03:51] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:03:51] [INFO ] Input system was already deterministic with 710 transitions.
[2024-05-28 14:03:51] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:03:51] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:03:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15805811741108182129.gal : 4 ms
[2024-05-28 14:03:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7149975444013364283.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/CTLFireability15805811741108182129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7149975444013364283.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:04:21] [INFO ] Flatten gal took : 46 ms
[2024-05-28 14:04:21] [INFO ] Applying decomposition
[2024-05-28 14:04:21] [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/graph1006822463144462368.txt' '-o' '/tmp/graph1006822463144462368.bin' '-w' '/tmp/graph1006822463144462368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1006822463144462368.bin' '-l' '-1' '-v' '-w' '/tmp/graph1006822463144462368.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:04:21] [INFO ] Decomposing Gal with order
[2024-05-28 14:04:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:04:21] [INFO ] Removed a total of 490 redundant transitions.
[2024-05-28 14:04:21] [INFO ] Flatten gal took : 57 ms
[2024-05-28 14:04:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 5 ms.
[2024-05-28 14:04:22] [INFO ] Time to serialize gal into /tmp/CTLFireability11968599483109070193.gal : 10 ms
[2024-05-28 14:04:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11977336598479963871.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/CTLFireability11968599483109070193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11977336598479963871.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 25 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:04:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 14:04:52] [INFO ] Computed 38 invariants in 8 ms
[2024-05-28 14:04:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:04:57] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:04:57] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:04:58] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:04:58] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:04:58] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:04:58] [INFO ] Deduced a trap composed of 240 places in 195 ms of which 4 ms to minimize.
[2024-05-28 14:04:58] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:04:58] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:04:59] [INFO ] Deduced a trap composed of 271 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:04:59] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:04:59] [INFO ] Deduced a trap composed of 265 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:05:02] [INFO ] Deduced a trap composed of 248 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:05:03] [INFO ] Deduced a trap composed of 223 places in 139 ms of which 3 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 241 places in 177 ms of which 2 ms to minimize.
[2024-05-28 14:05:05] [INFO ] Deduced a trap composed of 110 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:05:07] [INFO ] Deduced a trap composed of 262 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:05:07] [INFO ] Deduced a trap composed of 269 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:05:12] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 4 ms to minimize.
[2024-05-28 14:05:13] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 20940ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 20955ms
[2024-05-28 14:05:13] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:05:13] [INFO ] Invariant cache hit.
[2024-05-28 14:05:13] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-28 14:05:13] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:05:13] [INFO ] Invariant cache hit.
[2024-05-28 14:05:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:05:17] [INFO ] Implicit Places using invariants and state equation in 3674 ms returned []
Implicit Place search using SMT with State Equation took 3970 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:05:17] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:05:17] [INFO ] Invariant cache hit.
[2024-05-28 14:05:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:05:23] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 0 ms to minimize.
[2024-05-28 14:05:23] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 0 ms to minimize.
[2024-05-28 14:05:23] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:05:24] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:05:24] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:05:24] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:05:26] [INFO ] Deduced a trap composed of 270 places in 171 ms of which 2 ms to minimize.
[2024-05-28 14:05:26] [INFO ] Deduced a trap composed of 286 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:05:26] [INFO ] Deduced a trap composed of 256 places in 168 ms of which 2 ms to minimize.
[2024-05-28 14:05:26] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:05:27] [INFO ] Deduced a trap composed of 268 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:05:27] [INFO ] Deduced a trap composed of 245 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:05:27] [INFO ] Deduced a trap composed of 241 places in 151 ms of which 3 ms to minimize.
[2024-05-28 14:05:27] [INFO ] Deduced a trap composed of 288 places in 184 ms of which 2 ms to minimize.
[2024-05-28 14:05:27] [INFO ] Deduced a trap composed of 232 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:05:27] [INFO ] Deduced a trap composed of 248 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:05:30] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:05:30] [INFO ] Deduced a trap composed of 144 places in 176 ms of which 2 ms to minimize.
[2024-05-28 14:05:31] [INFO ] Deduced a trap composed of 302 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:05:31] [INFO ] Deduced a trap composed of 278 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:05:32] [INFO ] Deduced a trap composed of 296 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:05:32] [INFO ] Deduced a trap composed of 249 places in 151 ms of which 2 ms to minimize.
[2024-05-28 14:05:32] [INFO ] Deduced a trap composed of 261 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:05:32] [INFO ] Deduced a trap composed of 247 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:05:37] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:05:38] [INFO ] Deduced a trap composed of 242 places in 168 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:05:45] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.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 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.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 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:05:53] [INFO ] Deduced a trap composed of 222 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 14:06:12] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60933ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60946ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 776/824 transitions.
Applied a total of 0 rules in 3 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85905 ms. Remains : 456/470 places, 776/824 transitions.
[2024-05-28 14:06:17] [INFO ] Flatten gal took : 18 ms
[2024-05-28 14:06:18] [INFO ] Flatten gal took : 19 ms
[2024-05-28 14:06:18] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 14:06:18] [INFO ] Flatten gal took : 19 ms
[2024-05-28 14:06:18] [INFO ] Flatten gal took : 19 ms
[2024-05-28 14:06:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15827232809885299218.gal : 3 ms
[2024-05-28 14:06:18] [INFO ] Time to serialize properties into /tmp/CTLFireability18286089520682366797.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/CTLFireability15827232809885299218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18286089520682366797.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:06:48] [INFO ] Flatten gal took : 19 ms
[2024-05-28 14:06:48] [INFO ] Applying decomposition
[2024-05-28 14:06:48] [INFO ] Flatten gal took : 19 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/graph16283246628226280632.txt' '-o' '/tmp/graph16283246628226280632.bin' '-w' '/tmp/graph16283246628226280632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16283246628226280632.bin' '-l' '-1' '-v' '-w' '/tmp/graph16283246628226280632.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:06:48] [INFO ] Decomposing Gal with order
[2024-05-28 14:06:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:06:48] [INFO ] Removed a total of 630 redundant transitions.
[2024-05-28 14:06:48] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:06:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 6 ms.
[2024-05-28 14:06:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17383291777604476930.gal : 4 ms
[2024-05-28 14:06:48] [INFO ] Time to serialize properties into /tmp/CTLFireability12909059089434916141.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/CTLFireability17383291777604476930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12909059089434916141.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 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 462 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 456 transition count 812
Applied a total of 26 rules in 12 ms. Remains 456 /470 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:07:18] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:07:18] [INFO ] Invariant cache hit.
[2024-05-28 14:07:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:07:24] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:07:24] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:07:24] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:07:24] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:07:25] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:07:25] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:07:26] [INFO ] Deduced a trap composed of 270 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:07:26] [INFO ] Deduced a trap composed of 286 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:07:27] [INFO ] Deduced a trap composed of 256 places in 157 ms of which 3 ms to minimize.
[2024-05-28 14:07:27] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:07:27] [INFO ] Deduced a trap composed of 268 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:07:27] [INFO ] Deduced a trap composed of 245 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:07:27] [INFO ] Deduced a trap composed of 241 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 288 places in 162 ms of which 3 ms to minimize.
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 232 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 248 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:07:31] [INFO ] Deduced a trap composed of 302 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:07:31] [INFO ] Deduced a trap composed of 278 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:07:32] [INFO ] Deduced a trap composed of 296 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:07:32] [INFO ] Deduced a trap composed of 249 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:07:32] [INFO ] Deduced a trap composed of 261 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:07:32] [INFO ] Deduced a trap composed of 247 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:07:37] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 3 ms to minimize.
[2024-05-28 14:07:38] [INFO ] Deduced a trap composed of 242 places in 155 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 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 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.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 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 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 1.0)
(s220 1.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 1.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 0.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 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 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 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:07:40] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:07:51] [INFO ] Deduced a trap composed of 244 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:07:51] [INFO ] Deduced a trap composed of 288 places in 138 ms of which 3 ms to minimize.
[2024-05-28 14:07:51] [INFO ] Deduced a trap composed of 222 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(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 9)
(s123 1)
(s124 0)
(s125 1)
(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 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(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 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(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 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 9)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 1)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 6)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 40639ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40646ms
[2024-05-28 14:07:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:07:59] [INFO ] Invariant cache hit.
[2024-05-28 14:07:59] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-28 14:07:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:07:59] [INFO ] Invariant cache hit.
[2024-05-28 14:07:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:08:03] [INFO ] Implicit Places using invariants and state equation in 3796 ms returned []
Implicit Place search using SMT with State Equation took 4079 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:08:03] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:08:03] [INFO ] Invariant cache hit.
[2024-05-28 14:08:03] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:08:08] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:08:08] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:08:08] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:08:08] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:08:09] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:08:09] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:08:10] [INFO ] Deduced a trap composed of 270 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 286 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 256 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 268 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 245 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:08:11] [INFO ] Deduced a trap composed of 241 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:08:12] [INFO ] Deduced a trap composed of 288 places in 168 ms of which 2 ms to minimize.
[2024-05-28 14:08:12] [INFO ] Deduced a trap composed of 232 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:08:12] [INFO ] Deduced a trap composed of 248 places in 218 ms of which 2 ms to minimize.
[2024-05-28 14:08:14] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:08:14] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:08:15] [INFO ] Deduced a trap composed of 302 places in 148 ms of which 3 ms to minimize.
[2024-05-28 14:08:15] [INFO ] Deduced a trap composed of 278 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:08:16] [INFO ] Deduced a trap composed of 296 places in 146 ms of which 3 ms to minimize.
[2024-05-28 14:08:16] [INFO ] Deduced a trap composed of 249 places in 160 ms of which 3 ms to minimize.
[2024-05-28 14:08:16] [INFO ] Deduced a trap composed of 261 places in 159 ms of which 2 ms to minimize.
[2024-05-28 14:08:16] [INFO ] Deduced a trap composed of 247 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:08:21] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 242 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:08:30] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:08:39] [INFO ] Deduced a trap composed of 222 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 14:08:57] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60565ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60571ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 776/824 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105315 ms. Remains : 456/470 places, 776/824 transitions.
[2024-05-28 14:09:03] [INFO ] Flatten gal took : 17 ms
[2024-05-28 14:09:03] [INFO ] Flatten gal took : 19 ms
[2024-05-28 14:09:03] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 14:09:03] [INFO ] Flatten gal took : 18 ms
[2024-05-28 14:09:03] [INFO ] Flatten gal took : 18 ms
[2024-05-28 14:09:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3420430666788224078.gal : 3 ms
[2024-05-28 14:09:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16177692940315836043.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/CTLFireability3420430666788224078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16177692940315836043.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 468 transition count 776
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 420 transition count 770
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 414 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 108 place count 414 transition count 722
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 204 place count 366 transition count 722
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 210 place count 360 transition count 716
Iterating global reduction 3 with 6 rules applied. Total rules applied 216 place count 360 transition count 716
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 300 place count 318 transition count 674
Applied a total of 300 rules in 59 ms. Remains 318 /470 variables (removed 152) and now considering 674/824 (removed 150) transitions.
Running 672 sub problems to find dead transitions.
[2024-05-28 14:10:04] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 318 cols
[2024-05-28 14:10:04] [INFO ] Computed 38 invariants in 5 ms
[2024-05-28 14:10:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-28 14:10:07] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:10:07] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:10:07] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:10:07] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:10:07] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:10:08] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:10:08] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:10:08] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:10:08] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 1 ms to minimize.
[2024-05-28 14:10:09] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2024-05-28 14:10:09] [INFO ] Deduced a trap composed of 141 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-28 14:10:12] [INFO ] Deduced a trap composed of 129 places in 134 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/317 variables, 1/49 constraints. Problems are: Problem set: 36 solved, 636 unsolved
[2024-05-28 14:10:20] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/980 variables, and 50 constraints, problems are : Problem set: 36 solved, 636 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 36 solved, 636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 36 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 13/49 constraints. Problems are: Problem set: 36 solved, 636 unsolved
[2024-05-28 14:10:27] [INFO ] Deduced a trap composed of 184 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:10:27] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:10:27] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:10:27] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:10:29] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:10:29] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 6/55 constraints. Problems are: Problem set: 36 solved, 636 unsolved
[2024-05-28 14:10:36] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 1/56 constraints. Problems are: Problem set: 36 solved, 636 unsolved
[2024-05-28 14:10:42] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/980 variables, and 57 constraints, problems are : Problem set: 36 solved, 636 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 21/21 constraints]
After SMT, in 40724ms problems are : Problem set: 36 solved, 636 unsolved
Search for dead transitions found 36 dead transitions in 40733ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
[2024-05-28 14:10:44] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
// Phase 1: matrix 626 rows 318 cols
[2024-05-28 14:10:44] [INFO ] Computed 38 invariants in 6 ms
[2024-05-28 14:10:45] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-28 14:10:45] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
[2024-05-28 14:10:45] [INFO ] Invariant cache hit.
[2024-05-28 14:10:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:10:47] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 2359 ms to find 0 implicit places.
[2024-05-28 14:10:47] [INFO ] Redundant transitions in 5 ms returned []
Starting structural reductions in SI_CTL mode, iteration 1 : 318/470 places, 638/824 transitions.
Applied a total of 0 rules in 15 ms. Remains 318 /318 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43183 ms. Remains : 318/470 places, 638/824 transitions.
[2024-05-28 14:10:47] [INFO ] Flatten gal took : 28 ms
[2024-05-28 14:10:47] [INFO ] Flatten gal took : 26 ms
[2024-05-28 14:10:47] [INFO ] Input system was already deterministic with 638 transitions.
[2024-05-28 14:10:47] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:10:47] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:10:47] [INFO ] Time to serialize gal into /tmp/CTLFireability859801397284175453.gal : 4 ms
[2024-05-28 14:10:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6097210209546660201.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/CTLFireability859801397284175453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6097210209546660201.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 470/470 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 468 transition count 782
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 426 transition count 782
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 84 place count 426 transition count 728
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 192 place count 372 transition count 728
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 198 place count 366 transition count 722
Iterating global reduction 2 with 6 rules applied. Total rules applied 204 place count 366 transition count 722
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 288 place count 324 transition count 680
Applied a total of 288 rules in 33 ms. Remains 324 /470 variables (removed 146) and now considering 680/824 (removed 144) transitions.
Running 678 sub problems to find dead transitions.
[2024-05-28 14:11:47] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2024-05-28 14:11:47] [INFO ] Computed 38 invariants in 19 ms
[2024-05-28 14:11:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 14:11:50] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:11:51] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-28 14:11:51] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:11:51] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:11:51] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:11:51] [INFO ] Deduced a trap composed of 122 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:11:51] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:11:51] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 3 ms to minimize.
[2024-05-28 14:11:51] [INFO ] Deduced a trap composed of 157 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:11:51] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 1 ms to minimize.
[2024-05-28 14:11:52] [INFO ] Deduced a trap composed of 142 places in 155 ms of which 3 ms to minimize.
[2024-05-28 14:11:52] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2024-05-28 14:11:55] [INFO ] Deduced a trap composed of 114 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:11:55] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 14:11:59] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 14:12:05] [INFO ] Deduced a trap composed of 158 places in 113 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 52 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 14:12:09] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:12:10] [INFO ] Deduced a trap composed of 184 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 14:12:17] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 1 ms to minimize.
[2024-05-28 14:12:17] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 14:12:22] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 678 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 322/992 variables, and 57 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 21/21 constraints]
After SMT, in 40595ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 40601ms
[2024-05-28 14:12:28] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-05-28 14:12:28] [INFO ] Invariant cache hit.
[2024-05-28 14:12:28] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-28 14:12:28] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-05-28 14:12:28] [INFO ] Invariant cache hit.
[2024-05-28 14:12:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:12:30] [INFO ] Implicit Places using invariants and state equation in 2038 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
[2024-05-28 14:12:30] [INFO ] Redundant transitions in 4 ms returned []
Running 678 sub problems to find dead transitions.
[2024-05-28 14:12:30] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-05-28 14:12:30] [INFO ] Invariant cache hit.
[2024-05-28 14:12:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 14:12:34] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:12:34] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2024-05-28 14:12:34] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:12:34] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 3 ms to minimize.
[2024-05-28 14:12:34] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:12:34] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 1 ms to minimize.
[2024-05-28 14:12:34] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:12:34] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:12:35] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-28 14:12:37] [INFO ] Deduced a trap composed of 109 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:12:37] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:12:38] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:12:38] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:12:38] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:12:38] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:12:42] [INFO ] Deduced a trap composed of 194 places in 123 ms of which 2 ms to minimize.
[2024-05-28 14:12:42] [INFO ] Deduced a trap composed of 179 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:12:42] [INFO ] Deduced a trap composed of 179 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 612 unsolved
[2024-05-28 14:12:49] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:12:49] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:12:50] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:12:53] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:12:53] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:12:53] [INFO ] Deduced a trap composed of 172 places in 169 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 6/63 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/63 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 8 (OVERLAPS) 668/992 variables, 324/387 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 72/459 constraints. Problems are: Problem set: 66 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 992/992 variables, and 459 constraints, problems are : Problem set: 66 solved, 612 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 324/324 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 66 solved, 612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 26/36 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 19/55 constraints. Problems are: Problem set: 66 solved, 612 unsolved
[2024-05-28 14:13:05] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:13:05] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/57 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/59 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 6/65 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/65 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 8 (OVERLAPS) 668/992 variables, 324/389 constraints. Problems are: Problem set: 66 solved, 612 unsolved
SMT process timed out in 60559ms, After SMT, problems are : Problem set: 66 solved, 612 unsolved
Search for dead transitions found 66 dead transitions in 60565ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 324/470 places, 614/824 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 310 transition count 590
Applied a total of 12 rules in 19 ms. Remains 310 /324 variables (removed 14) and now considering 590/614 (removed 24) transitions.
[2024-05-28 14:13:31] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
// Phase 1: matrix 578 rows 310 cols
[2024-05-28 14:13:31] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 14:13:31] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-28 14:13:31] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 14:13:31] [INFO ] Invariant cache hit.
[2024-05-28 14:13:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:13:33] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2259 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 310/470 places, 590/824 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 105767 ms. Remains : 310/470 places, 590/824 transitions.
[2024-05-28 14:13:33] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:13:33] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:13:33] [INFO ] Input system was already deterministic with 590 transitions.
[2024-05-28 14:13:33] [INFO ] Flatten gal took : 20 ms
[2024-05-28 14:13:33] [INFO ] Flatten gal took : 20 ms
[2024-05-28 14:13:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3128213505812843789.gal : 3 ms
[2024-05-28 14:13:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6576871389409176597.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/CTLFireability3128213505812843789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6576871389409176597.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:14:03] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:14:03] [INFO ] Applying decomposition
[2024-05-28 14:14:03] [INFO ] Flatten gal took : 29 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/graph4162203160419520193.txt' '-o' '/tmp/graph4162203160419520193.bin' '-w' '/tmp/graph4162203160419520193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4162203160419520193.bin' '-l' '-1' '-v' '-w' '/tmp/graph4162203160419520193.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:14:03] [INFO ] Decomposing Gal with order
[2024-05-28 14:14:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:14:03] [INFO ] Removed a total of 553 redundant transitions.
[2024-05-28 14:14:03] [INFO ] Flatten gal took : 48 ms
[2024-05-28 14:14:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 5 ms.
[2024-05-28 14:14:03] [INFO ] Time to serialize gal into /tmp/CTLFireability18121659457047625599.gal : 4 ms
[2024-05-28 14:14:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15475569883682361969.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/CTLFireability18121659457047625599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15475569883682361969.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:14:34] [INFO ] Flatten gal took : 45 ms
[2024-05-28 14:14:34] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:14:34] [INFO ] Applying decomposition
[2024-05-28 14:14:34] [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/graph1027289709834832261.txt' '-o' '/tmp/graph1027289709834832261.bin' '-w' '/tmp/graph1027289709834832261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1027289709834832261.bin' '-l' '-1' '-v' '-w' '/tmp/graph1027289709834832261.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:14:34] [INFO ] Decomposing Gal with order
[2024-05-28 14:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:14:34] [INFO ] Removed a total of 630 redundant transitions.
[2024-05-28 14:14:34] [INFO ] Flatten gal took : 63 ms
[2024-05-28 14:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 6 ms.
[2024-05-28 14:14:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2490976236052384562.gal : 6 ms
[2024-05-28 14:14:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15055714999767097652.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2490976236052384562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15055714999767097652.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.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T06"
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-S02J04T06, 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-171654446300074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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