Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 184K Jun 2 16:33 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 MedleyA-PT-19-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717381323652

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-03 02:22:06] [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-06-03 02:22:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 02:22:06] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-06-03 02:22:06] [INFO ] Transformed 272 places.
[2024-06-03 02:22:06] [INFO ] Transformed 586 transitions.
[2024-06-03 02:22:06] [INFO ] Found NUPN structural information;
[2024-06-03 02:22:06] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 493 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 3 transitions.
Support contains 96 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 63 place count 206 transition count 515
Iterating global reduction 1 with 61 rules applied. Total rules applied 124 place count 206 transition count 515
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 204 transition count 511
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 204 transition count 511
Applied a total of 128 rules in 126 ms. Remains 204 /269 variables (removed 65) and now considering 511/583 (removed 72) transitions.
// Phase 1: matrix 511 rows 204 cols
[2024-06-03 02:22:07] [INFO ] Computed 22 invariants in 42 ms
[2024-06-03 02:22:07] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-06-03 02:22:07] [INFO ] Invariant cache hit.
[2024-06-03 02:22:08] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2024-06-03 02:22:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 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 TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD485 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/204 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-03 02:22:20] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 35 ms to minimize.
[2024-06-03 02:22:20] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 3 ms to minimize.
[2024-06-03 02:22:20] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 3 ms to minimize.
[2024-06-03 02:22:20] [INFO ] Deduced a trap composed of 40 places in 296 ms of which 4 ms to minimize.
[2024-06-03 02:22:21] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
[2024-06-03 02:22:21] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-06-03 02:22:21] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-06-03 02:22:22] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-06-03 02:22:22] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-06-03 02:22:22] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 3 ms to minimize.
[2024-06-03 02:22:22] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2024-06-03 02:22:23] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-03 02:22:23] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 3 ms to minimize.
[2024-06-03 02:22:23] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 2 ms to minimize.
[2024-06-03 02:22:23] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-06-03 02:22:24] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-06-03 02:22:24] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 17/39 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-03 02:22:30] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2024-06-03 02:22:30] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-03 02:22:30] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 3/42 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-03 02:22:33] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/43 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-03 02:22:37] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/44 constraints. Problems are: Problem set: 120 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/715 variables, and 44 constraints, problems are : Problem set: 120 solved, 390 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 120 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 16/16 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/16 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/204 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 22/44 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/44 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 5 (OVERLAPS) 511/715 variables, 204/248 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 390/638 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-03 02:22:54] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 3 ms to minimize.
[2024-06-03 02:22:55] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 3 ms to minimize.
[2024-06-03 02:22:55] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 2 ms to minimize.
[2024-06-03 02:22:55] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-06-03 02:22:55] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-06-03 02:22:57] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
[2024-06-03 02:22:58] [INFO ] Deduced a trap composed of 49 places in 277 ms of which 4 ms to minimize.
[2024-06-03 02:23:00] [INFO ] Deduced a trap composed of 42 places in 323 ms of which 3 ms to minimize.
[2024-06-03 02:23:00] [INFO ] Deduced a trap composed of 49 places in 333 ms of which 3 ms to minimize.
[2024-06-03 02:23:01] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 3 ms to minimize.
[2024-06-03 02:23:02] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 2 ms to minimize.
[2024-06-03 02:23:02] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 12/650 constraints. Problems are: Problem set: 120 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 715/715 variables, and 650 constraints, problems are : Problem set: 120 solved, 390 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 390/510 constraints, Known Traps: 34/34 constraints]
After SMT, in 62519ms problems are : Problem set: 120 solved, 390 unsolved
Search for dead transitions found 120 dead transitions in 62578ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 204/269 places, 391/583 transitions.
Applied a total of 0 rules in 8 ms. Remains 204 /204 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63985 ms. Remains : 204/269 places, 391/583 transitions.
Support contains 96 out of 204 places after structural reductions.
[2024-06-03 02:23:11] [INFO ] Flatten gal took : 120 ms
[2024-06-03 02:23:11] [INFO ] Flatten gal took : 72 ms
[2024-06-03 02:23:11] [INFO ] Input system was already deterministic with 391 transitions.
Support contains 95 out of 204 places (down from 96) after GAL structural reductions.
RANDOM walk for 40000 steps (11 resets) in 2680 ms. (14 steps per ms) remains 58/83 properties
BEST_FIRST walk for 4004 steps (12 resets) in 38 ms. (102 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4004 steps (10 resets) in 31 ms. (125 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4002 steps (11 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (13 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (12 resets) in 34 ms. (114 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4002 steps (10 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (14 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (13 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 45 ms. (87 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (12 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (13 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (11 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (13 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (13 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (10 resets) in 14 ms. (266 steps per ms) remains 51/54 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
// Phase 1: matrix 391 rows 204 cols
[2024-06-03 02:23:13] [INFO ] Computed 22 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/129 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 46 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 3 (OVERLAPS) 63/192 variables, 16/22 constraints. Problems are: Problem set: 11 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 383/575 variables, 192/214 constraints. Problems are: Problem set: 11 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 0/214 constraints. Problems are: Problem set: 11 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 13/588 variables, 8/222 constraints. Problems are: Problem set: 11 solved, 39 unsolved
[2024-06-03 02:23:15] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 4 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 1/223 constraints. Problems are: Problem set: 12 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 0/223 constraints. Problems are: Problem set: 12 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 7/595 variables, 4/227 constraints. Problems are: Problem set: 12 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/595 variables, 0/227 constraints. Problems are: Problem set: 12 solved, 38 unsolved
[2024-06-03 02:23:17] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/595 variables, 1/228 constraints. Problems are: Problem set: 12 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/595 variables, 0/228 constraints. Problems are: Problem set: 12 solved, 38 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 595/595 variables, and 228 constraints, problems are : Problem set: 12 solved, 38 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 12 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 38 unsolved
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/125 variables, 6/6 constraints. Problems are: Problem set: 15 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 15 solved, 35 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 3 (OVERLAPS) 67/192 variables, 16/22 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 2/24 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-03 02:23:19] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/25 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-03 02:23:19] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/26 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-03 02:23:20] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-06-03 02:23:20] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 2/28 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-03 02:23:20] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/29 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/29 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 383/575 variables, 192/221 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 11/232 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-03 02:23:21] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-06-03 02:23:21] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 2/234 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-03 02:23:22] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-03 02:23:22] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/575 variables, 2/236 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 0/236 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 13/588 variables, 8/244 constraints. Problems are: Problem set: 17 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/595 variables, and 266 constraints, problems are : Problem set: 17 solved, 33 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 200/204 constraints, PredecessorRefiner: 33/50 constraints, Known Traps: 11/11 constraints]
After SMT, in 10341ms problems are : Problem set: 17 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 391/391 transitions.
Graph (complete) has 703 edges and 204 vertex of which 202 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 202 transition count 372
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 186 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 185 transition count 371
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 36 place count 185 transition count 362
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 54 place count 176 transition count 362
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 68 place count 162 transition count 341
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 162 transition count 341
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 116 place count 145 transition count 324
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 141 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 135 place count 141 transition count 334
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 141 transition count 332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 139 transition count 332
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 146 place count 139 transition count 325
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 153 place count 132 transition count 325
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 155 place count 132 transition count 323
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 157 place count 130 transition count 323
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 173 place count 130 transition count 323
Applied a total of 173 rules in 230 ms. Remains 130 /204 variables (removed 74) and now considering 323/391 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 130/204 places, 323/391 transitions.
RANDOM walk for 40000 steps (15 resets) in 779 ms. (51 steps per ms) remains 28/33 properties
BEST_FIRST walk for 4003 steps (15 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (10 resets) in 43 ms. (90 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (16 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (18 resets) in 70 ms. (56 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4001 steps (14 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (17 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (13 resets) in 139 ms. (28 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (14 resets) in 20 ms. (190 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4001 steps (17 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (19 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (15 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (11 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (17 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (15 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (12 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (13 resets) in 18 ms. (210 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (14 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
// Phase 1: matrix 323 rows 130 cols
[2024-06-03 02:23:24] [INFO ] Computed 23 invariants in 3 ms
[2024-06-03 02:23:24] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 34/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 46/126 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 3/129 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 323/452 variables, 129/152 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 1/453 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/453 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 162 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1558 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 34/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 46/126 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 3/129 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 323/452 variables, 129/152 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 1/453 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 18/186 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-03 02:23:27] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 0/453 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 187 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4651 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints]
After SMT, in 6282ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 21 properties in 14684 ms.
Support contains 7 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 323/323 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 130 transition count 315
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 122 transition count 315
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 122 transition count 311
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 118 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 116 transition count 309
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 116 transition count 309
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 60 place count 99 transition count 294
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 99 transition count 292
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 95 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 78 place count 95 transition count 299
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 85 place count 95 transition count 292
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 93 place count 88 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 88 transition count 290
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 107 place count 88 transition count 499
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 153 place count 75 transition count 466
Applied a total of 153 rules in 120 ms. Remains 75 /130 variables (removed 55) and now considering 466/323 (removed -143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 75/130 places, 466/323 transitions.
RANDOM walk for 39382 steps (4049 resets) in 401 ms. (97 steps per ms) remains 0/3 properties
Successfully simplified 17 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-19-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 02:23:46] [INFO ] Flatten gal took : 44 ms
[2024-06-03 02:23:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-19-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 02:23:46] [INFO ] Flatten gal took : 33 ms
[2024-06-03 02:23:46] [INFO ] Input system was already deterministic with 391 transitions.
Support contains 77 out of 204 places (down from 86) after GAL structural reductions.
Computed a total of 21 stabilizing places and 22 stable transitions
Graph (complete) has 703 edges and 204 vertex of which 202 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 188 transition count 373
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 188 transition count 373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 187 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 187 transition count 371
Applied a total of 34 rules in 10 ms. Remains 187 /204 variables (removed 17) and now considering 371/391 (removed 20) transitions.
// Phase 1: matrix 371 rows 187 cols
[2024-06-03 02:23:46] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 02:23:46] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-03 02:23:46] [INFO ] Invariant cache hit.
[2024-06-03 02:23:46] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-03 02:23:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-03 02:23:51] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2024-06-03 02:23:52] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-06-03 02:23:52] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-06-03 02:23:52] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-06-03 02:23:52] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 3 ms to minimize.
[2024-06-03 02:23:52] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-03 02:23:52] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-03 02:23:53] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-03 02:23:53] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-03 02:23:53] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-06-03 02:23:54] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-06-03 02:23:54] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 371/558 variables, 187/221 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-03 02:24:02] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 3 ms to minimize.
[2024-06-03 02:24:02] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 14 ms to minimize.
[2024-06-03 02:24:02] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-06-03 02:24:02] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-03 02:24:03] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-03 02:24:03] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-06-03 02:24:03] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2024-06-03 02:24:04] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-06-03 02:24:04] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-06-03 02:24:04] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-06-03 02:24:04] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 11/232 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-03 02:24:14] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/558 variables, and 233 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 371/558 variables, 187/233 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 370/603 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-03 02:24:28] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2024-06-03 02:24:31] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 605 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 26/26 constraints]
After SMT, in 60452ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60457ms
Starting structural reductions in LTL mode, iteration 1 : 187/204 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60827 ms. Remains : 187/204 places, 371/391 transitions.
[2024-06-03 02:24:47] [INFO ] Flatten gal took : 42 ms
[2024-06-03 02:24:47] [INFO ] Flatten gal took : 43 ms
[2024-06-03 02:24:47] [INFO ] Input system was already deterministic with 371 transitions.
[2024-06-03 02:24:47] [INFO ] Flatten gal took : 37 ms
[2024-06-03 02:24:47] [INFO ] Flatten gal took : 37 ms
[2024-06-03 02:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14767216944041805992.gal : 32 ms
[2024-06-03 02:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8042045325460068579.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/CTLFireability14767216944041805992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8042045325460068579.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-06-03 02:25:17] [INFO ] Flatten gal took : 30 ms
[2024-06-03 02:25:17] [INFO ] Applying decomposition
[2024-06-03 02:25:17] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph957885343935375026.txt' '-o' '/tmp/graph957885343935375026.bin' '-w' '/tmp/graph957885343935375026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph957885343935375026.bin' '-l' '-1' '-v' '-w' '/tmp/graph957885343935375026.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:25:17] [INFO ] Decomposing Gal with order
[2024-06-03 02:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:25:17] [INFO ] Removed a total of 464 redundant transitions.
[2024-06-03 02:25:18] [INFO ] Flatten gal took : 153 ms
[2024-06-03 02:25:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 29 ms.
[2024-06-03 02:25:18] [INFO ] Time to serialize gal into /tmp/CTLFireability11158229956944975374.gal : 15 ms
[2024-06-03 02:25:18] [INFO ] Time to serialize properties into /tmp/CTLFireability13932843466441117288.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11158229956944975374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13932843466441117288.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.05767e+11,1.57234,36032,1796,561,54392,9329,507,141551,209,40043,0


Converting to forward existential form...Done !
original formula: (AG(AX((((i3.u4.p26!=1)||(i2.u10.p35!=1))||(i3.u16.p65!=1)))) * E(!(EG((((u21.p145==1)||(i0.i2.u19.p82==1))||((((u21.p104==1)&&(i6.u24.p1...456
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !((((i3.u4.p26!=1)||(i2.u10.p35!=1))||(i3.u16.p65!=1))))] = FALSE * [(Init * !(E(!(EG((...538
Reverse transition relation is NOT exact ! Due to transitions t9, t29, t79, t128, u21.t78, u21.t80, u21.t82, u21.t83, u21.t85, u21.t86, u21.t87, u21.t89, u...1055
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 185 transition count 367
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 365
Applied a total of 40 rules in 12 ms. Remains 184 /204 variables (removed 20) and now considering 365/391 (removed 26) transitions.
// Phase 1: matrix 365 rows 184 cols
[2024-06-03 02:25:48] [INFO ] Computed 22 invariants in 5 ms
[2024-06-03 02:25:48] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-03 02:25:48] [INFO ] Invariant cache hit.
[2024-06-03 02:25:48] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-03 02:25:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:25:54] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 2 ms to minimize.
[2024-06-03 02:25:54] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 6 ms to minimize.
[2024-06-03 02:25:54] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-06-03 02:25:55] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-06-03 02:25:55] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-06-03 02:25:55] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-06-03 02:25:55] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-03 02:25:55] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-03 02:25:56] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-06-03 02:25:56] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-03 02:25:56] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-03 02:25:56] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:26:05] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 3 ms to minimize.
[2024-06-03 02:26:05] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 3 ms to minimize.
[2024-06-03 02:26:05] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 3 ms to minimize.
[2024-06-03 02:26:05] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-03 02:26:06] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-06-03 02:26:06] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-03 02:26:06] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-03 02:26:07] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 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 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:26:45] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-06-03 02:26:45] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 60508ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Starting structural reductions in LTL mode, iteration 1 : 184/204 places, 365/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60983 ms. Remains : 184/204 places, 365/391 transitions.
[2024-06-03 02:26:49] [INFO ] Flatten gal took : 15 ms
[2024-06-03 02:26:49] [INFO ] Flatten gal took : 15 ms
[2024-06-03 02:26:49] [INFO ] Input system was already deterministic with 365 transitions.
[2024-06-03 02:26:49] [INFO ] Flatten gal took : 14 ms
[2024-06-03 02:26:49] [INFO ] Flatten gal took : 15 ms
[2024-06-03 02:26:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16878687627779583063.gal : 4 ms
[2024-06-03 02:26:49] [INFO ] Time to serialize properties into /tmp/CTLFireability418205726619914068.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/CTLFireability16878687627779583063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability418205726619914068.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-06-03 02:27:19] [INFO ] Flatten gal took : 15 ms
[2024-06-03 02:27:19] [INFO ] Applying decomposition
[2024-06-03 02:27:19] [INFO ] Flatten gal took : 15 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/graph5070258348478972252.txt' '-o' '/tmp/graph5070258348478972252.bin' '-w' '/tmp/graph5070258348478972252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5070258348478972252.bin' '-l' '-1' '-v' '-w' '/tmp/graph5070258348478972252.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:27:19] [INFO ] Decomposing Gal with order
[2024-06-03 02:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:27:19] [INFO ] Removed a total of 680 redundant transitions.
[2024-06-03 02:27:19] [INFO ] Flatten gal took : 44 ms
[2024-06-03 02:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 13 ms.
[2024-06-03 02:27:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9547068153633423396.gal : 5 ms
[2024-06-03 02:27:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11717132364132175413.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/CTLFireability9547068153633423396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11717132364132175413.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.64709e+11,0.540647,18840,1182,51,35803,500,555,52312,67,2237,0


Converting to forward existential form...Done !
original formula: AX(EF((((i6.i0.u21.p104==1)&&(i5.u31.p134==1))&&((i10.u39.p182==1)&&(i10.u50.p234==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((i6.i0.u21.p104==1)&&(i5.u31.p134==1))&&((i10.u39.p182==1)&&(i10.u50.p234==1))))))] = ...160
Reverse transition relation is NOT exact ! Due to transitions t29, t77, t124, i0.t137, i0.t132, i0.i0.u3.t161, i0.i0.u48.t52, i0.i1.t123, i0.i1.t131, i0.i1...931
(forward)formula 0,1,1.31432,39168,1,0,88921,541,3275,128876,290,2237,198225
FORMULA MedleyA-PT-19-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 11 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-03 02:27:20] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 02:27:21] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-03 02:27:21] [INFO ] Invariant cache hit.
[2024-06-03 02:27:21] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-03 02:27:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:27:27] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-06-03 02:27:27] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-03 02:27:27] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-06-03 02:27:27] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-06-03 02:27:27] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-06-03 02:27:27] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-03 02:27:28] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-03 02:27:28] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-03 02:27:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-03 02:27:28] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-06-03 02:27:28] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/218 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:27:35] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 4 ms to minimize.
[2024-06-03 02:27:35] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-06-03 02:27:35] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-03 02:27:36] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-03 02:27:36] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-03 02:27:36] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 4 ms to minimize.
[2024-06-03 02:27:36] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 225 constraints, problems are : Problem set: 0 solved, 365 unsolved in 28648 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/225 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/590 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:28:02] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:28:18] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-06-03 02:28:19] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-06-03 02:28:19] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-06-03 02:28:20] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 59165ms, After SMT, problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 59170ms
Starting structural reductions in LTL mode, iteration 1 : 185/204 places, 366/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59538 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-03 02:28:20] [INFO ] Flatten gal took : 23 ms
[2024-06-03 02:28:20] [INFO ] Flatten gal took : 22 ms
[2024-06-03 02:28:20] [INFO ] Input system was already deterministic with 366 transitions.
[2024-06-03 02:28:20] [INFO ] Flatten gal took : 23 ms
[2024-06-03 02:28:20] [INFO ] Flatten gal took : 23 ms
[2024-06-03 02:28:20] [INFO ] Time to serialize gal into /tmp/CTLFireability395225233532816458.gal : 5 ms
[2024-06-03 02:28:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11797648723013514857.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/CTLFireability395225233532816458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11797648723013514857.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-06-03 02:28:50] [INFO ] Flatten gal took : 12 ms
[2024-06-03 02:28:50] [INFO ] Applying decomposition
[2024-06-03 02:28:50] [INFO ] Flatten gal took : 12 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/graph12438392558687285697.txt' '-o' '/tmp/graph12438392558687285697.bin' '-w' '/tmp/graph12438392558687285697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12438392558687285697.bin' '-l' '-1' '-v' '-w' '/tmp/graph12438392558687285697.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:28:50] [INFO ] Decomposing Gal with order
[2024-06-03 02:28:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:28:50] [INFO ] Removed a total of 683 redundant transitions.
[2024-06-03 02:28:50] [INFO ] Flatten gal took : 31 ms
[2024-06-03 02:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 12 ms.
[2024-06-03 02:28:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1045376702385940921.gal : 4 ms
[2024-06-03 02:28:50] [INFO ] Time to serialize properties into /tmp/CTLFireability11760187846459653590.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/CTLFireability1045376702385940921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11760187846459653590.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.65417e+11,0.813153,27308,1321,40,53457,664,570,92087,55,3229,0


Converting to forward existential form...Done !
original formula: (EG((((i4.i0.u21.p104==0)||(i6.u31.p134==0))||((i9.u39.p182==0)||(i9.u50.p234==0)))) + E(EG((i5.u20.p93!=1)) U AF(EX(AG((((i1.i0.u3.p26==...200
=> equivalent forward existential formula: ([FwdG(Init,(((i4.i0.u21.p104==0)||(i6.u31.p134==0))||((i9.u39.p182==0)||(i9.u50.p234==0))))] != FALSE + [(FwdU(...282
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,8.03576,212108,1,0,397713,723,2248,953373,204,3559,557367
FORMULA MedleyA-PT-19-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 203 transition count 363
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 58 place count 176 transition count 359
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 174 transition count 358
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 173 transition count 357
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 63 place count 173 transition count 351
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 75 place count 167 transition count 351
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 92 place count 150 transition count 327
Iterating global reduction 4 with 17 rules applied. Total rules applied 109 place count 150 transition count 327
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 149 transition count 325
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 149 transition count 325
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 37 rules applied. Total rules applied 148 place count 130 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 130 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 128 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 127 transition count 302
Applied a total of 155 rules in 101 ms. Remains 127 /204 variables (removed 77) and now considering 302/391 (removed 89) transitions.
// Phase 1: matrix 302 rows 127 cols
[2024-06-03 02:28:59] [INFO ] Computed 21 invariants in 2 ms
[2024-06-03 02:28:59] [INFO ] Implicit Places using invariants in 106 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 126/204 places, 302/391 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 226 ms. Remains : 126/204 places, 302/391 transitions.
[2024-06-03 02:28:59] [INFO ] Flatten gal took : 24 ms
[2024-06-03 02:28:59] [INFO ] Flatten gal took : 28 ms
[2024-06-03 02:28:59] [INFO ] Input system was already deterministic with 302 transitions.
[2024-06-03 02:28:59] [INFO ] Flatten gal took : 30 ms
[2024-06-03 02:28:59] [INFO ] Flatten gal took : 28 ms
[2024-06-03 02:28:59] [INFO ] Time to serialize gal into /tmp/CTLFireability6167275146661724644.gal : 5 ms
[2024-06-03 02:28:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5563772151042318157.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/CTLFireability6167275146661724644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5563772151042318157.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-06-03 02:29:29] [INFO ] Flatten gal took : 29 ms
[2024-06-03 02:29:29] [INFO ] Applying decomposition
[2024-06-03 02:29:29] [INFO ] Flatten gal took : 15 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/graph8454994609734226531.txt' '-o' '/tmp/graph8454994609734226531.bin' '-w' '/tmp/graph8454994609734226531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8454994609734226531.bin' '-l' '-1' '-v' '-w' '/tmp/graph8454994609734226531.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:29:29] [INFO ] Decomposing Gal with order
[2024-06-03 02:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:29:29] [INFO ] Removed a total of 562 redundant transitions.
[2024-06-03 02:29:29] [INFO ] Flatten gal took : 28 ms
[2024-06-03 02:29:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 6 ms.
[2024-06-03 02:29:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4200752582911805430.gal : 3 ms
[2024-06-03 02:29:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15632429512842509851.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/CTLFireability4200752582911805430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15632429512842509851.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.63584e+10,0.562412,14816,655,157,19952,1208,427,47908,114,5532,0


Converting to forward existential form...Done !
original formula: (EF((EG(((i2.u12.p104==0)||(i2.u21.p156==0))) * !(E(!((((i2.u12.p104==1)&&(i3.u13.p113==1))&&(i2.u22.p152==1))) U (((i1.u0.p26==1)&&(i0.u...779
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (EG(((i2.u12.p104==0)||(i2.u21.p156==0))) * !(E(!((((i2.u12.p104==1)&&(i3.u13.p113==1))&&(i...852
Reverse transition relation is NOT exact ! Due to transitions t238, t241, t291, t292, i0.t92, i0.t91, i0.t1, i0.u6.t89, i1.t74, i1.u0.t99, i1.u8.t73, i1.u8...585
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,26.6145,444244,1,0,591228,15111,2805,1.88561e+06,634,137914,592579
FORMULA MedleyA-PT-19-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 188 transition count 370
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 188 transition count 370
Applied a total of 32 rules in 5 ms. Remains 188 /204 variables (removed 16) and now considering 370/391 (removed 21) transitions.
// Phase 1: matrix 370 rows 188 cols
[2024-06-03 02:29:56] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 02:29:56] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-03 02:29:56] [INFO ] Invariant cache hit.
[2024-06-03 02:29:56] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-06-03 02:29:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 02:30:02] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 3 ms to minimize.
[2024-06-03 02:30:02] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
[2024-06-03 02:30:02] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-06-03 02:30:03] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 3 ms to minimize.
[2024-06-03 02:30:03] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-06-03 02:30:03] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-06-03 02:30:03] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2024-06-03 02:30:03] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-06-03 02:30:03] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-03 02:30:04] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-03 02:30:04] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-06-03 02:30:04] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-06-03 02:30:05] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-03 02:30:05] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 02:30:10] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 3 ms to minimize.
[2024-06-03 02:30:10] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-06-03 02:30:10] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 370/558 variables, 188/227 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 02:30:20] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 9 ms to minimize.
[2024-06-03 02:30:20] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 3 ms to minimize.
[2024-06-03 02:30:21] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 3 ms to minimize.
[2024-06-03 02:30:21] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-06-03 02:30:21] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-03 02:30:21] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-06-03 02:30:22] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-03 02:30:22] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 8/235 constraints. Problems are: Problem set: 0 solved, 369 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 558/558 variables, and 235 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/558 variables, 188/235 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 369/604 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 02:30:40] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 3 ms to minimize.
[2024-06-03 02:30:41] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 3 ms to minimize.
[2024-06-03 02:30:41] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
[2024-06-03 02:30:42] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 608 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 29/29 constraints]
After SMT, in 60512ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60516ms
Starting structural reductions in LTL mode, iteration 1 : 188/204 places, 370/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60907 ms. Remains : 188/204 places, 370/391 transitions.
[2024-06-03 02:30:57] [INFO ] Flatten gal took : 19 ms
[2024-06-03 02:30:57] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:30:57] [INFO ] Input system was already deterministic with 370 transitions.
[2024-06-03 02:30:57] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:30:57] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:30:57] [INFO ] Time to serialize gal into /tmp/CTLFireability9805431078129410828.gal : 7 ms
[2024-06-03 02:30:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13180268384196807305.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9805431078129410828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13180268384196807305.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-06-03 02:31:27] [INFO ] Flatten gal took : 13 ms
[2024-06-03 02:31:27] [INFO ] Applying decomposition
[2024-06-03 02:31:27] [INFO ] Flatten gal took : 12 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/graph1030562928423847394.txt' '-o' '/tmp/graph1030562928423847394.bin' '-w' '/tmp/graph1030562928423847394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1030562928423847394.bin' '-l' '-1' '-v' '-w' '/tmp/graph1030562928423847394.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:31:27] [INFO ] Decomposing Gal with order
[2024-06-03 02:31:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:31:27] [INFO ] Removed a total of 689 redundant transitions.
[2024-06-03 02:31:27] [INFO ] Flatten gal took : 29 ms
[2024-06-03 02:31:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 8 ms.
[2024-06-03 02:31:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8133576164185129287.gal : 3 ms
[2024-06-03 02:31:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4571191264978143790.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/CTLFireability8133576164185129287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4571191264978143790.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.93679e+11,1.32847,38680,1349,53,67011,1033,587,192021,67,5277,0


Converting to forward existential form...Done !
original formula: EF((EG((i8.u40.p171==0)) * (E((((A((i9.u53.p219==1) U (((i2.i0.u5.p26==1)&&(i3.u13.p50==1))&&((i8.u40.p172==1)&&(i8.u42.p188==1)))) + (i2...544
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * EG((i8.u40.p171==0))),(((!((E(!((((i2.i0.u5.p26==1)&&(i3.u13.p50==1))&&((i8.u40.p172=...907
Reverse transition relation is NOT exact ! Due to transitions t9, t81, t143, i2.t141, i2.t136, i2.i0.t169, i2.i0.u4.t168, i2.i0.u5.t165, i2.i0.u50.t55, i2....1051
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 7 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-03 02:31:57] [INFO ] Computed 22 invariants in 4 ms
[2024-06-03 02:31:57] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-03 02:31:57] [INFO ] Invariant cache hit.
[2024-06-03 02:31:58] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-03 02:31:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:32:04] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-06-03 02:32:04] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-03 02:32:04] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 3 ms to minimize.
[2024-06-03 02:32:05] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-06-03 02:32:05] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-03 02:32:05] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-06-03 02:32:06] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-03 02:32:06] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-06-03 02:32:06] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-06-03 02:32:06] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:32:14] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 3 ms to minimize.
[2024-06-03 02:32:15] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 3 ms to minimize.
[2024-06-03 02:32:15] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 4 ms to minimize.
[2024-06-03 02:32:15] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-03 02:32:16] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-06-03 02:32:16] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-03 02:32:16] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 224 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/224 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/589 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:32:39] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-06-03 02:32:40] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-03 02:32:41] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-03 02:32:42] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 365 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 551/551 variables, and 593 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints]
After SMT, in 60598ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60603ms
Starting structural reductions in LTL mode, iteration 1 : 185/204 places, 366/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61184 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-03 02:32:58] [INFO ] Flatten gal took : 11 ms
[2024-06-03 02:32:58] [INFO ] Flatten gal took : 11 ms
[2024-06-03 02:32:58] [INFO ] Input system was already deterministic with 366 transitions.
[2024-06-03 02:32:59] [INFO ] Flatten gal took : 11 ms
[2024-06-03 02:32:59] [INFO ] Flatten gal took : 12 ms
[2024-06-03 02:32:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11688026265783482284.gal : 3 ms
[2024-06-03 02:32:59] [INFO ] Time to serialize properties into /tmp/CTLFireability15767319024496385058.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/CTLFireability11688026265783482284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15767319024496385058.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-06-03 02:33:29] [INFO ] Flatten gal took : 12 ms
[2024-06-03 02:33:29] [INFO ] Applying decomposition
[2024-06-03 02:33:29] [INFO ] Flatten gal took : 11 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/graph15226377216212102885.txt' '-o' '/tmp/graph15226377216212102885.bin' '-w' '/tmp/graph15226377216212102885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15226377216212102885.bin' '-l' '-1' '-v' '-w' '/tmp/graph15226377216212102885.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:33:29] [INFO ] Decomposing Gal with order
[2024-06-03 02:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:33:29] [INFO ] Removed a total of 617 redundant transitions.
[2024-06-03 02:33:29] [INFO ] Flatten gal took : 53 ms
[2024-06-03 02:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 8 ms.
[2024-06-03 02:33:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15028173581197646667.gal : 16 ms
[2024-06-03 02:33:29] [INFO ] Time to serialize properties into /tmp/CTLFireability18183087357017732649.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/CTLFireability15028173581197646667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18183087357017732649.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.65439e+11,1.45276,47212,2374,128,93065,2355,567,190744,102,8141,0


Converting to forward existential form...Done !
original formula: AF((AG(((E((i8.i1.u42.p191==1) U (i2.u9.p42==1)) + EX(((i1.u4.p26==1)&&(i1.u18.p78==1)))) + (EG(((i4.u29.p126==1)&&(i4.u30.p129==1))) * (...393
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((E((i8.i1.u42.p191==1) U (i2.u9.p42==1)) + EX(((i1.u4.p26==1)&&(i1.u18.p78==1)))) + ...450
Reverse transition relation is NOT exact ! Due to transitions t44, t77, t124, i0.i3.u56.t18, i0.i3.u56.t19, i1.t137, i1.t135, i1.t132, i1.t131, i1.t123, i1...927
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 185 transition count 367
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 365
Applied a total of 40 rules in 7 ms. Remains 184 /204 variables (removed 20) and now considering 365/391 (removed 26) transitions.
// Phase 1: matrix 365 rows 184 cols
[2024-06-03 02:33:59] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 02:33:59] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-03 02:33:59] [INFO ] Invariant cache hit.
[2024-06-03 02:33:59] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-03 02:33:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:34:05] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 3 ms to minimize.
[2024-06-03 02:34:05] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-06-03 02:34:06] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-06-03 02:34:06] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2024-06-03 02:34:06] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2024-06-03 02:34:06] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-06-03 02:34:06] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-03 02:34:06] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-03 02:34:07] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-06-03 02:34:07] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-06-03 02:34:07] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 2 ms to minimize.
[2024-06-03 02:34:07] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:34:14] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 3 ms to minimize.
[2024-06-03 02:34:14] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 3 ms to minimize.
[2024-06-03 02:34:15] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2024-06-03 02:34:15] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-03 02:34:15] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-03 02:34:15] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-03 02:34:15] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-06-03 02:34:16] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (OVERLAPS) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 28964 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:34:56] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-06-03 02:34:56] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 59578ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 59583ms
Starting structural reductions in LTL mode, iteration 1 : 184/204 places, 365/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59989 ms. Remains : 184/204 places, 365/391 transitions.
[2024-06-03 02:34:59] [INFO ] Flatten gal took : 21 ms
[2024-06-03 02:34:59] [INFO ] Flatten gal took : 19 ms
[2024-06-03 02:34:59] [INFO ] Input system was already deterministic with 365 transitions.
[2024-06-03 02:34:59] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:34:59] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:34:59] [INFO ] Time to serialize gal into /tmp/CTLFireability13624739070826890508.gal : 4 ms
[2024-06-03 02:34:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4791663581156425578.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/CTLFireability13624739070826890508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4791663581156425578.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-06-03 02:35:29] [INFO ] Flatten gal took : 12 ms
[2024-06-03 02:35:29] [INFO ] Applying decomposition
[2024-06-03 02:35:29] [INFO ] Flatten gal took : 11 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/graph9291209248675570995.txt' '-o' '/tmp/graph9291209248675570995.bin' '-w' '/tmp/graph9291209248675570995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9291209248675570995.bin' '-l' '-1' '-v' '-w' '/tmp/graph9291209248675570995.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:35:29] [INFO ] Decomposing Gal with order
[2024-06-03 02:35:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:35:29] [INFO ] Removed a total of 685 redundant transitions.
[2024-06-03 02:35:29] [INFO ] Flatten gal took : 24 ms
[2024-06-03 02:35:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 11 ms.
[2024-06-03 02:35:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16927854542715669987.gal : 3 ms
[2024-06-03 02:35:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4855799599914868060.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/CTLFireability16927854542715669987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4855799599914868060.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.64709e+11,0.732335,25392,1258,44,46944,579,545,90849,62,2364,0


Converting to forward existential form...Done !
original formula: AX(AF((((i1.u3.p26==1)&&(i0.u11.p50==1))&&((i5.u38.p172==1)&&(i5.u40.p188==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((((i1.u3.p26==1)&&(i0.u11.p50==1))&&((i5.u38.p172==1)&&(i5.u40.p188==1)))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,5.53579,145776,1,0,309819,709,2208,572479,204,3393,448946
FORMULA MedleyA-PT-19-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 5 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-03 02:35:35] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 02:35:35] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-03 02:35:35] [INFO ] Invariant cache hit.
[2024-06-03 02:35:35] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-03 02:35:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:35:39] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-03 02:35:40] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-06-03 02:35:40] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-03 02:35:40] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-06-03 02:35:40] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-03 02:35:40] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-03 02:35:40] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-03 02:35:41] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-03 02:35:41] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-03 02:35:41] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-03 02:35:41] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/218 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:35:48] [INFO ] Deduced a trap composed of 14 places in 278 ms of which 4 ms to minimize.
[2024-06-03 02:35:48] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 3 ms to minimize.
[2024-06-03 02:35:48] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 2 ms to minimize.
[2024-06-03 02:35:49] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-06-03 02:35:49] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-03 02:35:49] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2024-06-03 02:35:50] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-06-03 02:35:50] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.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 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.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 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 551/551 variables, and 226 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/591 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:36:18] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-03 02:36:19] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 5 ms to minimize.
[2024-06-03 02:36:19] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-06-03 02:36:20] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:36:29] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 596 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 24/24 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Starting structural reductions in LTL mode, iteration 1 : 185/204 places, 366/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60883 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-03 02:36:36] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:36:36] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:36:36] [INFO ] Input system was already deterministic with 366 transitions.
[2024-06-03 02:36:36] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:36:36] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:36:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10836356434735861862.gal : 4 ms
[2024-06-03 02:36:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5968432070503582008.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/CTLFireability10836356434735861862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5968432070503582008.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-06-03 02:37:06] [INFO ] Flatten gal took : 11 ms
[2024-06-03 02:37:06] [INFO ] Applying decomposition
[2024-06-03 02:37:06] [INFO ] Flatten gal took : 11 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/graph1554744114289189532.txt' '-o' '/tmp/graph1554744114289189532.bin' '-w' '/tmp/graph1554744114289189532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1554744114289189532.bin' '-l' '-1' '-v' '-w' '/tmp/graph1554744114289189532.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:37:06] [INFO ] Decomposing Gal with order
[2024-06-03 02:37:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:37:06] [INFO ] Removed a total of 613 redundant transitions.
[2024-06-03 02:37:06] [INFO ] Flatten gal took : 28 ms
[2024-06-03 02:37:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 6 ms.
[2024-06-03 02:37:06] [INFO ] Time to serialize gal into /tmp/CTLFireability11944325777800119885.gal : 3 ms
[2024-06-03 02:37:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8599949972825693271.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/CTLFireability11944325777800119885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8599949972825693271.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.65439e+11,0.98623,28676,1942,129,52332,1025,562,99350,110,3319,0


Converting to forward existential form...Done !
original formula: (AG(A((((i1.u3.p26==1)&&(i0.u11.p50==1))&&((i6.u37.p182==1)&&(i6.u52.p234==1))) U EF(((i6.u37.p182==1)&&(i6.u51.p231==1))))) * E(EF(EX(AX...303
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(E(TRUE U ((i6.u37.p182==1)&&(i6.u51.p231==1))))) * !((((i1.u3.p26==1)&&(i0.u11.p50==...547
Reverse transition relation is NOT exact ! Due to transitions t44, t77, t125, i0.t151, i0.t149, i0.t140, i0.u6.t159, i0.u6.t160, i0.u7.t157, i0.u7.t158, i0...892
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 185 transition count 367
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 365
Applied a total of 40 rules in 9 ms. Remains 184 /204 variables (removed 20) and now considering 365/391 (removed 26) transitions.
// Phase 1: matrix 365 rows 184 cols
[2024-06-03 02:37:36] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 02:37:36] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-03 02:37:36] [INFO ] Invariant cache hit.
[2024-06-03 02:37:37] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-03 02:37:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:37:42] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-06-03 02:37:42] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2024-06-03 02:37:42] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-06-03 02:37:42] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-06-03 02:37:42] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-06-03 02:37:42] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-03 02:37:42] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-03 02:37:42] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-03 02:37:43] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-03 02:37:43] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-06-03 02:37:43] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-06-03 02:37:44] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:37:50] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 2 ms to minimize.
[2024-06-03 02:37:50] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 2 ms to minimize.
[2024-06-03 02:37:50] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-06-03 02:37:50] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-03 02:37:51] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 4 ms to minimize.
[2024-06-03 02:37:51] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 3 ms to minimize.
[2024-06-03 02:37:51] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-03 02:37:52] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (OVERLAPS) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 28817 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:38:27] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-03 02:38:27] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/549 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 59574ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 59582ms
Starting structural reductions in LTL mode, iteration 1 : 184/204 places, 365/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60045 ms. Remains : 184/204 places, 365/391 transitions.
[2024-06-03 02:38:36] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:38:36] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:38:36] [INFO ] Input system was already deterministic with 365 transitions.
[2024-06-03 02:38:36] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:38:36] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:38:36] [INFO ] Time to serialize gal into /tmp/CTLFireability318873097689366061.gal : 4 ms
[2024-06-03 02:38:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16536304464516875036.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/CTLFireability318873097689366061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16536304464516875036.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-06-03 02:39:06] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:39:06] [INFO ] Applying decomposition
[2024-06-03 02:39:06] [INFO ] Flatten gal took : 11 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/graph11359740470812416695.txt' '-o' '/tmp/graph11359740470812416695.bin' '-w' '/tmp/graph11359740470812416695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11359740470812416695.bin' '-l' '-1' '-v' '-w' '/tmp/graph11359740470812416695.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:39:06] [INFO ] Decomposing Gal with order
[2024-06-03 02:39:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:39:06] [INFO ] Removed a total of 610 redundant transitions.
[2024-06-03 02:39:06] [INFO ] Flatten gal took : 25 ms
[2024-06-03 02:39:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 4 ms.
[2024-06-03 02:39:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10790408834077772444.gal : 3 ms
[2024-06-03 02:39:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6238100319151124790.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/CTLFireability10790408834077772444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6238100319151124790.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.64709e+11,0.577948,20184,1266,157,35840,1377,530,63523,103,4516,0


Converting to forward existential form...Done !
original formula: AG(EX(AX((((i8.u47.p207==0)&&(((i5.i0.u21.p104==0)||(i3.u23.p110==0))||((i5.i0.u54.p238==0)||(i5.i0.u59.p261==0))))&&(((i9.u39.p182==0)||...195
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!((((i8.u47.p207==0)&&(((i5.i0.u21.p104==0)||(i3.u23.p110==0))||((i5.i0.u54.p238==...255
Reverse transition relation is NOT exact ! Due to transitions t29, t92, t124, i1.t150, i1.t148, i1.t139, i1.u6.t158, i1.u6.t159, i1.u7.t156, i1.u7.t157, i1...892
(forward)formula 0,0,1.65915,49488,1,0,89515,4685,2669,253121,483,20339,157830
FORMULA MedleyA-PT-19-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 185 transition count 367
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 365
Applied a total of 40 rules in 5 ms. Remains 184 /204 variables (removed 20) and now considering 365/391 (removed 26) transitions.
[2024-06-03 02:39:08] [INFO ] Invariant cache hit.
[2024-06-03 02:39:08] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-03 02:39:08] [INFO ] Invariant cache hit.
[2024-06-03 02:39:09] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-03 02:39:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:39:15] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 3 ms to minimize.
[2024-06-03 02:39:15] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 2 ms to minimize.
[2024-06-03 02:39:15] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-06-03 02:39:15] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-06-03 02:39:15] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-06-03 02:39:15] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-06-03 02:39:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-03 02:39:16] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-06-03 02:39:16] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-03 02:39:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-03 02:39:17] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-03 02:39:17] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:39:24] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 3 ms to minimize.
[2024-06-03 02:39:24] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-06-03 02:39:25] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 2 ms to minimize.
[2024-06-03 02:39:25] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-03 02:39:25] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-06-03 02:39:26] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-06-03 02:39:26] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-03 02:39:26] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 02:40:02] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 4 ms to minimize.
[2024-06-03 02:40:02] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 60520ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60524ms
Starting structural reductions in LTL mode, iteration 1 : 184/204 places, 365/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60903 ms. Remains : 184/204 places, 365/391 transitions.
[2024-06-03 02:40:09] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:40:09] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:40:09] [INFO ] Input system was already deterministic with 365 transitions.
[2024-06-03 02:40:09] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:40:09] [INFO ] Flatten gal took : 31 ms
[2024-06-03 02:40:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3615264530850425465.gal : 4 ms
[2024-06-03 02:40:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7009525263477379952.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/CTLFireability3615264530850425465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7009525263477379952.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-06-03 02:40:39] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:40:39] [INFO ] Applying decomposition
[2024-06-03 02:40:39] [INFO ] Flatten gal took : 17 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/graph8648758024826139818.txt' '-o' '/tmp/graph8648758024826139818.bin' '-w' '/tmp/graph8648758024826139818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8648758024826139818.bin' '-l' '-1' '-v' '-w' '/tmp/graph8648758024826139818.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:40:39] [INFO ] Decomposing Gal with order
[2024-06-03 02:40:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:40:39] [INFO ] Removed a total of 611 redundant transitions.
[2024-06-03 02:40:39] [INFO ] Flatten gal took : 40 ms
[2024-06-03 02:40:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 5 ms.
[2024-06-03 02:40:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5643890141588720890.gal : 5 ms
[2024-06-03 02:40:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7181500272860502128.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/CTLFireability5643890141588720890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7181500272860502128.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.64709e+11,0.747118,21004,1202,118,33974,1778,565,72876,116,5709,0


Converting to forward existential form...Done !
original formula: EG(E(EF((AG((i1.u9.p45==1)) + (((i5.u20.p104==1)&&(i4.u30.p134==1))&&((i6.u36.p172==1)&&(i6.u39.p188==1))))) U EX(((i4.u29.p133==1)&&(i4....171
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (!(E(TRUE U !((i1.u9.p45==1)))) + (((i5.u20.p104==1)&&(i4.u30.p134==1))&&((i6.u36.p172==1)...232
Reverse transition relation is NOT exact ! Due to transitions t44, t77, t124, i0.u52.t20, i0.u52.t234, i1.t150, i1.t148, i1.t139, i1.u6.t158, i1.u6.t159, i...863
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 6 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-03 02:41:09] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 02:41:10] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-03 02:41:10] [INFO ] Invariant cache hit.
[2024-06-03 02:41:10] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-03 02:41:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:41:14] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-03 02:41:14] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-06-03 02:41:15] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-03 02:41:15] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-06-03 02:41:15] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-06-03 02:41:15] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-06-03 02:41:15] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-03 02:41:15] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-03 02:41:16] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-03 02:41:16] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-06-03 02:41:16] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-03 02:41:16] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/219 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:41:22] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-06-03 02:41:22] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 2 ms to minimize.
[2024-06-03 02:41:22] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2024-06-03 02:41:22] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-06-03 02:41:22] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-06-03 02:41:22] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-03 02:41:23] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2024-06-03 02:41:23] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-03 02:41:24] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-03 02:41:24] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 10/229 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 229 constraints, problems are : Problem set: 0 solved, 365 unsolved in 28539 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/229 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/594 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:41:49] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-03 02:41:50] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 596 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 24/24 constraints]
After SMT, in 58993ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 58997ms
Starting structural reductions in LTL mode, iteration 1 : 185/204 places, 366/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59383 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-03 02:42:09] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:42:09] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:42:09] [INFO ] Input system was already deterministic with 366 transitions.
[2024-06-03 02:42:09] [INFO ] Flatten gal took : 11 ms
[2024-06-03 02:42:09] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:42:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6442399047534736522.gal : 3 ms
[2024-06-03 02:42:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12501397360914408873.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/CTLFireability6442399047534736522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12501397360914408873.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-06-03 02:42:39] [INFO ] Flatten gal took : 11 ms
[2024-06-03 02:42:39] [INFO ] Applying decomposition
[2024-06-03 02:42:39] [INFO ] Flatten gal took : 11 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/graph7260041943313526676.txt' '-o' '/tmp/graph7260041943313526676.bin' '-w' '/tmp/graph7260041943313526676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7260041943313526676.bin' '-l' '-1' '-v' '-w' '/tmp/graph7260041943313526676.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:42:39] [INFO ] Decomposing Gal with order
[2024-06-03 02:42:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:42:39] [INFO ] Removed a total of 676 redundant transitions.
[2024-06-03 02:42:39] [INFO ] Flatten gal took : 24 ms
[2024-06-03 02:42:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 4 ms.
[2024-06-03 02:42:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3400104157342659940.gal : 3 ms
[2024-06-03 02:42:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8966636976571464930.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/CTLFireability3400104157342659940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8966636976571464930.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.09334e+11,1.19231,33892,2034,53,67836,1074,603,133049,73,4758,0


Converting to forward existential form...Done !
original formula: (EF((i5.u31.p144==1)) + ((A(((i2.u12.p55==1)&&(i2.u13.p58==1)) U (((i9.i1.u37.p182==1)&&(i8.i1.u43.p191==1))&&(i9.i1.u48.p221==1))) * EF(...274
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (i5.u31.p144==1))] != FALSE + [(EY((Init * (!((E(!((((i9.i1.u37.p182==1)&&(i8.i1.u43.p191==...523
(forward)formula 0,1,1.19826,33892,1,0,67836,1074,607,133049,76,4758,481
FORMULA MedleyA-PT-19-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 6 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-03 02:42:40] [INFO ] Computed 22 invariants in 7 ms
[2024-06-03 02:42:40] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 02:42:40] [INFO ] Invariant cache hit.
[2024-06-03 02:42:41] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-03 02:42:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:42:46] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
[2024-06-03 02:42:46] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-03 02:42:46] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-06-03 02:42:46] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 3 ms to minimize.
[2024-06-03 02:42:46] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-06-03 02:42:46] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-03 02:42:47] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-03 02:42:47] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-03 02:42:47] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-03 02:42:47] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-03 02:42:47] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-03 02:42:47] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/219 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:42:53] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 4 ms to minimize.
[2024-06-03 02:42:53] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 3 ms to minimize.
[2024-06-03 02:42:53] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 4 ms to minimize.
[2024-06-03 02:42:53] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-03 02:42:54] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-06-03 02:42:54] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-06-03 02:42:55] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-06-03 02:42:55] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-03 02:42:55] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 9/228 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:43:06] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/551 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 229 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/229 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/594 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:43:24] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:43:36] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-03 02:43:36] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-03 02:43:37] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 598 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 26/26 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60464ms
Starting structural reductions in LTL mode, iteration 1 : 185/204 places, 366/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60930 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-03 02:43:41] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:43:41] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:43:41] [INFO ] Input system was already deterministic with 366 transitions.
[2024-06-03 02:43:41] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:43:41] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:43:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3807560396430799734.gal : 2 ms
[2024-06-03 02:43:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4229599855803676914.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/CTLFireability3807560396430799734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4229599855803676914.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-06-03 02:44:11] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:44:11] [INFO ] Applying decomposition
[2024-06-03 02:44:11] [INFO ] Flatten gal took : 10 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/graph10481950830654207571.txt' '-o' '/tmp/graph10481950830654207571.bin' '-w' '/tmp/graph10481950830654207571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10481950830654207571.bin' '-l' '-1' '-v' '-w' '/tmp/graph10481950830654207571.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:44:11] [INFO ] Decomposing Gal with order
[2024-06-03 02:44:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:44:11] [INFO ] Removed a total of 679 redundant transitions.
[2024-06-03 02:44:11] [INFO ] Flatten gal took : 22 ms
[2024-06-03 02:44:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 3 ms.
[2024-06-03 02:44:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4877287452447141034.gal : 2 ms
[2024-06-03 02:44:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16481047301442451978.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/CTLFireability4877287452447141034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16481047301442451978.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.84676e+11,0.787027,22544,1661,54,40420,736,556,73733,68,3190,0


Converting to forward existential form...Done !
original formula: !(E(AG((A(((i0.i2.u24.p106==1)||(((i2.i0.u5.p26==1)&&(i9.i0.u6.p32==1))&&((i7.u41.p182==1)&&(i8.u48.p203==1)))) U !((((i7.u41.p182==1)&&(...513
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !((!((E(!(!((((i7.u41.p182==1)&&(i7.u55.p234==1))&&((i9.i2.u56.p238==1)&&(i7.u65.p270==...1433
Reverse transition relation is NOT exact ! Due to transitions t29, t77, t124, i0.i4.u57.t18, i0.i4.u57.t19, i1.t150, i1.t148, i1.t139, i1.u8.t156, i1.u8.t1...988
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,7.22466,161408,1,0,285469,898,3524,703808,297,3190,487388
FORMULA MedleyA-PT-19-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 5 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-03 02:44:19] [INFO ] Computed 22 invariants in 1 ms
[2024-06-03 02:44:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-03 02:44:19] [INFO ] Invariant cache hit.
[2024-06-03 02:44:19] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-03 02:44:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:44:24] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-06-03 02:44:24] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-06-03 02:44:24] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-03 02:44:25] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-06-03 02:44:25] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-06-03 02:44:25] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-03 02:44:25] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-03 02:44:26] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-03 02:44:26] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-03 02:44:26] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-03 02:44:26] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/218 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:44:33] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-06-03 02:44:34] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 2 ms to minimize.
[2024-06-03 02:44:34] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 2 ms to minimize.
[2024-06-03 02:44:34] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-06-03 02:44:34] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-03 02:44:35] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-06-03 02:44:35] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2024-06-03 02:44:36] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 226 constraints, problems are : Problem set: 0 solved, 365 unsolved in 29209 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/591 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:45:02] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-03 02:45:02] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-03 02:45:03] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-06-03 02:45:04] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 02:45:13] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 596 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 24/24 constraints]
After SMT, in 59897ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 59902ms
Starting structural reductions in LTL mode, iteration 1 : 185/204 places, 366/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60324 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-03 02:45:19] [INFO ] Flatten gal took : 18 ms
[2024-06-03 02:45:19] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:45:19] [INFO ] Input system was already deterministic with 366 transitions.
[2024-06-03 02:45:19] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:45:19] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:45:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6821231574652675257.gal : 4 ms
[2024-06-03 02:45:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4621401724844237452.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/CTLFireability6821231574652675257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4621401724844237452.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-06-03 02:45:49] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:45:49] [INFO ] Applying decomposition
[2024-06-03 02:45:49] [INFO ] Flatten gal took : 10 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/graph12416437787753327701.txt' '-o' '/tmp/graph12416437787753327701.bin' '-w' '/tmp/graph12416437787753327701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12416437787753327701.bin' '-l' '-1' '-v' '-w' '/tmp/graph12416437787753327701.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:45:49] [INFO ] Decomposing Gal with order
[2024-06-03 02:45:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:45:49] [INFO ] Removed a total of 674 redundant transitions.
[2024-06-03 02:45:49] [INFO ] Flatten gal took : 35 ms
[2024-06-03 02:45:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 27 ms.
[2024-06-03 02:45:49] [INFO ] Time to serialize gal into /tmp/CTLFireability18425230514343306346.gal : 9 ms
[2024-06-03 02:45:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15240488440884230102.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/CTLFireability18425230514343306346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15240488440884230102.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.65439e+11,1.66907,46016,1461,50,90069,1733,589,190739,69,8799,0


Converting to forward existential form...Done !
original formula: AX(EG((i4.u18.p91==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((i4.u18.p91==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t44, t92, t125, i0.i1.u54.t18, i0.i1.u54.t19, i1.t132, i1.t124, i1.u3.t162, i1.u14.t126, i1.u...965
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Graph (complete) has 703 edges and 204 vertex of which 202 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 201 transition count 356
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 169 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 167 transition count 352
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 71 place count 167 transition count 343
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 89 place count 158 transition count 343
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 108 place count 139 transition count 316
Iterating global reduction 3 with 19 rules applied. Total rules applied 127 place count 139 transition count 316
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 127 place count 139 transition count 314
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 137 transition count 314
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 184 place count 109 transition count 289
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 108 transition count 287
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 108 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 190 place count 108 transition count 283
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 108 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 192 place count 107 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 198 place count 104 transition count 279
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 104 transition count 279
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 103 transition count 278
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 103 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 101 transition count 276
Applied a total of 203 rules in 87 ms. Remains 101 /204 variables (removed 103) and now considering 276/391 (removed 115) transitions.
[2024-06-03 02:46:20] [INFO ] Flow matrix only has 275 transitions (discarded 1 similar events)
// Phase 1: matrix 275 rows 101 cols
[2024-06-03 02:46:20] [INFO ] Computed 19 invariants in 2 ms
[2024-06-03 02:46:20] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-03 02:46:20] [INFO ] Flow matrix only has 275 transitions (discarded 1 similar events)
[2024-06-03 02:46:20] [INFO ] Invariant cache hit.
[2024-06-03 02:46:20] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-03 02:46:20] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-06-03 02:46:20] [INFO ] Redundant transitions in 72 ms returned []
Running 266 sub problems to find dead transitions.
[2024-06-03 02:46:20] [INFO ] Flow matrix only has 275 transitions (discarded 1 similar events)
[2024-06-03 02:46:20] [INFO ] Invariant cache hit.
[2024-06-03 02:46:20] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 4/101 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 274/375 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 28/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 149 constraints, problems are : Problem set: 0 solved, 266 unsolved in 13240 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 4/101 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 274/375 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 28/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 266/414 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 415 constraints, problems are : Problem set: 0 solved, 266 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 33716ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 33719ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/204 places, 276/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34294 ms. Remains : 101/204 places, 276/391 transitions.
[2024-06-03 02:46:54] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:46:54] [INFO ] Flatten gal took : 8 ms
[2024-06-03 02:46:54] [INFO ] Input system was already deterministic with 276 transitions.
[2024-06-03 02:46:54] [INFO ] Flatten gal took : 27 ms
[2024-06-03 02:46:54] [INFO ] Flatten gal took : 26 ms
[2024-06-03 02:46:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3118384074280203916.gal : 3 ms
[2024-06-03 02:46:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6695318189057999467.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3118384074280203916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6695318189057999467.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (3137 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (378 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Finished probabilistic random walk after 1067 steps, run visited all 1 properties in 17 ms. (steps per millisecond=62 )
Probabilistic random walk after 1067 steps, saw 452 distinct states, run finished after 23 ms. (steps per millisecond=46 ) properties seen :1
FORMULA MedleyA-PT-19-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-03 02:46:54] [INFO ] Flatten gal took : 11 ms
[2024-06-03 02:46:54] [INFO ] Flatten gal took : 10 ms
[2024-06-03 02:46:54] [INFO ] Applying decomposition
[2024-06-03 02:46:54] [INFO ] Flatten gal took : 11 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/graph4623651720763118117.txt' '-o' '/tmp/graph4623651720763118117.bin' '-w' '/tmp/graph4623651720763118117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4623651720763118117.bin' '-l' '-1' '-v' '-w' '/tmp/graph4623651720763118117.weights' '-q' '0' '-e' '0.001'
[2024-06-03 02:46:54] [INFO ] Decomposing Gal with order
[2024-06-03 02:46:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:46:54] [INFO ] Removed a total of 461 redundant transitions.
[2024-06-03 02:46:54] [INFO ] Flatten gal took : 25 ms
[2024-06-03 02:46:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 29 ms.
[2024-06-03 02:46:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9326668509404962853.gal : 3 ms
[2024-06-03 02:46:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8310111135758650491.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9326668509404962853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8310111135758650491.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 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86405e+12,10.8604,221908,4038,2546,248532,118351,572,1.12846e+06,261,1.01675e+06,0


Converting to forward existential form...Done !
original formula: (AG(AX((((i1.u4.p26!=1)||(i2.u7.p35!=1))||(i1.u4.p65!=1)))) * E(!(EG((((i3.u18.p145==1)||(i5.i1.u15.p82==1))||((((i3.u18.p104==1)&&(i6.u2...465
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !((((i1.u4.p26!=1)||(i2.u7.p35!=1))||(i1.u4.p65!=1))))] = FALSE * [(Init * !(E(!(EG((((...547
Reverse transition relation is NOT exact ! Due to transitions t88, t141, i0.u2.t186, i1.t190, i1.u3.t188, i1.u3.t189, i1.u4.t140, i1.u4.t142, i1.u4.t143, i...1514
ITS-tools command line returned an error code 139
[2024-06-03 02:51:19] [INFO ] Applying decomposition
[2024-06-03 02:51:19] [INFO ] Flatten gal took : 14 ms
[2024-06-03 02:51:19] [INFO ] Decomposing Gal with order
[2024-06-03 02:51:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 02:51:19] [INFO ] Removed a total of 614 redundant transitions.
[2024-06-03 02:51:19] [INFO ] Flatten gal took : 28 ms
[2024-06-03 02:51:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 6 ms.
[2024-06-03 02:51:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2141184179827848325.gal : 20 ms
[2024-06-03 02:51:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13523716439917533716.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2141184179827848325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13523716439917533716.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 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86405e+12,7.52931,200124,2317,679,368036,8997,568,1.45847e+06,195,106980,0


Converting to forward existential form...Done !
original formula: (AG(AX((((i0.i0.i0.u4.p26!=1)||(i0.i0.i0.i1.i0.u53.p35!=1))||(i0.i0.i0.i1.u11.p65!=1)))) * E(!(EG((((i0.i0.i1.i1.u20.p145==1)||(i0.i0.i1....603
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !((((i0.i0.i0.u4.p26!=1)||(i0.i0.i0.i1.i0.u53.p35!=1))||(i0.i0.i0.i1.u11.p65!=1))))] = ...685
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t182, i0.i0.i0.u4.t183, i0.i0.i0.u4.t184, i0.i0.i0.u4.t185, i0.i0.i0.u4.t186, i0....2624
ITS-tools command line returned an error code 137
[2024-06-03 03:07:45] [INFO ] Flatten gal took : 19 ms
[2024-06-03 03:07:45] [INFO ] Input system was already deterministic with 391 transitions.
[2024-06-03 03:07:45] [INFO ] Transformed 204 places.
[2024-06-03 03:07:45] [INFO ] Transformed 391 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-03 03:07:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15049415705986391714.gal : 3 ms
[2024-06-03 03:07:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2696954784599823238.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/CTLFireability15049415705986391714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2696954784599823238.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

BK_STOP 1717384801339

--------------------
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="MedleyA-PT-19"
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 MedleyA-PT-19, 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 r576-smll-171734920100146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-19.tgz
mv MedleyA-PT-19 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 ;