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-171734920200178.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-23, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920200178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 150K 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-23-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717400264878

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-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-03 07:37:47] [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 07:37:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 07:37:48] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-06-03 07:37:48] [INFO ] Transformed 378 places.
[2024-06-03 07:37:48] [INFO ] Transformed 614 transitions.
[2024-06-03 07:37:48] [INFO ] Found NUPN structural information;
[2024-06-03 07:37:48] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Support contains 132 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 76 place count 302 transition count 541
Iterating global reduction 1 with 73 rules applied. Total rules applied 149 place count 302 transition count 541
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 197 place count 254 transition count 493
Iterating global reduction 1 with 48 rules applied. Total rules applied 245 place count 254 transition count 493
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 253 place count 246 transition count 481
Iterating global reduction 1 with 8 rules applied. Total rules applied 261 place count 246 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 262 place count 245 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 263 place count 245 transition count 478
Applied a total of 263 rules in 179 ms. Remains 245 /378 variables (removed 133) and now considering 478/614 (removed 136) transitions.
// Phase 1: matrix 478 rows 245 cols
[2024-06-03 07:37:48] [INFO ] Computed 8 invariants in 50 ms
[2024-06-03 07:37:49] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-06-03 07:37:49] [INFO ] Invariant cache hit.
[2024-06-03 07:37:49] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-06-03 07:37:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (OVERLAPS) 478/723 variables, 245/253 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-03 07:38:08] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/723 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-03 07:38:20] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 4 ms to minimize.
[2024-06-03 07:38:20] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 3 ms to minimize.
SMT process timed out in 31089ms, After SMT, problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 31150ms
Starting structural reductions in LTL mode, iteration 1 : 245/378 places, 478/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32655 ms. Remains : 245/378 places, 478/614 transitions.
Support contains 132 out of 245 places after structural reductions.
[2024-06-03 07:38:21] [INFO ] Flatten gal took : 159 ms
[2024-06-03 07:38:21] [INFO ] Flatten gal took : 73 ms
[2024-06-03 07:38:21] [INFO ] Input system was already deterministic with 478 transitions.
Support contains 130 out of 245 places (down from 132) after GAL structural reductions.
RANDOM walk for 40000 steps (19 resets) in 4290 ms. (9 steps per ms) remains 45/111 properties
BEST_FIRST walk for 4002 steps (11 resets) in 46 ms. (85 steps per ms) remains 40/45 properties
BEST_FIRST walk for 4002 steps (10 resets) in 55 ms. (71 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4004 steps (15 resets) in 36 ms. (108 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4001 steps (15 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (15 resets) in 60 ms. (65 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 67 ms. (58 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 52 ms. (75 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 38 ms. (102 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4003 steps (14 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (13 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 22 ms. (174 steps per ms) remains 30/33 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (11 resets) in 23 ms. (166 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (12 resets) in 21 ms. (181 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (15 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (14 resets) in 35 ms. (111 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 31 ms. (125 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (17 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (13 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (17 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
[2024-06-03 07:38:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 51/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 353/446 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 230/676 variables, 119/220 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 7 (OVERLAPS) 43/719 variables, 30/250 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/719 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 4/723 variables, 3/253 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/723 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/723 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 723/723 variables, and 253 constraints, problems are : Problem set: 2 solved, 17 unsolved in 1744 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 52/89 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 332/421 variables, 89/97 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 245/666 variables, 116/213 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 17/230 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 52/718 variables, 36/266 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/718 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 10 (OVERLAPS) 5/723 variables, 4/270 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/723 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/723 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 723/723 variables, and 270 constraints, problems are : Problem set: 3 solved, 16 unsolved in 4024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 17/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 5830ms problems are : Problem set: 3 solved, 16 unsolved
Parikh walk visited 13 properties in 10363 ms.
Support contains 12 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 478/478 transitions.
Graph (trivial) has 191 edges and 245 vertex of which 23 / 245 are part of one of the 3 SCC in 5 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 225 transition count 414
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 68 place count 194 transition count 409
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 191 transition count 409
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 71 place count 191 transition count 403
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 83 place count 185 transition count 403
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 122 place count 146 transition count 344
Iterating global reduction 3 with 39 rules applied. Total rules applied 161 place count 146 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 163 place count 146 transition count 342
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 163 place count 146 transition count 338
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 171 place count 142 transition count 338
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 183 place count 130 transition count 303
Iterating global reduction 4 with 12 rules applied. Total rules applied 195 place count 130 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
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 4 with 6 rules applied. Total rules applied 201 place count 130 transition count 297
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 203 place count 129 transition count 296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 204 place count 128 transition count 293
Iterating global reduction 6 with 1 rules applied. Total rules applied 205 place count 128 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 206 place count 128 transition count 292
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 246 place count 108 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 248 place count 108 transition count 270
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 256 place count 100 transition count 246
Iterating global reduction 8 with 8 rules applied. Total rules applied 264 place count 100 transition count 246
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 266 place count 98 transition count 242
Iterating global reduction 8 with 2 rules applied. Total rules applied 268 place count 98 transition count 242
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 270 place count 96 transition count 236
Iterating global reduction 8 with 2 rules applied. Total rules applied 272 place count 96 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 274 place count 96 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 276 place count 95 transition count 233
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 294 place count 86 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 306 place count 86 transition count 236
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 309 place count 83 transition count 227
Iterating global reduction 9 with 3 rules applied. Total rules applied 312 place count 83 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 315 place count 83 transition count 224
Free-agglomeration rule applied 20 times.
Iterating global reduction 10 with 20 rules applied. Total rules applied 335 place count 83 transition count 204
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 355 place count 63 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 356 place count 62 transition count 203
Applied a total of 356 rules in 152 ms. Remains 62 /245 variables (removed 183) and now considering 203/478 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 62/245 places, 203/478 transitions.
RANDOM walk for 40000 steps (15 resets) in 676 ms. (59 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 136 ms. (291 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
[2024-06-03 07:38:40] [INFO ] Flow matrix only has 190 transitions (discarded 13 similar events)
// Phase 1: matrix 190 rows 62 cols
[2024-06-03 07:38:40] [INFO ] Computed 11 invariants in 5 ms
[2024-06-03 07:38:40] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/50 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/62 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 190/252 variables, 62/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/50 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/62 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 190/252 variables, 62/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 358ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 10 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-03 07:38:40] [INFO ] Flatten gal took : 38 ms
[2024-06-03 07:38:40] [INFO ] Flatten gal took : 37 ms
[2024-06-03 07:38:40] [INFO ] Input system was already deterministic with 478 transitions.
Computed a total of 23 stabilizing places and 28 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 203 transition count 420
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 203 transition count 420
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 108 place count 179 transition count 382
Iterating global reduction 0 with 24 rules applied. Total rules applied 132 place count 179 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 134 place count 179 transition count 380
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 145 place count 168 transition count 357
Iterating global reduction 1 with 11 rules applied. Total rules applied 156 place count 168 transition count 357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 159 place count 168 transition count 354
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 165 transition count 346
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 165 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 167 place count 165 transition count 344
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 170 place count 162 transition count 337
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 162 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 176 place count 162 transition count 334
Applied a total of 176 rules in 19 ms. Remains 162 /245 variables (removed 83) and now considering 334/478 (removed 144) transitions.
// Phase 1: matrix 334 rows 162 cols
[2024-06-03 07:38:40] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:38:41] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-03 07:38:41] [INFO ] Invariant cache hit.
[2024-06-03 07:38:41] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-06-03 07:38:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (OVERLAPS) 334/496 variables, 162/170 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-03 07:38:49] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (OVERLAPS) 0/496 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 171 constraints, problems are : Problem set: 0 solved, 333 unsolved in 22234 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 334/496 variables, 162/171 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 333/504 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-03 07:39:11] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-03 07:39:19] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-06-03 07:39:19] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-06-03 07:39:20] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 3 ms to minimize.
[2024-06-03 07:39:20] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 509 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 6/6 constraints]
After SMT, in 52503ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 52509ms
Starting structural reductions in LTL mode, iteration 1 : 162/245 places, 334/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52908 ms. Remains : 162/245 places, 334/478 transitions.
[2024-06-03 07:39:33] [INFO ] Flatten gal took : 32 ms
[2024-06-03 07:39:33] [INFO ] Flatten gal took : 32 ms
[2024-06-03 07:39:33] [INFO ] Input system was already deterministic with 334 transitions.
[2024-06-03 07:39:34] [INFO ] Flatten gal took : 28 ms
[2024-06-03 07:39:34] [INFO ] Flatten gal took : 26 ms
[2024-06-03 07:39:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16503797725561733723.gal : 26 ms
[2024-06-03 07:39:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15601849154160258645.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/CTLFireability16503797725561733723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15601849154160258645.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 07:40:04] [INFO ] Flatten gal took : 18 ms
[2024-06-03 07:40:04] [INFO ] Applying decomposition
[2024-06-03 07:40:04] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3154419449844269324.txt' '-o' '/tmp/graph3154419449844269324.bin' '-w' '/tmp/graph3154419449844269324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3154419449844269324.bin' '-l' '-1' '-v' '-w' '/tmp/graph3154419449844269324.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:40:04] [INFO ] Decomposing Gal with order
[2024-06-03 07:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:40:04] [INFO ] Removed a total of 491 redundant transitions.
[2024-06-03 07:40:04] [INFO ] Flatten gal took : 102 ms
[2024-06-03 07:40:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 12 ms.
[2024-06-03 07:40:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9965639668893118361.gal : 8 ms
[2024-06-03 07:40:04] [INFO ] Time to serialize properties into /tmp/CTLFireability589525314083145142.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/CTLFireability9965639668893118361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability589525314083145142.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.14429e+10,4.14348,100460,2278,50,170511,574,636,371576,81,1662,0


Converting to forward existential form...Done !
original formula: E(AG(AX(((AG((i7.u39.p331==1)) + (i0.u40.p332==1)) + (((i1.u1.p12==1)&&(i1.u5.p30==1))&&((i5.u24.p212==1)&&(i2.u14.p101==1)))))) U (EF((!...546
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,!(E(TRUE U !(!(EX(!(((!(E(TRUE U !((i7.u39.p331==1)))) + (i0.u40.p332==1)) + (((i1.u1.p12==1)...842
Reverse transition relation is NOT exact ! Due to transitions t23, t55, t58, t90, t128, t146, t148, t149, t150, t183, t185, t186, t187, t208, t210, t211, t...877
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 198 transition count 411
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 198 transition count 411
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 119 place count 173 transition count 371
Iterating global reduction 0 with 25 rules applied. Total rules applied 144 place count 173 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 145 place count 173 transition count 370
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 159 place count 159 transition count 343
Iterating global reduction 1 with 14 rules applied. Total rules applied 173 place count 159 transition count 343
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 176 place count 159 transition count 340
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 181 place count 154 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 186 place count 154 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 189 place count 154 transition count 323
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 193 place count 150 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 197 place count 150 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 201 place count 150 transition count 310
Applied a total of 201 rules in 17 ms. Remains 150 /245 variables (removed 95) and now considering 310/478 (removed 168) transitions.
// Phase 1: matrix 310 rows 150 cols
[2024-06-03 07:40:34] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:40:34] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-03 07:40:34] [INFO ] Invariant cache hit.
[2024-06-03 07:40:35] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-03 07:40:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 310/460 variables, 150/158 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-03 07:40:43] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 159 constraints, problems are : Problem set: 0 solved, 309 unsolved in 19888 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/460 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 309/468 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-03 07:41:01] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 5 ms to minimize.
[2024-06-03 07:41:02] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/460 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 470 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 3/3 constraints]
After SMT, in 50105ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 50109ms
Starting structural reductions in LTL mode, iteration 1 : 150/245 places, 310/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50530 ms. Remains : 150/245 places, 310/478 transitions.
[2024-06-03 07:41:25] [INFO ] Flatten gal took : 13 ms
[2024-06-03 07:41:25] [INFO ] Flatten gal took : 13 ms
[2024-06-03 07:41:25] [INFO ] Input system was already deterministic with 310 transitions.
[2024-06-03 07:41:25] [INFO ] Flatten gal took : 14 ms
[2024-06-03 07:41:25] [INFO ] Flatten gal took : 20 ms
[2024-06-03 07:41:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6787745912238065371.gal : 26 ms
[2024-06-03 07:41:25] [INFO ] Time to serialize properties into /tmp/CTLFireability319317665171209050.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/CTLFireability6787745912238065371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability319317665171209050.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:41:55] [INFO ] Flatten gal took : 16 ms
[2024-06-03 07:41:55] [INFO ] Applying decomposition
[2024-06-03 07:41:55] [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/graph1817593497486229502.txt' '-o' '/tmp/graph1817593497486229502.bin' '-w' '/tmp/graph1817593497486229502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1817593497486229502.bin' '-l' '-1' '-v' '-w' '/tmp/graph1817593497486229502.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:41:55] [INFO ] Decomposing Gal with order
[2024-06-03 07:41:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:41:55] [INFO ] Removed a total of 445 redundant transitions.
[2024-06-03 07:41:55] [INFO ] Flatten gal took : 33 ms
[2024-06-03 07:41:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 9 ms.
[2024-06-03 07:41:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18105768324863555856.gal : 6 ms
[2024-06-03 07:41:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10240086368391275593.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/CTLFireability18105768324863555856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10240086368391275593.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.48065e+09,2.72552,61324,1242,41,95946,573,623,211082,70,1567,0


Converting to forward existential form...Done !
original formula: EF(((!(A((i6.u28.p248==1) U EF((i4.u27.p231==1)))) * (i6.u30.p273!=1)) * (((i2.i1.u16.p130!=1)||(i9.u46.p376!=1)) * (EX(((i5.u5.p29==0)||...264
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * (!(!((E(!(E(TRUE U (i4.u27.p231==1))) U (!((i6.u28.p248==1)) * !(E(TRUE U (i4.u27.p231...634
Reverse transition relation is NOT exact ! Due to transitions t19, t54, t137, t139, t140, t173, t175, t176, t197, t199, t200, t205, t206, t207, t209, t210,...839
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 200 transition count 413
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 200 transition count 413
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 115 place count 175 transition count 372
Iterating global reduction 0 with 25 rules applied. Total rules applied 140 place count 175 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 175 transition count 370
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 153 place count 164 transition count 350
Iterating global reduction 1 with 11 rules applied. Total rules applied 164 place count 164 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 166 place count 164 transition count 348
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 169 place count 161 transition count 339
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 161 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 174 place count 161 transition count 337
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 159 transition count 333
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 159 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 180 place count 159 transition count 331
Applied a total of 180 rules in 16 ms. Remains 159 /245 variables (removed 86) and now considering 331/478 (removed 147) transitions.
// Phase 1: matrix 331 rows 159 cols
[2024-06-03 07:42:25] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:42:25] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-03 07:42:25] [INFO ] Invariant cache hit.
[2024-06-03 07:42:26] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-03 07:42:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 331/490 variables, 159/167 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-03 07:42:36] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/490 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 168 constraints, problems are : Problem set: 0 solved, 330 unsolved in 24797 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-03 07:42:54] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 331/490 variables, 159/169 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 330/499 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-03 07:43:10] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 3 ms to minimize.
[2024-06-03 07:43:10] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/490 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 501 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 4/4 constraints]
After SMT, in 55049ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 55059ms
Starting structural reductions in LTL mode, iteration 1 : 159/245 places, 331/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55478 ms. Remains : 159/245 places, 331/478 transitions.
[2024-06-03 07:43:21] [INFO ] Flatten gal took : 18 ms
[2024-06-03 07:43:21] [INFO ] Flatten gal took : 17 ms
[2024-06-03 07:43:21] [INFO ] Input system was already deterministic with 331 transitions.
[2024-06-03 07:43:21] [INFO ] Flatten gal took : 16 ms
[2024-06-03 07:43:21] [INFO ] Flatten gal took : 17 ms
[2024-06-03 07:43:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11162080765926098624.gal : 5 ms
[2024-06-03 07:43:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6879179091081403140.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/CTLFireability11162080765926098624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6879179091081403140.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 07:43:51] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:43:51] [INFO ] Applying decomposition
[2024-06-03 07:43:51] [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/graph9920602843205615476.txt' '-o' '/tmp/graph9920602843205615476.bin' '-w' '/tmp/graph9920602843205615476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9920602843205615476.bin' '-l' '-1' '-v' '-w' '/tmp/graph9920602843205615476.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:43:51] [INFO ] Decomposing Gal with order
[2024-06-03 07:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:43:51] [INFO ] Removed a total of 482 redundant transitions.
[2024-06-03 07:43:51] [INFO ] Flatten gal took : 33 ms
[2024-06-03 07:43:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 9 ms.
[2024-06-03 07:43:51] [INFO ] Time to serialize gal into /tmp/CTLFireability12426852661591950137.gal : 4 ms
[2024-06-03 07:43:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7752233238070566548.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/CTLFireability12426852661591950137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7752233238070566548.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,1.03432e+10,6.60165,135112,1580,63,219761,926,694,435319,95,2359,0


Converting to forward existential form...Done !
original formula: E(EF((i5.i0.u28.p255==1)) U ((AX((EX((i8.u46.p358!=1)) * ((AG(((i3.u5.p29==1)&&(i4.u25.p195==1))) + (i2.u10.p72==1)) + EF((i5.i0.u33.p291...202
=> equivalent forward existential formula: [(((FwdU(Init,E(TRUE U (i5.i0.u28.p255==1))) * (i4.u25.p184==1)) * (i6.u4.p24==1)) * !(EX(!((EX((i8.u46.p358!=1)...278
Reverse transition relation is NOT exact ! Due to transitions t20, t64, t128, t146, t148, t149, t182, t184, t185, t206, t208, t209, t214, t215, t216, t218,...935
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 198 transition count 411
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 198 transition count 411
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 120 place count 172 transition count 371
Iterating global reduction 0 with 26 rules applied. Total rules applied 146 place count 172 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 148 place count 172 transition count 369
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 162 place count 158 transition count 342
Iterating global reduction 1 with 14 rules applied. Total rules applied 176 place count 158 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 179 place count 158 transition count 339
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 184 place count 153 transition count 325
Iterating global reduction 2 with 5 rules applied. Total rules applied 189 place count 153 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 192 place count 153 transition count 322
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 196 place count 149 transition count 313
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 149 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 204 place count 149 transition count 309
Applied a total of 204 rules in 13 ms. Remains 149 /245 variables (removed 96) and now considering 309/478 (removed 169) transitions.
// Phase 1: matrix 309 rows 149 cols
[2024-06-03 07:44:21] [INFO ] Computed 8 invariants in 7 ms
[2024-06-03 07:44:21] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-03 07:44:21] [INFO ] Invariant cache hit.
[2024-06-03 07:44:22] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-03 07:44:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-03 07:44:26] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/458 variables, 149/158 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-03 07:44:31] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-03 07:44:37] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-03 07:44:45] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/458 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/458 variables, and 161 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/458 variables, 149/161 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 308/469 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 469 constraints, problems are : Problem set: 0 solved, 308 unsolved in 18594 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 4/4 constraints]
After SMT, in 48742ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 48745ms
Starting structural reductions in LTL mode, iteration 1 : 149/245 places, 309/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49196 ms. Remains : 149/245 places, 309/478 transitions.
[2024-06-03 07:45:10] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:45:10] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:45:10] [INFO ] Input system was already deterministic with 309 transitions.
[2024-06-03 07:45:10] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:45:10] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:45:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2913431185191735392.gal : 3 ms
[2024-06-03 07:45:10] [INFO ] Time to serialize properties into /tmp/CTLFireability3886772221044868829.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/CTLFireability2913431185191735392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3886772221044868829.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 07:45:40] [INFO ] Flatten gal took : 13 ms
[2024-06-03 07:45:40] [INFO ] Applying decomposition
[2024-06-03 07:45:40] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12898069391487414451.txt' '-o' '/tmp/graph12898069391487414451.bin' '-w' '/tmp/graph12898069391487414451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12898069391487414451.bin' '-l' '-1' '-v' '-w' '/tmp/graph12898069391487414451.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:45:41] [INFO ] Decomposing Gal with order
[2024-06-03 07:45:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:45:41] [INFO ] Removed a total of 448 redundant transitions.
[2024-06-03 07:45:41] [INFO ] Flatten gal took : 22 ms
[2024-06-03 07:45:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 9 ms.
[2024-06-03 07:45:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15386185442148813701.gal : 4 ms
[2024-06-03 07:45:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12704559309441689383.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/CTLFireability15386185442148813701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12704559309441689383.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.2443e+09,2.03355,49172,1145,54,78272,458,647,171180,76,1123,0


Converting to forward existential form...Done !
original formula: EG(A(!(((i2.i1.u21.p208!=1)||(((i0.u1.p12==1)&&(i0.u3.p20==1))&&(i3.u31.p312==1)))) U AX(EF(((i9.u42.p364==1)&&(i8.u39.p350==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EX(!(E(TRUE U ((i9.u42.p364==1)&&(i8.u39.p350==1))))))) U (!(!(((i2.i1.u21.p208!=1)||(((i0.u...346
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t133, t135, t136, t171, t173, t174, t196, t198, t199, t204, t205, t206, t207, t208,...815
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local 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
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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local 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.07012,143420,1,0,198522,1695,3719,688006,430,5049,390204
FORMULA MedleyA-PT-23-CTLFireability-2024-03 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 : 245/245 places, 478/478 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 211 transition count 434
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 211 transition count 434
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 88 place count 191 transition count 404
Iterating global reduction 0 with 20 rules applied. Total rules applied 108 place count 191 transition count 404
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 119 place count 180 transition count 385
Iterating global reduction 0 with 11 rules applied. Total rules applied 130 place count 180 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 131 place count 180 transition count 384
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 134 place count 177 transition count 375
Iterating global reduction 1 with 3 rules applied. Total rules applied 137 place count 177 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 139 place count 177 transition count 373
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 174 transition count 367
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 174 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 148 place count 174 transition count 364
Applied a total of 148 rules in 10 ms. Remains 174 /245 variables (removed 71) and now considering 364/478 (removed 114) transitions.
// Phase 1: matrix 364 rows 174 cols
[2024-06-03 07:45:48] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:45:48] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-03 07:45:48] [INFO ] Invariant cache hit.
[2024-06-03 07:45:48] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-03 07:45:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 364/538 variables, 174/182 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-03 07:45:58] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 0/538 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 183 constraints, problems are : Problem set: 0 solved, 363 unsolved in 21231 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/538 variables, 174/183 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 363/546 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-03 07:46:15] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2024-06-03 07:46:17] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-03 07:46:25] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 549 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 4/4 constraints]
After SMT, in 51449ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 51453ms
Starting structural reductions in LTL mode, iteration 1 : 174/245 places, 364/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51822 ms. Remains : 174/245 places, 364/478 transitions.
[2024-06-03 07:46:40] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:46:40] [INFO ] Flatten gal took : 10 ms
[2024-06-03 07:46:40] [INFO ] Input system was already deterministic with 364 transitions.
[2024-06-03 07:46:40] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:46:40] [INFO ] Flatten gal took : 13 ms
[2024-06-03 07:46:40] [INFO ] Time to serialize gal into /tmp/CTLFireability244247073559347289.gal : 3 ms
[2024-06-03 07:46:40] [INFO ] Time to serialize properties into /tmp/CTLFireability2404210859009726596.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/CTLFireability244247073559347289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2404210859009726596.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:47:10] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:47:10] [INFO ] Applying decomposition
[2024-06-03 07:47:10] [INFO ] Flatten gal took : 9 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/graph2199336407060506584.txt' '-o' '/tmp/graph2199336407060506584.bin' '-w' '/tmp/graph2199336407060506584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2199336407060506584.bin' '-l' '-1' '-v' '-w' '/tmp/graph2199336407060506584.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:47:10] [INFO ] Decomposing Gal with order
[2024-06-03 07:47:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:47:10] [INFO ] Removed a total of 531 redundant transitions.
[2024-06-03 07:47:10] [INFO ] Flatten gal took : 39 ms
[2024-06-03 07:47:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 15 ms.
[2024-06-03 07:47:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7748628298696098716.gal : 6 ms
[2024-06-03 07:47:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14373724557240418230.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/CTLFireability7748628298696098716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14373724557240418230.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,1.90362e+10,15.0585,262892,2732,76,390148,873,834,907226,105,3002,0


Converting to forward existential form...Done !
original formula: ((!(E((((!((i1.i2.u18.p123==1)&&(i2.u50.p361==1)))||((((i6.u3.p12==1)&&(u8.p30==1))&&((i1.i1.u14.p71==1)&&(i6.u3.p12==1)))&&((i6.u7.p25==...1259
=> equivalent forward existential formula: (([((FwdU((Init * !((!(E((((!((i1.i2.u18.p123==1)&&(i2.u50.p361==1)))||((((i6.u3.p12==1)&&(u8.p30==1))&&((i1.i1....3981
Reverse transition relation is NOT exact ! Due to transitions t20, t61, t139, t158, t161, t162, t163, t170, t172, t191, t193, t200, t203, t204, t205, t219,...1033
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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 : 245/245 places, 478/478 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 204 transition count 419
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 204 transition count 419
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 104 place count 182 transition count 383
Iterating global reduction 0 with 22 rules applied. Total rules applied 126 place count 182 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 128 place count 182 transition count 381
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 139 place count 171 transition count 360
Iterating global reduction 1 with 11 rules applied. Total rules applied 150 place count 171 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 152 place count 171 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 157 place count 166 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 162 place count 166 transition count 344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 165 place count 166 transition count 341
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 164 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 164 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 164 transition count 334
Applied a total of 171 rules in 12 ms. Remains 164 /245 variables (removed 81) and now considering 334/478 (removed 144) transitions.
// Phase 1: matrix 334 rows 164 cols
[2024-06-03 07:47:40] [INFO ] Computed 8 invariants in 4 ms
[2024-06-03 07:47:40] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-03 07:47:40] [INFO ] Invariant cache hit.
[2024-06-03 07:47:40] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-06-03 07:47:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (OVERLAPS) 334/498 variables, 164/172 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-03 07:47:50] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 173 constraints, problems are : Problem set: 0 solved, 333 unsolved in 23194 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 334/498 variables, 164/173 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 333/506 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-03 07:48:09] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-03 07:48:17] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 508 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 3/3 constraints]
After SMT, in 53400ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 53407ms
Starting structural reductions in LTL mode, iteration 1 : 164/245 places, 334/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53894 ms. Remains : 164/245 places, 334/478 transitions.
[2024-06-03 07:48:34] [INFO ] Flatten gal took : 14 ms
[2024-06-03 07:48:34] [INFO ] Flatten gal took : 16 ms
[2024-06-03 07:48:34] [INFO ] Input system was already deterministic with 334 transitions.
[2024-06-03 07:48:34] [INFO ] Flatten gal took : 13 ms
[2024-06-03 07:48:34] [INFO ] Flatten gal took : 14 ms
[2024-06-03 07:48:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7266408049439683943.gal : 3 ms
[2024-06-03 07:48:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5335017817692066010.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/CTLFireability7266408049439683943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5335017817692066010.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 07:49:04] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:49:04] [INFO ] Applying decomposition
[2024-06-03 07:49:04] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12580505347744284019.txt' '-o' '/tmp/graph12580505347744284019.bin' '-w' '/tmp/graph12580505347744284019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12580505347744284019.bin' '-l' '-1' '-v' '-w' '/tmp/graph12580505347744284019.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:49:04] [INFO ] Decomposing Gal with order
[2024-06-03 07:49:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:49:04] [INFO ] Removed a total of 479 redundant transitions.
[2024-06-03 07:49:04] [INFO ] Flatten gal took : 23 ms
[2024-06-03 07:49:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2024-06-03 07:49:04] [INFO ] Time to serialize gal into /tmp/CTLFireability2500375722799593821.gal : 3 ms
[2024-06-03 07:49:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6848597660615651048.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/CTLFireability2500375722799593821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6848597660615651048.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,1.21975e+10,3.66316,86024,1773,62,151418,653,703,286123,79,2477,0


Converting to forward existential form...Done !
original formula: AF((!(E(!(((EF((i5.i1.u37.p321==1)) * (i4.u28.p231==1)) * (i5.i0.u40.p331==1))) U ((((i2.u7.p35==1)||(i2.u10.p68==1))||(i4.u20.p148==1))&...356
=> equivalent forward existential formula: [FwdG(Init,!((!(E(!(((E(TRUE U (i5.i1.u37.p321==1)) * (i4.u28.p231==1)) * (i5.i0.u40.p331==1))) U ((((i2.u7.p35=...425
Reverse transition relation is NOT exact ! Due to transitions t56, t60, t134, t152, t154, t155, t189, t191, t192, t214, t216, t217, t226, t227, t228, t230,...918
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 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 : 245/245 places, 478/478 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 201 transition count 418
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 201 transition count 418
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 112 place count 177 transition count 379
Iterating global reduction 0 with 24 rules applied. Total rules applied 136 place count 177 transition count 379
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 138 place count 177 transition count 377
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 149 place count 166 transition count 355
Iterating global reduction 1 with 11 rules applied. Total rules applied 160 place count 166 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 162 place count 166 transition count 353
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 166 place count 162 transition count 342
Iterating global reduction 2 with 4 rules applied. Total rules applied 170 place count 162 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 172 place count 162 transition count 340
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 174 place count 160 transition count 335
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 160 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 160 transition count 333
Applied a total of 178 rules in 13 ms. Remains 160 /245 variables (removed 85) and now considering 333/478 (removed 145) transitions.
// Phase 1: matrix 333 rows 160 cols
[2024-06-03 07:49:34] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:49:34] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-03 07:49:34] [INFO ] Invariant cache hit.
[2024-06-03 07:49:35] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-03 07:49:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 333/493 variables, 160/168 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-06-03 07:49:45] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 169 constraints, problems are : Problem set: 0 solved, 332 unsolved in 21095 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (OVERLAPS) 333/493 variables, 160/169 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 332/501 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-06-03 07:50:01] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-06-03 07:50:09] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-06-03 07:50:17] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 504 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 4/4 constraints]
After SMT, in 51364ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 51370ms
Starting structural reductions in LTL mode, iteration 1 : 160/245 places, 333/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51931 ms. Remains : 160/245 places, 333/478 transitions.
[2024-06-03 07:50:26] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:50:26] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:50:26] [INFO ] Input system was already deterministic with 333 transitions.
[2024-06-03 07:50:26] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:50:26] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:50:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10230031862794474246.gal : 3 ms
[2024-06-03 07:50:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1085166636897047503.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/CTLFireability10230031862794474246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1085166636897047503.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 07:50:56] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:50:56] [INFO ] Applying decomposition
[2024-06-03 07:50:56] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2016569743014124256.txt' '-o' '/tmp/graph2016569743014124256.bin' '-w' '/tmp/graph2016569743014124256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2016569743014124256.bin' '-l' '-1' '-v' '-w' '/tmp/graph2016569743014124256.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:50:56] [INFO ] Decomposing Gal with order
[2024-06-03 07:50:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:50:56] [INFO ] Removed a total of 490 redundant transitions.
[2024-06-03 07:50:56] [INFO ] Flatten gal took : 21 ms
[2024-06-03 07:50:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2024-06-03 07:50:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10334266016978086243.gal : 4 ms
[2024-06-03 07:50:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8202075597570665415.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/CTLFireability10334266016978086243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8202075597570665415.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.94876e+09,6.22719,111612,1499,52,194785,937,674,336022,83,2628,0


Converting to forward existential form...Done !
original formula: EF((E((i5.i1.u38.p319==1) U !((((i2.u30.p220==1)&&(i8.u47.p362==1))&&(((((i3.u2.p12==1)&&(i6.u4.p20==1))&&(i2.u21.p154==1))||(((i3.u2.p12...501
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * E((i5.i1.u38.p319==1) U !((((i2.u30.p220==1)&&(i8.u47.p362==1))&&(((((i3.u2.p12==1)&&(i...1511
Reverse transition relation is NOT exact ! Due to transitions t19, t57, t148, t150, t151, t184, t186, t187, t208, t210, t211, t216, t217, t218, t219, t220,...908
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 200 transition count 413
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 200 transition count 413
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 114 place count 176 transition count 373
Iterating global reduction 0 with 24 rules applied. Total rules applied 138 place count 176 transition count 373
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 140 place count 176 transition count 371
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 151 place count 165 transition count 348
Iterating global reduction 1 with 11 rules applied. Total rules applied 162 place count 165 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 164 place count 165 transition count 346
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 167 place count 162 transition count 338
Iterating global reduction 2 with 3 rules applied. Total rules applied 170 place count 162 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 171 place count 162 transition count 337
Applied a total of 171 rules in 23 ms. Remains 162 /245 variables (removed 83) and now considering 337/478 (removed 141) transitions.
// Phase 1: matrix 337 rows 162 cols
[2024-06-03 07:51:26] [INFO ] Computed 8 invariants in 7 ms
[2024-06-03 07:51:26] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-03 07:51:26] [INFO ] Invariant cache hit.
[2024-06-03 07:51:27] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-03 07:51:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (OVERLAPS) 337/499 variables, 162/170 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-03 07:51:37] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 171 constraints, problems are : Problem set: 0 solved, 336 unsolved in 24936 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-03 07:51:55] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 337/499 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 336/508 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-03 07:52:02] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-03 07:52:16] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/499 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 510 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 4/4 constraints]
After SMT, in 55177ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 55184ms
Starting structural reductions in LTL mode, iteration 1 : 162/245 places, 337/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55768 ms. Remains : 162/245 places, 337/478 transitions.
[2024-06-03 07:52:22] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:52:22] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:52:22] [INFO ] Input system was already deterministic with 337 transitions.
[2024-06-03 07:52:22] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:52:22] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:52:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6820807036666875762.gal : 7 ms
[2024-06-03 07:52:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10667441324248654579.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/CTLFireability6820807036666875762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10667441324248654579.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 07:52:52] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:52:52] [INFO ] Applying decomposition
[2024-06-03 07:52:52] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10958651715094071905.txt' '-o' '/tmp/graph10958651715094071905.bin' '-w' '/tmp/graph10958651715094071905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10958651715094071905.bin' '-l' '-1' '-v' '-w' '/tmp/graph10958651715094071905.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:52:52] [INFO ] Decomposing Gal with order
[2024-06-03 07:52:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:52:52] [INFO ] Removed a total of 482 redundant transitions.
[2024-06-03 07:52:52] [INFO ] Flatten gal took : 20 ms
[2024-06-03 07:52:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 3 ms.
[2024-06-03 07:52:52] [INFO ] Time to serialize gal into /tmp/CTLFireability17382256891248164334.gal : 3 ms
[2024-06-03 07:52:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12782780003092051171.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/CTLFireability17382256891248164334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12782780003092051171.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,1.0735e+10,2.72858,63332,1221,74,105828,1221,638,208568,97,3860,0


Converting to forward existential form...Done !
original formula: (E(!(A(EF(!(((i4.u28.p220==1)&&(i8.u46.p362==1)))) U AX((((i0.u4.p24==1)&&(i5.u39.p302==1))&&(i4.u22.p169==1))))) U (i5.u32.p255==1)) * A...384
=> equivalent forward existential formula: [(((Init * E(!(!((E(!(!(EX(!((((i0.u4.p24==1)&&(i5.u39.p302==1))&&(i4.u22.p169==1)))))) U (!(E(TRUE U !(((i4.u28...1036
Reverse transition relation is NOT exact ! Due to transitions t19, t59, t155, t157, t158, t191, t193, t194, t215, t217, t218, t230, t231, t232, t233, t234,...869
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 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
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 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 : 245/245 places, 478/478 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 203 transition count 418
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 203 transition count 418
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 108 place count 179 transition count 382
Iterating global reduction 0 with 24 rules applied. Total rules applied 132 place count 179 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 133 place count 179 transition count 381
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 143 place count 169 transition count 362
Iterating global reduction 1 with 10 rules applied. Total rules applied 153 place count 169 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 154 place count 169 transition count 361
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 166 transition count 353
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 166 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 166 transition count 352
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 164 transition count 347
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 164 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 164 transition count 345
Applied a total of 167 rules in 11 ms. Remains 164 /245 variables (removed 81) and now considering 345/478 (removed 133) transitions.
// Phase 1: matrix 345 rows 164 cols
[2024-06-03 07:53:22] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:53:22] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-03 07:53:22] [INFO ] Invariant cache hit.
[2024-06-03 07:53:23] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 344 sub problems to find dead transitions.
[2024-06-03 07:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (OVERLAPS) 345/509 variables, 164/172 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-03 07:53:32] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 0/509 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 173 constraints, problems are : Problem set: 0 solved, 344 unsolved in 22544 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-03 07:53:48] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (OVERLAPS) 345/509 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 344/518 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-03 07:54:01] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/509 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 344 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 509/509 variables, and 519 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 3/3 constraints]
After SMT, in 52712ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 52716ms
Starting structural reductions in LTL mode, iteration 1 : 164/245 places, 345/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53073 ms. Remains : 164/245 places, 345/478 transitions.
[2024-06-03 07:54:15] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:54:15] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:54:15] [INFO ] Input system was already deterministic with 345 transitions.
[2024-06-03 07:54:15] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:54:15] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10377332601865359702.gal : 2 ms
[2024-06-03 07:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3630685548488489623.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/CTLFireability10377332601865359702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3630685548488489623.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 07:54:46] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:54:46] [INFO ] Applying decomposition
[2024-06-03 07:54:46] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1304581283115663633.txt' '-o' '/tmp/graph1304581283115663633.bin' '-w' '/tmp/graph1304581283115663633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1304581283115663633.bin' '-l' '-1' '-v' '-w' '/tmp/graph1304581283115663633.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:54:46] [INFO ] Decomposing Gal with order
[2024-06-03 07:54:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:54:46] [INFO ] Removed a total of 510 redundant transitions.
[2024-06-03 07:54:46] [INFO ] Flatten gal took : 21 ms
[2024-06-03 07:54:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2024-06-03 07:54:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8152172778795570045.gal : 4 ms
[2024-06-03 07:54:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1077033542746021209.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/CTLFireability8152172778795570045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1077033542746021209.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,1.45832e+10,17.3897,313156,2740,83,520241,1147,733,969417,102,3801,0


Converting to forward existential form...Done !
original formula: (EF(((E(((i1.u6.p29==1)&&(i4.u29.p195==1)) U (i6.u30.p257==1)) * AX(((i1.u27.p228==1)&&(i8.u47.p361==1)))) * (((E((((i3.i0.u1.p12==1)&&(i...717
=> equivalent forward existential formula: ([((Init * !(E(TRUE U ((E(((i1.u6.p29==1)&&(i4.u29.p195==1)) U (i6.u30.p257==1)) * !(EX(!(((i1.u27.p228==1)&&(i8...1837
Reverse transition relation is NOT exact ! Due to transitions t20, t57, t95, t135, t143, t154, t156, t157, t190, t192, t193, t214, t216, t217, t222, t223, ...1018
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Graph (trivial) has 204 edges and 245 vertex of which 29 / 245 are part of one of the 3 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 218 transition count 405
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 182 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 75 place count 182 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 179 transition count 400
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 123 place count 137 transition count 336
Iterating global reduction 2 with 42 rules applied. Total rules applied 165 place count 137 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 167 place count 137 transition count 334
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 167 place count 137 transition count 329
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 132 transition count 329
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 191 place count 118 transition count 288
Iterating global reduction 3 with 14 rules applied. Total rules applied 205 place count 118 transition count 288
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 214 place count 118 transition count 279
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 215 place count 117 transition count 276
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 117 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 117 transition count 275
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 253 place count 99 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 99 transition count 256
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 262 place count 91 transition count 232
Iterating global reduction 6 with 8 rules applied. Total rules applied 270 place count 91 transition count 232
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 272 place count 89 transition count 228
Iterating global reduction 6 with 2 rules applied. Total rules applied 274 place count 89 transition count 228
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 276 place count 87 transition count 222
Iterating global reduction 6 with 2 rules applied. Total rules applied 278 place count 87 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 280 place count 87 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 282 place count 86 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 288 place count 86 transition count 213
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 7 with 6 rules applied. Total rules applied 294 place count 83 transition count 210
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 297 place count 80 transition count 201
Iterating global reduction 7 with 3 rules applied. Total rules applied 300 place count 80 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 303 place count 80 transition count 198
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 305 place count 80 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 307 place count 78 transition count 196
Applied a total of 307 rules in 91 ms. Remains 78 /245 variables (removed 167) and now considering 196/478 (removed 282) transitions.
[2024-06-03 07:55:16] [INFO ] Flow matrix only has 187 transitions (discarded 9 similar events)
// Phase 1: matrix 187 rows 78 cols
[2024-06-03 07:55:16] [INFO ] Computed 8 invariants in 1 ms
[2024-06-03 07:55:16] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-03 07:55:16] [INFO ] Flow matrix only has 187 transitions (discarded 9 similar events)
[2024-06-03 07:55:16] [INFO ] Invariant cache hit.
[2024-06-03 07:55:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-03 07:55:16] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-03 07:55:16] [INFO ] Redundant transitions in 10 ms returned []
Running 169 sub problems to find dead transitions.
[2024-06-03 07:55:16] [INFO ] Flow matrix only has 187 transitions (discarded 9 similar events)
[2024-06-03 07:55:16] [INFO ] Invariant cache hit.
[2024-06-03 07:55:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 185/260 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 4/264 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 88 constraints, problems are : Problem set: 0 solved, 169 unsolved in 5609 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 185/260 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 4/264 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 149/257 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/264 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 257 constraints, problems are : Problem set: 0 solved, 169 unsolved in 6434 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
After SMT, in 12131ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 12133ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/245 places, 196/478 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12514 ms. Remains : 78/245 places, 196/478 transitions.
[2024-06-03 07:55:28] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:55:28] [INFO ] Flatten gal took : 6 ms
[2024-06-03 07:55:28] [INFO ] Input system was already deterministic with 196 transitions.
[2024-06-03 07:55:28] [INFO ] Flatten gal took : 26 ms
[2024-06-03 07:55:28] [INFO ] Flatten gal took : 22 ms
[2024-06-03 07:55:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4526524409486746761.gal : 2 ms
[2024-06-03 07:55:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13305226215243893740.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/ReachabilityCardinality4526524409486746761.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13305226215243893740.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
Loading property file /tmp/ReachabilityCardinality13305226215243893740.prop.
RANDOM walk for 36921 steps (38 resets) in 757 ms. (48 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-23-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 199 transition count 412
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 199 transition count 412
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 117 place count 174 transition count 373
Iterating global reduction 0 with 25 rules applied. Total rules applied 142 place count 174 transition count 373
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 144 place count 174 transition count 371
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 156 place count 162 transition count 347
Iterating global reduction 1 with 12 rules applied. Total rules applied 168 place count 162 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 170 place count 162 transition count 345
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 158 transition count 334
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 158 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 180 place count 158 transition count 332
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 183 place count 155 transition count 325
Iterating global reduction 3 with 3 rules applied. Total rules applied 186 place count 155 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 189 place count 155 transition count 322
Applied a total of 189 rules in 22 ms. Remains 155 /245 variables (removed 90) and now considering 322/478 (removed 156) transitions.
// Phase 1: matrix 322 rows 155 cols
[2024-06-03 07:55:29] [INFO ] Computed 8 invariants in 3 ms
[2024-06-03 07:55:33] [INFO ] Implicit Places using invariants in 4227 ms returned []
[2024-06-03 07:55:33] [INFO ] Invariant cache hit.
[2024-06-03 07:55:33] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 4529 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-03 07:55:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 322/477 variables, 155/163 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-03 07:55:40] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 164 constraints, problems are : Problem set: 0 solved, 321 unsolved in 17233 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/477 variables, 155/164 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 321/485 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-03 07:55:57] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 3 ms to minimize.
[2024-06-03 07:55:57] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-03 07:56:05] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 488 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 4/4 constraints]
After SMT, in 47568ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 47572ms
Starting structural reductions in LTL mode, iteration 1 : 155/245 places, 322/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52125 ms. Remains : 155/245 places, 322/478 transitions.
[2024-06-03 07:56:21] [INFO ] Flatten gal took : 14 ms
[2024-06-03 07:56:21] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:56:21] [INFO ] Input system was already deterministic with 322 transitions.
[2024-06-03 07:56:21] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:56:21] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:56:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17418425710438934186.gal : 3 ms
[2024-06-03 07:56:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15261765080386019446.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/CTLFireability17418425710438934186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15261765080386019446.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 07:56:51] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:56:51] [INFO ] Applying decomposition
[2024-06-03 07:56:51] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6807778119113149388.txt' '-o' '/tmp/graph6807778119113149388.bin' '-w' '/tmp/graph6807778119113149388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6807778119113149388.bin' '-l' '-1' '-v' '-w' '/tmp/graph6807778119113149388.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:56:51] [INFO ] Decomposing Gal with order
[2024-06-03 07:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:56:51] [INFO ] Removed a total of 472 redundant transitions.
[2024-06-03 07:56:51] [INFO ] Flatten gal took : 19 ms
[2024-06-03 07:56:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-06-03 07:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10037429566316859646.gal : 3 ms
[2024-06-03 07:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6006923238590382136.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/CTLFireability10037429566316859646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6006923238590382136.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.37796e+09,3.15689,70336,1464,67,116100,898,620,253684,72,3292,0


Converting to forward existential form...Done !
original formula: AX(E(E((AX((i8.u45.p358==1)) + ((i2.u11.p74!=1) * EG(((i1.u3.p19==1)&&(i2.u14.p112==1))))) U (i4.u18.p139==1)) U EF((i5.u30.p256==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(E((!(EX(!((i8.u45.p358==1)))) + ((i2.u11.p74!=1) * EG(((i1.u3.p19==1)&&(i2.u14.p112==1))))) U (...212
Reverse transition relation is NOT exact ! Due to transitions t20, t58, t125, t143, t145, t146, t179, t181, t182, t203, t205, t206, t221, t222, t223, t224,...905
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 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 : 245/245 places, 478/478 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 200 transition count 419
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 200 transition count 419
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 115 place count 175 transition count 381
Iterating global reduction 0 with 25 rules applied. Total rules applied 140 place count 175 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 141 place count 175 transition count 380
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 154 place count 162 transition count 355
Iterating global reduction 1 with 13 rules applied. Total rules applied 167 place count 162 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 169 place count 162 transition count 353
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 157 transition count 339
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 157 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 182 place count 157 transition count 336
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 186 place count 153 transition count 327
Iterating global reduction 3 with 4 rules applied. Total rules applied 190 place count 153 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 194 place count 153 transition count 323
Applied a total of 194 rules in 13 ms. Remains 153 /245 variables (removed 92) and now considering 323/478 (removed 155) transitions.
// Phase 1: matrix 323 rows 153 cols
[2024-06-03 07:57:21] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:57:21] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-03 07:57:21] [INFO ] Invariant cache hit.
[2024-06-03 07:57:21] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-06-03 07:57:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-03 07:57:26] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/476 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-03 07:57:32] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 163 constraints, problems are : Problem set: 0 solved, 322 unsolved in 24557 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/476 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 322/485 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-03 07:58:01] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/476 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 486 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
After SMT, in 54794ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 54805ms
Starting structural reductions in LTL mode, iteration 1 : 153/245 places, 323/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55338 ms. Remains : 153/245 places, 323/478 transitions.
[2024-06-03 07:58:16] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:58:16] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:58:16] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-03 07:58:16] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:58:16] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:58:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4173570479884177520.gal : 2 ms
[2024-06-03 07:58:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12736461254110923239.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/CTLFireability4173570479884177520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12736461254110923239.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 07:58:46] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:58:46] [INFO ] Applying decomposition
[2024-06-03 07:58:46] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10116053855161645600.txt' '-o' '/tmp/graph10116053855161645600.bin' '-w' '/tmp/graph10116053855161645600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10116053855161645600.bin' '-l' '-1' '-v' '-w' '/tmp/graph10116053855161645600.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:58:46] [INFO ] Decomposing Gal with order
[2024-06-03 07:58:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:58:46] [INFO ] Removed a total of 485 redundant transitions.
[2024-06-03 07:58:46] [INFO ] Flatten gal took : 18 ms
[2024-06-03 07:58:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2024-06-03 07:58:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1580862551055840541.gal : 3 ms
[2024-06-03 07:58:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5615012064974088269.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/CTLFireability1580862551055840541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5615012064974088269.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,8.21105e+09,5.29895,116272,1482,51,193690,574,603,377894,69,1517,0


Converting to forward existential form...Done !
original formula: (EF(EG(AG((((i1.u2.p12==1)&&(i3.u6.p30==1))&&(i6.u35.p312==1))))) + E(AX(!(A(AF((((i1.u2.p12==1)&&(i1.u4.p20==1))&&(i6.u28.p240==1))) U A...366
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(E(TRUE U !((((i1.u2.p12==1)&&(i3.u6.p30==1))&&(i6.u35.p312==1))))))] != FALSE + [((EY(F...600
Reverse transition relation is NOT exact ! Due to transitions t19, t54, t138, t140, t141, t149, t169, t176, t178, t179, t194, t201, t203, t204, t209, t210,...884
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 LTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 199 transition count 414
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 199 transition count 414
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 118 place count 173 transition count 372
Iterating global reduction 0 with 26 rules applied. Total rules applied 144 place count 173 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 146 place count 173 transition count 370
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 160 place count 159 transition count 343
Iterating global reduction 1 with 14 rules applied. Total rules applied 174 place count 159 transition count 343
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 177 place count 159 transition count 340
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 182 place count 154 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 187 place count 154 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 190 place count 154 transition count 323
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 193 place count 151 transition count 316
Iterating global reduction 3 with 3 rules applied. Total rules applied 196 place count 151 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 199 place count 151 transition count 313
Applied a total of 199 rules in 19 ms. Remains 151 /245 variables (removed 94) and now considering 313/478 (removed 165) transitions.
// Phase 1: matrix 313 rows 151 cols
[2024-06-03 07:59:16] [INFO ] Computed 8 invariants in 5 ms
[2024-06-03 07:59:17] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-03 07:59:17] [INFO ] Invariant cache hit.
[2024-06-03 07:59:17] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2024-06-03 07:59:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-03 07:59:20] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/464 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-03 07:59:24] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 161 constraints, problems are : Problem set: 0 solved, 312 unsolved in 15760 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/464 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 312/473 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-03 07:59:39] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-03 07:59:53] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/464 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 475 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 4/4 constraints]
After SMT, in 45895ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 45899ms
Starting structural reductions in LTL mode, iteration 1 : 151/245 places, 313/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46294 ms. Remains : 151/245 places, 313/478 transitions.
[2024-06-03 08:00:03] [INFO ] Flatten gal took : 16 ms
[2024-06-03 08:00:03] [INFO ] Flatten gal took : 7 ms
[2024-06-03 08:00:03] [INFO ] Input system was already deterministic with 313 transitions.
[2024-06-03 08:00:03] [INFO ] Flatten gal took : 7 ms
[2024-06-03 08:00:03] [INFO ] Flatten gal took : 7 ms
[2024-06-03 08:00:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6108793084407862604.gal : 2 ms
[2024-06-03 08:00:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7474981469410926123.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/CTLFireability6108793084407862604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7474981469410926123.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 08:00:33] [INFO ] Flatten gal took : 7 ms
[2024-06-03 08:00:33] [INFO ] Applying decomposition
[2024-06-03 08:00:33] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9691586219075547452.txt' '-o' '/tmp/graph9691586219075547452.bin' '-w' '/tmp/graph9691586219075547452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9691586219075547452.bin' '-l' '-1' '-v' '-w' '/tmp/graph9691586219075547452.weights' '-q' '0' '-e' '0.001'
[2024-06-03 08:00:33] [INFO ] Decomposing Gal with order
[2024-06-03 08:00:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 08:00:33] [INFO ] Removed a total of 451 redundant transitions.
[2024-06-03 08:00:33] [INFO ] Flatten gal took : 18 ms
[2024-06-03 08:00:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2024-06-03 08:00:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1333321321936817571.gal : 2 ms
[2024-06-03 08:00:33] [INFO ] Time to serialize properties into /tmp/CTLFireability2934283674346195070.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/CTLFireability1333321321936817571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2934283674346195070.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,7.69548e+09,6.85339,125760,1572,42,205701,685,629,405105,72,2098,0


Converting to forward existential form...Done !
original formula: EF(EX(AG((((i6.u33.p328==0)||(i9.u45.p375==0)) + (EG(((i5.u25.p283==1)&&(i7.u38.p343==1))) * ((i5.u26.p259==1)||(i5.u31.p303==1)))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((((i6.u33.p328==0)||(i9.u45.p375==0)) + (EG(((i5.u25.p283==1)&&(i7.u38.p343...216
Reverse transition relation is NOT exact ! Due to transitions t19, t56, t137, t139, t140, t148, t168, t175, t177, t178, t193, t200, t202, t203, t208, t209,...902
Fast SCC detection found an SCC at level 1
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 : 245/245 places, 478/478 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 200 transition count 413
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 200 transition count 413
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 115 place count 175 transition count 374
Iterating global reduction 0 with 25 rules applied. Total rules applied 140 place count 175 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 175 transition count 372
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 154 place count 163 transition count 350
Iterating global reduction 1 with 12 rules applied. Total rules applied 166 place count 163 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 169 place count 163 transition count 347
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 173 place count 159 transition count 336
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 159 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 179 place count 159 transition count 334
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 183 place count 155 transition count 325
Iterating global reduction 3 with 4 rules applied. Total rules applied 187 place count 155 transition count 325
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 191 place count 155 transition count 321
Applied a total of 191 rules in 11 ms. Remains 155 /245 variables (removed 90) and now considering 321/478 (removed 157) transitions.
// Phase 1: matrix 321 rows 155 cols
[2024-06-03 08:01:03] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 08:01:03] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-03 08:01:03] [INFO ] Invariant cache hit.
[2024-06-03 08:01:04] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-06-03 08:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-03 08:01:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/476 variables, 155/164 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-03 08:01:13] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 165 constraints, problems are : Problem set: 0 solved, 320 unsolved in 22353 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/476 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 320/485 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-03 08:01:33] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-03 08:01:42] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 487 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 4/4 constraints]
After SMT, in 52579ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 52582ms
Starting structural reductions in LTL mode, iteration 1 : 155/245 places, 321/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53102 ms. Remains : 155/245 places, 321/478 transitions.
[2024-06-03 08:01:56] [INFO ] Flatten gal took : 12 ms
[2024-06-03 08:01:56] [INFO ] Flatten gal took : 12 ms
[2024-06-03 08:01:56] [INFO ] Input system was already deterministic with 321 transitions.
[2024-06-03 08:01:56] [INFO ] Flatten gal took : 12 ms
[2024-06-03 08:01:56] [INFO ] Flatten gal took : 12 ms
[2024-06-03 08:01:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3641444739844439627.gal : 3 ms
[2024-06-03 08:01:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13447893616145102883.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/CTLFireability3641444739844439627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13447893616145102883.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 08:02:26] [INFO ] Flatten gal took : 7 ms
[2024-06-03 08:02:26] [INFO ] Applying decomposition
[2024-06-03 08:02:26] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7859866396919429447.txt' '-o' '/tmp/graph7859866396919429447.bin' '-w' '/tmp/graph7859866396919429447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7859866396919429447.bin' '-l' '-1' '-v' '-w' '/tmp/graph7859866396919429447.weights' '-q' '0' '-e' '0.001'
[2024-06-03 08:02:26] [INFO ] Decomposing Gal with order
[2024-06-03 08:02:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 08:02:26] [INFO ] Removed a total of 470 redundant transitions.
[2024-06-03 08:02:26] [INFO ] Flatten gal took : 19 ms
[2024-06-03 08:02:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 4 ms.
[2024-06-03 08:02:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8336524337936088073.gal : 2 ms
[2024-06-03 08:02:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14075754508744504503.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/CTLFireability8336524337936088073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14075754508744504503.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.3626e+09,1.87933,43204,1470,56,65682,372,651,155231,73,1054,0


Converting to forward existential form...Done !
original formula: AG(((AG((EF((i1.u8.p92==1)) * EG((i0.u1.p12==1)))) + EX(!(E((((i0.u1.p12==1)&&(u5.p30==1))&&(i1.u13.p93==1)) U (i7.i0.u43.p342==1))))) + ...176
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !((i4.i1.u34.p307==0))) * !(EX(!(E((((i0.u1.p12==1)&&(u5.p30==1))&&(i1.u13.p93==1)) ...408
Reverse transition relation is NOT exact ! Due to transitions t20, t54, t121, t139, t141, t142, t177, t179, t180, t202, t204, t205, t213, t214, t215, t216,...913
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
(forward)formula 0,0,13.3464,294532,1,0,444636,3587,4187,1.28561e+06,417,12323,896962
FORMULA MedleyA-PT-23-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 199 transition count 414
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 199 transition count 414
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 117 place count 174 transition count 374
Iterating global reduction 0 with 25 rules applied. Total rules applied 142 place count 174 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 143 place count 174 transition count 373
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 156 place count 161 transition count 349
Iterating global reduction 1 with 13 rules applied. Total rules applied 169 place count 161 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 172 place count 161 transition count 346
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 177 place count 156 transition count 332
Iterating global reduction 2 with 5 rules applied. Total rules applied 182 place count 156 transition count 332
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 185 place count 156 transition count 329
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 189 place count 152 transition count 320
Iterating global reduction 3 with 4 rules applied. Total rules applied 193 place count 152 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 152 transition count 316
Applied a total of 197 rules in 12 ms. Remains 152 /245 variables (removed 93) and now considering 316/478 (removed 162) transitions.
// Phase 1: matrix 316 rows 152 cols
[2024-06-03 08:02:40] [INFO ] Computed 8 invariants in 1 ms
[2024-06-03 08:02:40] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-03 08:02:40] [INFO ] Invariant cache hit.
[2024-06-03 08:02:40] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2024-06-03 08:02:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/468 variables, 152/160 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-03 08:02:49] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 0/468 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 161 constraints, problems are : Problem set: 0 solved, 315 unsolved in 22894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/468 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 315/476 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-03 08:03:10] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-06-03 08:03:10] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
[2024-06-03 08:03:12] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-03 08:03:18] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 315 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 468/468 variables, and 480 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 5/5 constraints]
After SMT, in 53153ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 53159ms
Starting structural reductions in LTL mode, iteration 1 : 152/245 places, 316/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53558 ms. Remains : 152/245 places, 316/478 transitions.
[2024-06-03 08:03:33] [INFO ] Flatten gal took : 11 ms
[2024-06-03 08:03:33] [INFO ] Flatten gal took : 11 ms
[2024-06-03 08:03:33] [INFO ] Input system was already deterministic with 316 transitions.
[2024-06-03 08:03:33] [INFO ] Flatten gal took : 12 ms
[2024-06-03 08:03:33] [INFO ] Flatten gal took : 11 ms
[2024-06-03 08:03:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10772823024084177474.gal : 3 ms
[2024-06-03 08:03:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13812172143360071537.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/CTLFireability10772823024084177474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13812172143360071537.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 08:04:03] [INFO ] Flatten gal took : 7 ms
[2024-06-03 08:04:03] [INFO ] Applying decomposition
[2024-06-03 08:04:03] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11174345066542486292.txt' '-o' '/tmp/graph11174345066542486292.bin' '-w' '/tmp/graph11174345066542486292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11174345066542486292.bin' '-l' '-1' '-v' '-w' '/tmp/graph11174345066542486292.weights' '-q' '0' '-e' '0.001'
[2024-06-03 08:04:03] [INFO ] Decomposing Gal with order
[2024-06-03 08:04:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 08:04:03] [INFO ] Removed a total of 465 redundant transitions.
[2024-06-03 08:04:04] [INFO ] Flatten gal took : 17 ms
[2024-06-03 08:04:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 2 ms.
[2024-06-03 08:04:04] [INFO ] Time to serialize gal into /tmp/CTLFireability181334233873778531.gal : 2 ms
[2024-06-03 08:04:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2623661158020499272.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/CTLFireability181334233873778531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2623661158020499272.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.95408e+09,4.63719,98856,1521,46,174265,595,635,354316,67,1605,0


Converting to forward existential form...Done !
original formula: EX(EF(((EG(EX((((i5.u2.p12==1)&&(u6.p30==1))&&(i6.i1.u30.p247==1)))) * EF((i2.u15.p113==0))) * ((u6.p29==0)||(i4.u25.p212==0)))))
=> equivalent forward existential formula: [(FwdU(((FwdU(EY(Init),TRUE) * ((u6.p29==0)||(i4.u25.p212==0))) * EG(EX((((i5.u2.p12==1)&&(u6.p30==1))&&(i6.i1.u...206
Reverse transition relation is NOT exact ! Due to transitions t19, t54, t137, t139, t140, t173, t175, t176, t197, t199, t200, t205, t206, t207, t215, t216,...831
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 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Using saturation style SCC detection
Using saturation style SCC detection
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
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,11.5048,189408,1,0,333773,2198,3898,765695,380,5732,795910
FORMULA MedleyA-PT-23-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 245/245 places, 478/478 transitions.
Graph (trivial) has 186 edges and 245 vertex of which 21 / 245 are part of one of the 2 SCC in 1 ms
Free SCC test removed 19 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 225 transition count 424
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 197 transition count 422
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 59 place count 197 transition count 409
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 85 place count 184 transition count 409
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 127 place count 142 transition count 345
Iterating global reduction 2 with 42 rules applied. Total rules applied 169 place count 142 transition count 345
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 169 place count 142 transition count 340
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 179 place count 137 transition count 340
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 194 place count 122 transition count 297
Iterating global reduction 2 with 15 rules applied. Total rules applied 209 place count 122 transition count 297
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 218 place count 122 transition count 288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 219 place count 121 transition count 285
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 121 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 221 place count 121 transition count 284
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 259 place count 102 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 261 place count 102 transition count 263
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 270 place count 93 transition count 236
Iterating global reduction 5 with 9 rules applied. Total rules applied 279 place count 93 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 281 place count 93 transition count 234
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 285 place count 89 transition count 226
Iterating global reduction 6 with 4 rules applied. Total rules applied 289 place count 89 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 290 place count 89 transition count 225
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 292 place count 87 transition count 219
Iterating global reduction 7 with 2 rules applied. Total rules applied 294 place count 87 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 296 place count 87 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 300 place count 85 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 304 place count 85 transition count 211
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 308 place count 83 transition count 209
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 310 place count 81 transition count 203
Iterating global reduction 8 with 2 rules applied. Total rules applied 312 place count 81 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 314 place count 81 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 316 place count 79 transition count 199
Applied a total of 316 rules in 67 ms. Remains 79 /245 variables (removed 166) and now considering 199/478 (removed 279) transitions.
[2024-06-03 08:04:15] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
// Phase 1: matrix 190 rows 79 cols
[2024-06-03 08:04:15] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 08:04:15] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-03 08:04:15] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2024-06-03 08:04:15] [INFO ] Invariant cache hit.
[2024-06-03 08:04:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 08:04:15] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-06-03 08:04:16] [INFO ] Redundant transitions in 12 ms returned []
Running 181 sub problems to find dead transitions.
[2024-06-03 08:04:16] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2024-06-03 08:04:16] [INFO ] Invariant cache hit.
[2024-06-03 08:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 189/265 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 3/268 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/268 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/269 variables, and 88 constraints, problems are : Problem set: 0 solved, 181 unsolved in 7434 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 189/265 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 30/115 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 3/268 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 151/269 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/269 variables, and 269 constraints, problems are : Problem set: 0 solved, 181 unsolved in 8545 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16075ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16078ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/245 places, 199/478 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16544 ms. Remains : 79/245 places, 199/478 transitions.
[2024-06-03 08:04:32] [INFO ] Flatten gal took : 5 ms
[2024-06-03 08:04:32] [INFO ] Flatten gal took : 6 ms
[2024-06-03 08:04:32] [INFO ] Input system was already deterministic with 199 transitions.
[2024-06-03 08:04:32] [INFO ] Flatten gal took : 7 ms
[2024-06-03 08:04:32] [INFO ] Flatten gal took : 7 ms
[2024-06-03 08:04:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9518793742013760998.gal : 2 ms
[2024-06-03 08:04:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3694612497303063403.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/CTLFireability9518793742013760998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3694612497303063403.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15825e+07,8.78615,178356,2,7953,5,529967,6,0,512,757439,0


Converting to forward existential form...Done !
original formula: AG(AF((p331==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p331==1)))] = FALSE
Hit Full ! (commute/partial/dont) 189/0/10
(forward)formula 0,0,10.9042,178356,1,0,10,529967,20,3,2984,757439,8
FORMULA MedleyA-PT-23-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-03 08:04:43] [INFO ] Flatten gal took : 11 ms
[2024-06-03 08:04:43] [INFO ] Flatten gal took : 11 ms
[2024-06-03 08:04:43] [INFO ] Applying decomposition
[2024-06-03 08:04:43] [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/graph9580543715548374380.txt' '-o' '/tmp/graph9580543715548374380.bin' '-w' '/tmp/graph9580543715548374380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9580543715548374380.bin' '-l' '-1' '-v' '-w' '/tmp/graph9580543715548374380.weights' '-q' '0' '-e' '0.001'
[2024-06-03 08:04:43] [INFO ] Decomposing Gal with order
[2024-06-03 08:04:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 08:04:43] [INFO ] Removed a total of 695 redundant transitions.
[2024-06-03 08:04:43] [INFO ] Flatten gal took : 26 ms
[2024-06-03 08:04:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2024-06-03 08:04:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10641005044463729208.gal : 4 ms
[2024-06-03 08:04:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14498697236260063845.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/CTLFireability10641005044463729208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14498697236260063845.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 11 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.01312e+11,27.913,482572,5590,106,749389,1755,1103,1.65478e+06,110,7557,0


Converting to forward existential form...Done !
original formula: E(AG(AX(((AG((i7.i0.u68.p331==1)) + (i0.u69.p332==1)) + (((i1.u2.p12==1)&&(i5.u7.p30==1))&&((i4.i2.u42.p212==1)&&(i3.i1.u22.p101==1))))))...580
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,!(E(TRUE U !(!(EX(!(((!(E(TRUE U !((i7.i0.u68.p331==1)))) + (i0.u69.p332==1)) + (((i1.u2.p12=...885
Reverse transition relation is NOT exact ! Due to transitions t26, t39, t66, t83, t87, t90, t205, t224, t225, t227, t228, t229, t230, t237, t238, t240, t24...1391
(forward)formula 0,1,285.671,2710784,1,0,3.60935e+06,12143,4383,9.23571e+06,376,80571,6705115
FORMULA MedleyA-PT-23-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((!(A((i7.i0.u48.p248==1) U EF((i4.i0.u46.p231==1)))) * (i7.i0.u55.p273!=1)) * (((i3.i0.u26.p130!=1)||(i10.i0.u78.p376!=1)) * (EX(((i5...287
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * (!(!((E(!(E(TRUE U (i4.i0.u46.p231==1))) U (!((i7.i0.u48.p248==1)) * !(E(TRUE U (i4.i0...682
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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 1,1,555.333,3774440,1,0,5.33146e+06,13062,4320,1.33734e+07,410,101523,8924101
FORMULA MedleyA-PT-23-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-06-03 08:33:41] [INFO ] Applying decomposition
[2024-06-03 08:33:41] [INFO ] Flatten gal took : 11 ms
[2024-06-03 08:33:41] [INFO ] Decomposing Gal with order
[2024-06-03 08:33:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 08:33:41] [INFO ] Removed a total of 496 redundant transitions.
[2024-06-03 08:33:41] [INFO ] Flatten gal took : 28 ms
[2024-06-03 08:33:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 8 ms.
[2024-06-03 08:33:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16405694561795452042.gal : 3 ms
[2024-06-03 08:33:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17970563248574513180.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/CTLFireability16405694561795452042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17970563248574513180.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 9 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.01312e+11,76.6619,1723268,3667,5334,2.36097e+06,261676,322,1.03945e+07,557,4.34765e+06,0


Converting to forward existential form...Done !
original formula: E(EF((i0.i1.u13.p255==1)) U ((AX((EX((i1.i0.u17.p358!=1)) * ((AG(((i0.i0.i1.u8.p29==1)&&(i0.i1.i0.u12.p195==1))) + (i0.i1.i0.u11.p72==1))...238
=> equivalent forward existential formula: [(((FwdU(Init,E(TRUE U (i0.i1.u13.p255==1))) * (i0.i1.i0.u12.p184==1)) * (i0.i0.i1.i0.u7.p24==1)) * !(EX(!((EX((...314
Reverse transition relation is NOT exact ! Due to transitions t228, t239, t293, t306, i0.t388, i0.t319, i0.t318, i0.i0.t205, i0.i0.u3.t215, i0.i0.u3.t217, ...1274

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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