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.r026-smll-171620167500322.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 AutonomousCar-PT-07b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167500322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 334K May 18 16:42 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 AutonomousCar-PT-07b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716333907796

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:25:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:25:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:25:11] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2024-05-21 23:25:11] [INFO ] Transformed 323 places.
[2024-05-21 23:25:11] [INFO ] Transformed 846 transitions.
[2024-05-21 23:25:11] [INFO ] Found NUPN structural information;
[2024-05-21 23:25:11] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 685 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Support contains 75 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 280 transition count 803
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 280 transition count 803
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 282 place count 280 transition count 607
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 287 place count 275 transition count 602
Iterating global reduction 1 with 5 rules applied. Total rules applied 292 place count 275 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 274 transition count 601
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 274 transition count 601
Applied a total of 294 rules in 229 ms. Remains 274 /323 variables (removed 49) and now considering 601/846 (removed 245) transitions.
// Phase 1: matrix 601 rows 274 cols
[2024-05-21 23:25:11] [INFO ] Computed 12 invariants in 49 ms
[2024-05-21 23:25:12] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-21 23:25:12] [INFO ] Invariant cache hit.
[2024-05-21 23:25:12] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-21 23:25:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 24 places in 487 ms of which 71 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 71 places in 462 ms of which 5 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 39 places in 355 ms of which 4 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 25 places in 335 ms of which 5 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 4 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 41 places in 349 ms of which 5 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 3 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 42 places in 354 ms of which 3 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 3 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 40 places in 389 ms of which 5 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 42 places in 375 ms of which 3 ms to minimize.
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 2 ms to minimize.
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 3 ms to minimize.
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 3 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 28 places in 432 ms of which 4 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 21 places in 433 ms of which 4 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 44 places in 450 ms of which 4 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 47 places in 442 ms of which 5 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 47 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 42 places in 433 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 25 places in 483 ms of which 5 ms to minimize.
[2024-05-21 23:25:36] [INFO ] Deduced a trap composed of 52 places in 446 ms of which 5 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 41 places in 420 ms of which 4 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 43 places in 448 ms of which 6 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 50 places in 290 ms of which 2 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 60 places in 267 ms of which 4 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 42 places in 394 ms of which 5 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 50 places in 402 ms of which 4 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 45 places in 388 ms of which 4 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 50 places in 441 ms of which 4 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 49 places in 447 ms of which 5 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 57 places in 408 ms of which 4 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 31 places in 385 ms of which 4 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 5 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 41 places in 352 ms of which 6 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 53 places in 415 ms of which 4 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 32 places in 380 ms of which 4 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 38 places in 381 ms of which 5 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 3 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 274/875 variables, and 52 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/274 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 4 ms to minimize.
[2024-05-21 23:25:53] [INFO ] Deduced a trap composed of 43 places in 376 ms of which 4 ms to minimize.
[2024-05-21 23:25:53] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 4 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 47 places in 347 ms of which 3 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 4 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 43 places in 337 ms of which 4 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 3 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 2 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 46 places in 349 ms of which 4 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 44 places in 337 ms of which 4 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 47 places in 336 ms of which 5 ms to minimize.
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 3 ms to minimize.
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 46 places in 340 ms of which 3 ms to minimize.
[2024-05-21 23:25:58] [INFO ] Deduced a trap composed of 42 places in 326 ms of which 4 ms to minimize.
[2024-05-21 23:25:59] [INFO ] Deduced a trap composed of 44 places in 343 ms of which 4 ms to minimize.
[2024-05-21 23:25:59] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 4 ms to minimize.
[2024-05-21 23:25:59] [INFO ] Deduced a trap composed of 42 places in 266 ms of which 3 ms to minimize.
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 25 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 15 places in 432 ms of which 4 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 27 places in 383 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 32 places in 365 ms of which 5 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 31 places in 380 ms of which 4 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 31 places in 363 ms of which 4 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 5 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 3 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 69 places in 349 ms of which 3 ms to minimize.
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 4 ms to minimize.
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 3 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 3 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 3 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 3 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 2 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 3 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 3 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 2 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 14 places in 321 ms of which 3 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 3 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/875 variables, and 95 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/274 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 83/83 constraints]
After SMT, in 62673ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 62735ms
Starting structural reductions in LTL mode, iteration 1 : 274/323 places, 601/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64040 ms. Remains : 274/323 places, 601/846 transitions.
Support contains 75 out of 274 places after structural reductions.
[2024-05-21 23:26:15] [INFO ] Flatten gal took : 162 ms
[2024-05-21 23:26:16] [INFO ] Flatten gal took : 95 ms
[2024-05-21 23:26:16] [INFO ] Input system was already deterministic with 601 transitions.
RANDOM walk for 40000 steps (285 resets) in 2802 ms. (14 steps per ms) remains 42/77 properties
BEST_FIRST walk for 4003 steps (9 resets) in 41 ms. (95 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (9 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
[2024-05-21 23:26:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 220/274 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 601/875 variables, 274/286 constraints. Problems are: Problem set: 2 solved, 40 unsolved
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 14 places in 329 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/875 variables, 1/287 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/875 variables, 0/287 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/875 variables, 0/287 constraints. Problems are: Problem set: 2 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 875/875 variables, and 287 constraints, problems are : Problem set: 2 solved, 40 unsolved in 2867 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 221/274 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 40 unsolved
[2024-05-21 23:26:21] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:26:21] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 4 ms to minimize.
Problem AtomicPropp14 is UNSAT
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 3/16 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 31 places in 426 ms of which 5 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 39 places in 372 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 2/18 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 601/875 variables, 274/292 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/875 variables, 39/331 constraints. Problems are: Problem set: 3 solved, 39 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 875/875 variables, and 331 constraints, problems are : Problem set: 3 solved, 39 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 39/42 constraints, Known Traps: 6/6 constraints]
After SMT, in 8438ms problems are : Problem set: 3 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 197 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 10 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1093 edges and 272 vertex of which 269 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.13 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 269 transition count 505
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 126 rules applied. Total rules applied 219 place count 180 transition count 468
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 242 place count 159 transition count 466
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 246 place count 157 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 247 place count 156 transition count 464
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 247 place count 156 transition count 456
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 263 place count 148 transition count 456
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 270 place count 141 transition count 449
Iterating global reduction 5 with 7 rules applied. Total rules applied 277 place count 141 transition count 449
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 341 place count 109 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 342 place count 109 transition count 416
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 344 place count 108 transition count 415
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 363 place count 108 transition count 396
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 382 place count 89 transition count 396
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 385 place count 89 transition count 396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 386 place count 88 transition count 395
Applied a total of 386 rules in 270 ms. Remains 88 /274 variables (removed 186) and now considering 395/601 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 88/274 places, 395/601 transitions.
RANDOM walk for 40000 steps (1474 resets) in 940 ms. (42 steps per ms) remains 29/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (11 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (13 resets) in 9 ms. (400 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
// Phase 1: matrix 395 rows 88 cols
[2024-05-21 23:26:26] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:26:26] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 49/86 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 394/480 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 3/483 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 23:26:27] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 0/483 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 102 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 49/86 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 394/480 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 23/120 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 23:26:29] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 3/483 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/483 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 483/483 variables, and 127 constraints, problems are : Problem set: 0 solved, 23 unsolved in 12456 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 3/3 constraints]
After SMT, in 13800ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 1407 ms.
Support contains 37 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 395/395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 393
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 393
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 86 transition count 392
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 85 transition count 392
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 2 with 2 rules applied. Total rules applied 8 place count 84 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 84 transition count 390
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 3 with 6 rules applied. Total rules applied 15 place count 81 transition count 387
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 81 transition count 384
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 28 place count 78 transition count 377
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 78 transition count 377
Applied a total of 29 rules in 80 ms. Remains 78 /88 variables (removed 10) and now considering 377/395 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 78/88 places, 377/395 transitions.
RANDOM walk for 40000 steps (1619 resets) in 523 ms. (76 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4003 steps (19 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (17 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
// Phase 1: matrix 377 rows 78 cols
[2024-05-21 23:26:42] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:26:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 52/76 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 376/452 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 3/455 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/455 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 92 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1579 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 52/76 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 376/452 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 3/455 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/455 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 113 constraints, problems are : Problem set: 0 solved, 20 unsolved in 6873 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
After SMT, in 8573ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 1728 ms.
Support contains 24 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 377/377 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 78 transition count 376
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 376
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 70 transition count 369
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 66 transition count 365
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 66 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 65 transition count 364
Applied a total of 26 rules in 66 ms. Remains 65 /78 variables (removed 13) and now considering 364/377 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 65/78 places, 364/377 transitions.
RANDOM walk for 40000 steps (2088 resets) in 823 ms. (48 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (21 resets) in 24 ms. (160 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 26 ms. (148 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
// Phase 1: matrix 364 rows 65 cols
[2024-05-21 23:26:53] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:26:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 38/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 360/418 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 11/429 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/429 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 78 constraints, problems are : Problem set: 0 solved, 14 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 38/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 360/418 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 11/429 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/429 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 92 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2572 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 3407ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 5309 ms.
Support contains 20 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 364/364 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 63 transition count 362
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 362
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 63 transition count 360
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 15 place count 61 transition count 353
Applied a total of 15 rules in 36 ms. Remains 61 /65 variables (removed 4) and now considering 353/364 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 61/65 places, 353/364 transitions.
RANDOM walk for 40000 steps (1610 resets) in 465 ms. (85 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40004 steps (200 resets) in 95 ms. (416 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (215 resets) in 59 ms. (666 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (180 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (183 resets) in 92 ms. (430 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (178 resets) in 55 ms. (714 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (208 resets) in 71 ms. (555 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (179 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
// Phase 1: matrix 353 rows 61 cols
[2024-05-21 23:27:02] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:27:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 337/377 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 37/414 variables, 21/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 74 constraints, problems are : Problem set: 0 solved, 4 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 337/377 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 37/414 variables, 21/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 78 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1394ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1385 ms.
Support contains 11 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 353/353 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 338
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 59 transition count 337
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 59 transition count 331
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 38 place count 53 transition count 310
Applied a total of 38 rules in 40 ms. Remains 53 /61 variables (removed 8) and now considering 310/353 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 53/61 places, 310/353 transitions.
RANDOM walk for 40000 steps (486 resets) in 301 ms. (132 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (219 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (55 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
// Phase 1: matrix 310 rows 53 cols
[2024-05-21 23:27:05] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:27:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 294/325 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/363 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/363 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 66 constraints, problems are : Problem set: 0 solved, 2 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/325 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/363 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/363 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 68 constraints, problems are : Problem set: 0 solved, 2 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 210 ms.
Support contains 9 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 310/310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 302
Applied a total of 2 rules in 31 ms. Remains 52 /53 variables (removed 1) and now considering 302/310 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 52/53 places, 302/310 transitions.
RANDOM walk for 40000 steps (465 resets) in 419 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (231 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (55 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 691130 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 2
Probabilistic random walk after 691130 steps, saw 103343 distinct states, run finished after 3007 ms. (steps per millisecond=229 ) properties seen :0
// Phase 1: matrix 302 rows 52 cols
[2024-05-21 23:27:09] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:27:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 287/318 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/354 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 287/318 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/354 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 67 constraints, problems are : Problem set: 0 solved, 2 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 164 ms.
Support contains 9 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 302/302 transitions.
Applied a total of 0 rules in 16 ms. Remains 52 /52 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 52/52 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 302/302 transitions.
Applied a total of 0 rules in 15 ms. Remains 52 /52 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-05-21 23:27:10] [INFO ] Invariant cache hit.
[2024-05-21 23:27:10] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 23:27:10] [INFO ] Invariant cache hit.
[2024-05-21 23:27:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:27:11] [INFO ] Implicit Places using invariants and state equation in 326 ms returned [47, 51]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 490 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 50/52 places, 301/302 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 300
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 49 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 48 transition count 299
Applied a total of 4 rules in 35 ms. Remains 48 /50 variables (removed 2) and now considering 299/301 (removed 2) transitions.
// Phase 1: matrix 299 rows 48 cols
[2024-05-21 23:27:11] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 23:27:11] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 23:27:11] [INFO ] Invariant cache hit.
[2024-05-21 23:27:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:27:11] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/52 places, 299/302 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1006 ms. Remains : 48/52 places, 299/302 transitions.
RANDOM walk for 40000 steps (286 resets) in 1074 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (232 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (56 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 800900 steps, run visited all 2 properties in 2182 ms. (steps per millisecond=367 )
Probabilistic random walk after 800900 steps, saw 122769 distinct states, run finished after 2187 ms. (steps per millisecond=366 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-21 23:27:14] [INFO ] Flatten gal took : 49 ms
[2024-05-21 23:27:14] [INFO ] Flatten gal took : 51 ms
[2024-05-21 23:27:14] [INFO ] Input system was already deterministic with 601 transitions.
Support contains 69 out of 274 places (down from 70) after GAL structural reductions.
Computed a total of 46 stabilizing places and 47 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 242 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 271 transition count 497
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 140 rules applied. Total rules applied 242 place count 170 transition count 458
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 24 rules applied. Total rules applied 266 place count 147 transition count 457
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 269 place count 146 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 270 place count 145 transition count 455
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 270 place count 145 transition count 448
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 284 place count 138 transition count 448
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 292 place count 130 transition count 440
Iterating global reduction 5 with 8 rules applied. Total rules applied 300 place count 130 transition count 440
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 301 place count 129 transition count 433
Iterating global reduction 5 with 1 rules applied. Total rules applied 302 place count 129 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 304 place count 129 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 305 place count 128 transition count 431
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 383 place count 89 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 384 place count 89 transition count 391
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 396 place count 77 transition count 308
Iterating global reduction 8 with 12 rules applied. Total rules applied 408 place count 77 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 10 rules applied. Total rules applied 418 place count 77 transition count 298
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 423 place count 72 transition count 298
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 10 with 2 rules applied. Total rules applied 425 place count 71 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 426 place count 71 transition count 296
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 428 place count 69 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 429 place count 68 transition count 294
Applied a total of 429 rules in 186 ms. Remains 68 /274 variables (removed 206) and now considering 294/601 (removed 307) transitions.
// Phase 1: matrix 294 rows 68 cols
[2024-05-21 23:27:14] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 23:27:14] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 23:27:14] [INFO ] Invariant cache hit.
[2024-05-21 23:27:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:27:15] [INFO ] Implicit Places using invariants and state equation in 264 ms returned [61, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 396 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/274 places, 294/601 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 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 65 transition count 293
Applied a total of 2 rules in 38 ms. Remains 65 /66 variables (removed 1) and now considering 293/294 (removed 1) transitions.
// Phase 1: matrix 293 rows 65 cols
[2024-05-21 23:27:15] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 23:27:15] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 23:27:15] [INFO ] Invariant cache hit.
[2024-05-21 23:27:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:27:15] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 65/274 places, 293/601 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 909 ms. Remains : 65/274 places, 293/601 transitions.
[2024-05-21 23:27:15] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:27:15] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:27:15] [INFO ] Input system was already deterministic with 293 transitions.
[2024-05-21 23:27:15] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:27:15] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:27:15] [INFO ] Time to serialize gal into /tmp/CTLFireability226555766680704534.gal : 25 ms
[2024-05-21 23:27:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6689653363277664334.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/CTLFireability226555766680704534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6689653363277664334.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.72757e+07,5.52029,124532,2,12674,5,405684,6,0,551,488053,0


Converting to forward existential form...Done !
original formula: !(E(EF(!(((((p65==1)&&(p96==1))&&((p121==1)&&(p158==1)))&&(((p189==1)&&(p214==1))&&((p251==1)&&(p281==1)))))) U AF((p203==1))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(((((p65==1)&&(p96==1))&&((p121==1)&&(p158==1)))&&(((p189==1)&&(p214==1))&&((p251==1)&&(p2...199
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t7, t9, t11, t12, t14, t15, t21, t23, t25, t26, t28, t30, t32, t33, t36, ...930
Detected timeout of ITS tools.
[2024-05-21 23:27:45] [INFO ] Flatten gal took : 49 ms
[2024-05-21 23:27:45] [INFO ] Applying decomposition
[2024-05-21 23:27:45] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18027026299235890606.txt' '-o' '/tmp/graph18027026299235890606.bin' '-w' '/tmp/graph18027026299235890606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18027026299235890606.bin' '-l' '-1' '-v' '-w' '/tmp/graph18027026299235890606.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:27:46] [INFO ] Decomposing Gal with order
[2024-05-21 23:27:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:27:46] [INFO ] Removed a total of 1293 redundant transitions.
[2024-05-21 23:27:46] [INFO ] Flatten gal took : 183 ms
[2024-05-21 23:27:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 40 ms.
[2024-05-21 23:27:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11149428904182544380.gal : 9 ms
[2024-05-21 23:27:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1856903112556994674.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/CTLFireability11149428904182544380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1856903112556994674.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.72757e+07,1.23097,33756,1852,99,56519,1357,321,115895,69,14708,0


Converting to forward existential form...Done !
original formula: !(E(EF(!(((((u1.p65==1)&&(u3.p96==1))&&((i2.u4.p121==1)&&(u8.p158==1)))&&(((u10.p189==1)&&(i8.u14.p214==1))&&((i2.u17.p251==1)&&(i2.u4.p2...191
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(((((u1.p65==1)&&(u3.p96==1))&&((i2.u4.p121==1)&&(u8.p158==1)))&&(((u10.p189==1)&&(i8.u14....245
Reverse transition relation is NOT exact ! Due to transitions t5, t78, t79, t80, t81, t86, t87, t88, t89, t94, t95, t96, t97, t102, t103, t104, t105, t187,...554
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 242 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 271 transition count 495
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 274 place count 143 transition count 453
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 274 place count 143 transition count 447
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 137 transition count 447
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 294 place count 129 transition count 439
Iterating global reduction 3 with 8 rules applied. Total rules applied 302 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 303 place count 128 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 306 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 127 transition count 430
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 385 place count 88 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 386 place count 88 transition count 390
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 396 place count 78 transition count 322
Iterating global reduction 6 with 10 rules applied. Total rules applied 406 place count 78 transition count 322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 416 place count 78 transition count 312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 421 place count 73 transition count 312
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 8 with 2 rules applied. Total rules applied 423 place count 72 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 424 place count 72 transition count 310
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 72 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 427 place count 70 transition count 308
Applied a total of 427 rules in 90 ms. Remains 70 /274 variables (removed 204) and now considering 308/601 (removed 293) transitions.
// Phase 1: matrix 308 rows 70 cols
[2024-05-21 23:28:16] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 23:28:16] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 23:28:16] [INFO ] Invariant cache hit.
[2024-05-21 23:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:28:17] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [63, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 310 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 68/274 places, 308/601 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 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 307
Applied a total of 2 rules in 13 ms. Remains 67 /68 variables (removed 1) and now considering 307/308 (removed 1) transitions.
// Phase 1: matrix 307 rows 67 cols
[2024-05-21 23:28:17] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 23:28:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 23:28:17] [INFO ] Invariant cache hit.
[2024-05-21 23:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:28:17] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 67/274 places, 307/601 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 678 ms. Remains : 67/274 places, 307/601 transitions.
[2024-05-21 23:28:17] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:28:17] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:28:17] [INFO ] Input system was already deterministic with 307 transitions.
[2024-05-21 23:28:17] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:28:17] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:28:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4530790141948074233.gal : 6 ms
[2024-05-21 23:28:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17282411096563759376.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/CTLFireability4530790141948074233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17282411096563759376.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:28:47] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:28:47] [INFO ] Applying decomposition
[2024-05-21 23:28:47] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5251927278364725998.txt' '-o' '/tmp/graph5251927278364725998.bin' '-w' '/tmp/graph5251927278364725998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5251927278364725998.bin' '-l' '-1' '-v' '-w' '/tmp/graph5251927278364725998.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:28:47] [INFO ] Decomposing Gal with order
[2024-05-21 23:28:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:28:47] [INFO ] Removed a total of 1325 redundant transitions.
[2024-05-21 23:28:47] [INFO ] Flatten gal took : 57 ms
[2024-05-21 23:28:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 12 ms.
[2024-05-21 23:28:48] [INFO ] Time to serialize gal into /tmp/CTLFireability4481471370755232749.gal : 3 ms
[2024-05-21 23:28:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10934051966834483647.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/CTLFireability4481471370755232749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10934051966834483647.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.4187e+08,4.61184,125144,1519,142,121232,4475,304,1.14059e+06,79,34484,0


Converting to forward existential form...Done !
original formula: AG((EF(((((i1.u2.p65==1)&&(i1.u3.p90==1))&&((i2.u8.p127==1)&&(i1.u10.p158==1)))&&(((i1.u11.p183==1)&&(i1.u15.p220==1))&&((i1.u17.p245==1)...254
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(E(TRUE U ((((i1.u2.p65==1)&&(i1.u3.p90==1))&&((i2.u8.p127==1)&&(i1.u10.p158==1)))&&(...324
Reverse transition relation is NOT exact ! Due to transitions t5, t56, t57, t60, t61, t180, t187, t201, t222, t271, t292, i0.t242, i0.u4.t36, i1.u1.t42, i1...519
(forward)formula 0,0,14.8702,375648,1,0,333631,4475,2218,3.82222e+06,444,34484,371281
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 265 transition count 592
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 265 transition count 592
Applied a total of 18 rules in 12 ms. Remains 265 /274 variables (removed 9) and now considering 592/601 (removed 9) transitions.
// Phase 1: matrix 592 rows 265 cols
[2024-05-21 23:29:03] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 23:29:03] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 23:29:03] [INFO ] Invariant cache hit.
[2024-05-21 23:29:03] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-21 23:29:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 20 places in 463 ms of which 6 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 49 places in 419 ms of which 5 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 14 places in 420 ms of which 4 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 24 places in 370 ms of which 4 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 4 ms to minimize.
[2024-05-21 23:29:19] [INFO ] Deduced a trap composed of 31 places in 307 ms of which 3 ms to minimize.
[2024-05-21 23:29:19] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 3 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 3 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 3 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 4 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 4 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 38 places in 375 ms of which 4 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 4 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 30 places in 389 ms of which 4 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 31 places in 496 ms of which 4 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 26 places in 494 ms of which 4 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 66 places in 348 ms of which 3 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 33 places in 473 ms of which 4 ms to minimize.
[2024-05-21 23:29:25] [INFO ] Deduced a trap composed of 41 places in 457 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:29:26] [INFO ] Deduced a trap composed of 41 places in 333 ms of which 3 ms to minimize.
[2024-05-21 23:29:26] [INFO ] Deduced a trap composed of 41 places in 418 ms of which 4 ms to minimize.
[2024-05-21 23:29:26] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 3 ms to minimize.
[2024-05-21 23:29:27] [INFO ] Deduced a trap composed of 40 places in 364 ms of which 4 ms to minimize.
[2024-05-21 23:29:27] [INFO ] Deduced a trap composed of 45 places in 371 ms of which 4 ms to minimize.
[2024-05-21 23:29:27] [INFO ] Deduced a trap composed of 59 places in 380 ms of which 4 ms to minimize.
[2024-05-21 23:29:28] [INFO ] Deduced a trap composed of 45 places in 360 ms of which 4 ms to minimize.
[2024-05-21 23:29:28] [INFO ] Deduced a trap composed of 43 places in 318 ms of which 3 ms to minimize.
[2024-05-21 23:29:28] [INFO ] Deduced a trap composed of 42 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:29:29] [INFO ] Deduced a trap composed of 28 places in 414 ms of which 4 ms to minimize.
[2024-05-21 23:29:29] [INFO ] Deduced a trap composed of 46 places in 357 ms of which 4 ms to minimize.
[2024-05-21 23:29:30] [INFO ] Deduced a trap composed of 41 places in 344 ms of which 4 ms to minimize.
[2024-05-21 23:29:30] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 3 ms to minimize.
[2024-05-21 23:29:30] [INFO ] Deduced a trap composed of 42 places in 306 ms of which 4 ms to minimize.
[2024-05-21 23:29:31] [INFO ] Deduced a trap composed of 39 places in 314 ms of which 4 ms to minimize.
[2024-05-21 23:29:31] [INFO ] Deduced a trap composed of 41 places in 313 ms of which 4 ms to minimize.
[2024-05-21 23:29:31] [INFO ] Deduced a trap composed of 41 places in 310 ms of which 3 ms to minimize.
[2024-05-21 23:29:32] [INFO ] Deduced a trap composed of 43 places in 394 ms of which 3 ms to minimize.
[2024-05-21 23:29:32] [INFO ] Deduced a trap composed of 58 places in 375 ms of which 3 ms to minimize.
[2024-05-21 23:29:33] [INFO ] Deduced a trap composed of 38 places in 310 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/857 variables, and 52 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 4 ms to minimize.
[2024-05-21 23:29:41] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 3 ms to minimize.
[2024-05-21 23:29:41] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 4 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 3 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 31 places in 323 ms of which 4 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 4 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 3 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 38 places in 330 ms of which 4 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 3 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 3 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 59 places in 302 ms of which 4 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 3 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 43 places in 271 ms of which 4 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 3 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 2 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 3 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 3 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 3 ms to minimize.
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 3 ms to minimize.
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 3 ms to minimize.
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 4 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 46 places in 280 ms of which 4 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 3 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 3 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 3 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/857 variables, and 84 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 72/72 constraints]
After SMT, in 62087ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 62095ms
Starting structural reductions in LTL mode, iteration 1 : 265/274 places, 592/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62720 ms. Remains : 265/274 places, 592/601 transitions.
[2024-05-21 23:30:05] [INFO ] Flatten gal took : 52 ms
[2024-05-21 23:30:05] [INFO ] Flatten gal took : 72 ms
[2024-05-21 23:30:05] [INFO ] Input system was already deterministic with 592 transitions.
[2024-05-21 23:30:06] [INFO ] Flatten gal took : 47 ms
[2024-05-21 23:30:06] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:30:06] [INFO ] Time to serialize gal into /tmp/CTLFireability1777593797155367847.gal : 12 ms
[2024-05-21 23:30:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17413368068311960184.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/CTLFireability1777593797155367847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17413368068311960184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 263 transition count 590
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 263 transition count 590
Applied a total of 22 rules in 9 ms. Remains 263 /274 variables (removed 11) and now considering 590/601 (removed 11) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-21 23:31:06] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 23:31:06] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-21 23:31:06] [INFO ] Invariant cache hit.
[2024-05-21 23:31:07] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-21 23:31:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 17 places in 474 ms of which 5 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 35 places in 418 ms of which 5 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 37 places in 408 ms of which 4 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 34 places in 406 ms of which 5 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 25 places in 454 ms of which 5 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 14 places in 411 ms of which 4 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 36 places in 424 ms of which 4 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 35 places in 426 ms of which 4 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 36 places in 431 ms of which 4 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 4 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 36 places in 411 ms of which 4 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 36 places in 401 ms of which 5 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 49 places in 412 ms of which 4 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 18 places in 378 ms of which 4 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 24 places in 425 ms of which 4 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 4 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 41 places in 357 ms of which 2 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 2 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 2 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 5 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 75 places in 437 ms of which 4 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 43 places in 393 ms of which 4 ms to minimize.
[2024-05-21 23:31:32] [INFO ] Deduced a trap composed of 59 places in 433 ms of which 8 ms to minimize.
[2024-05-21 23:31:32] [INFO ] Deduced a trap composed of 39 places in 550 ms of which 4 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 4 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 22 places in 418 ms of which 4 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 42 places in 430 ms of which 4 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 4 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 38 places in 400 ms of which 4 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 3 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 31 places in 333 ms of which 4 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 44 places in 425 ms of which 4 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 40 places in 428 ms of which 4 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 45 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 46 places in 409 ms of which 4 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 47 places in 310 ms of which 3 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 44 places in 404 ms of which 4 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 40 places in 384 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 31 places in 395 ms of which 4 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 4 ms to minimize.
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 4 ms to minimize.
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 4 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 38 places in 347 ms of which 3 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 52 places in 442 ms of which 4 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 2 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 3 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 3 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 3 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 2 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 3 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 2 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 2 ms to minimize.
[2024-05-21 23:31:50] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 2 ms to minimize.
[2024-05-21 23:31:50] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-05-21 23:31:50] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:31:50] [INFO ] Deduced a trap composed of 52 places in 243 ms of which 3 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 3 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:31:52] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 4 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 40 places in 342 ms of which 4 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 41 places in 371 ms of which 6 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 3 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 52 places in 350 ms of which 4 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 31 places in 333 ms of which 4 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 4 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 3 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 3 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 58 places in 339 ms of which 3 ms to minimize.
[2024-05-21 23:31:58] [INFO ] Deduced a trap composed of 56 places in 375 ms of which 4 ms to minimize.
[2024-05-21 23:31:59] [INFO ] Deduced a trap composed of 26 places in 380 ms of which 4 ms to minimize.
[2024-05-21 23:31:59] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 3 ms to minimize.
[2024-05-21 23:31:59] [INFO ] Deduced a trap composed of 10 places in 395 ms of which 4 ms to minimize.
[2024-05-21 23:32:00] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 4 ms to minimize.
[2024-05-21 23:32:00] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 4 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 4 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 4 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 4 ms to minimize.
[2024-05-21 23:32:09] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 4 ms to minimize.
[2024-05-21 23:32:09] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 3 ms to minimize.
SMT process timed out in 61831ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 61838ms
Starting structural reductions in LTL mode, iteration 1 : 263/274 places, 590/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62619 ms. Remains : 263/274 places, 590/601 transitions.
[2024-05-21 23:32:09] [INFO ] Flatten gal took : 40 ms
[2024-05-21 23:32:09] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:32:09] [INFO ] Input system was already deterministic with 590 transitions.
[2024-05-21 23:32:09] [INFO ] Flatten gal took : 42 ms
[2024-05-21 23:32:09] [INFO ] Flatten gal took : 42 ms
[2024-05-21 23:32:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14988448248820621592.gal : 16 ms
[2024-05-21 23:32:09] [INFO ] Time to serialize properties into /tmp/CTLFireability681045682953696739.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/CTLFireability14988448248820621592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability681045682953696739.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:32:39] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:32:39] [INFO ] Applying decomposition
[2024-05-21 23:32:39] [INFO ] Flatten gal took : 22 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/graph8001757853102365892.txt' '-o' '/tmp/graph8001757853102365892.bin' '-w' '/tmp/graph8001757853102365892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8001757853102365892.bin' '-l' '-1' '-v' '-w' '/tmp/graph8001757853102365892.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:32:39] [INFO ] Decomposing Gal with order
[2024-05-21 23:32:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:32:39] [INFO ] Removed a total of 1607 redundant transitions.
[2024-05-21 23:32:39] [INFO ] Flatten gal took : 91 ms
[2024-05-21 23:32:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 17 ms.
[2024-05-21 23:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability626587800294071707.gal : 7 ms
[2024-05-21 23:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12188383496517704123.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/CTLFireability626587800294071707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12188383496517704123.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,2.70292e+13,3.01867,95292,15608,122,230790,1331,816,322251,93,5606,0


Converting to forward existential form...Done !
original formula: AG((((EX(TRUE) + (i13.u1.p6==0)) + ((i13.u1.p17==0)||(i10.i2.u67.p240==0))) + (i13.u1.p280==0)))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !((i13.u1.p280==0))) * !(((i13.u1.p17==0)||(i10.i2.u67.p240==0)))) * !((i13.u1.p6==0))) *...177
Reverse transition relation is NOT exact ! Due to transitions t85, t111, t137, t163, t189, t215, t240, t247, t249, t251, t279, t314, t356, t587, i0.i1.t25,...811
(forward)formula 0,1,19.4438,586988,1,0,1.3113e+06,1597,5089,1.96882e+06,462,5957,4383165
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 263 transition count 590
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 263 transition count 590
Applied a total of 22 rules in 7 ms. Remains 263 /274 variables (removed 11) and now considering 590/601 (removed 11) transitions.
[2024-05-21 23:32:59] [INFO ] Invariant cache hit.
[2024-05-21 23:32:59] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 23:32:59] [INFO ] Invariant cache hit.
[2024-05-21 23:33:00] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-21 23:33:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 5 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 35 places in 435 ms of which 4 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 37 places in 435 ms of which 4 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 34 places in 420 ms of which 4 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 25 places in 484 ms of which 5 ms to minimize.
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 14 places in 446 ms of which 5 ms to minimize.
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 36 places in 469 ms of which 6 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 35 places in 451 ms of which 4 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 36 places in 435 ms of which 4 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 42 places in 439 ms of which 4 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 36 places in 415 ms of which 4 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 36 places in 410 ms of which 4 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 49 places in 428 ms of which 4 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 4 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 24 places in 451 ms of which 4 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 4 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 41 places in 395 ms of which 3 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 42 places in 289 ms of which 3 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 3 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:33:23] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 24 places in 478 ms of which 4 ms to minimize.
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 75 places in 478 ms of which 4 ms to minimize.
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 43 places in 431 ms of which 4 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 59 places in 451 ms of which 4 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 39 places in 438 ms of which 4 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 31 places in 449 ms of which 4 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 22 places in 448 ms of which 5 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 42 places in 435 ms of which 4 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 27 places in 437 ms of which 4 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 38 places in 446 ms of which 4 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 4 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 31 places in 338 ms of which 3 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 44 places in 449 ms of which 4 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 40 places in 434 ms of which 4 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 45 places in 520 ms of which 4 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 46 places in 392 ms of which 3 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 3 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 3 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 40 places in 414 ms of which 4 ms to minimize.
SMT process timed out in 32439ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 32454ms
Starting structural reductions in LTL mode, iteration 1 : 263/274 places, 590/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33309 ms. Remains : 263/274 places, 590/601 transitions.
[2024-05-21 23:33:32] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:33:32] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:33:33] [INFO ] Input system was already deterministic with 590 transitions.
[2024-05-21 23:33:33] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:33:33] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:33:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6985295414496530528.gal : 9 ms
[2024-05-21 23:33:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12579946750975949697.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/CTLFireability6985295414496530528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12579946750975949697.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 263 transition count 590
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 263 transition count 590
Applied a total of 22 rules in 9 ms. Remains 263 /274 variables (removed 11) and now considering 590/601 (removed 11) transitions.
[2024-05-21 23:34:33] [INFO ] Invariant cache hit.
[2024-05-21 23:34:33] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 23:34:33] [INFO ] Invariant cache hit.
[2024-05-21 23:34:34] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-21 23:34:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 17 places in 496 ms of which 5 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 35 places in 445 ms of which 4 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 4 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 34 places in 424 ms of which 4 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 25 places in 414 ms of which 4 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 14 places in 428 ms of which 4 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 36 places in 406 ms of which 4 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 35 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 42 places in 432 ms of which 4 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 36 places in 421 ms of which 3 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 36 places in 411 ms of which 4 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 49 places in 438 ms of which 4 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 18 places in 399 ms of which 4 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 24 places in 418 ms of which 3 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 4 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 41 places in 391 ms of which 4 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 3 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 43 places in 296 ms of which 4 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 41 places in 280 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 24 places in 461 ms of which 5 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 75 places in 448 ms of which 5 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 43 places in 440 ms of which 5 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 59 places in 442 ms of which 4 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 39 places in 429 ms of which 4 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 4 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 22 places in 428 ms of which 4 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 4 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 4 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 38 places in 407 ms of which 4 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 4 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 31 places in 346 ms of which 4 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 44 places in 431 ms of which 4 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 40 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 45 places in 420 ms of which 5 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 46 places in 396 ms of which 4 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 47 places in 342 ms of which 4 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 44 places in 384 ms of which 4 ms to minimize.
SMT process timed out in 32262ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 32269ms
Starting structural reductions in LTL mode, iteration 1 : 263/274 places, 590/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32745 ms. Remains : 263/274 places, 590/601 transitions.
[2024-05-21 23:35:06] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:35:06] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:35:06] [INFO ] Input system was already deterministic with 590 transitions.
[2024-05-21 23:35:06] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:35:06] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:35:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15093771014037895687.gal : 8 ms
[2024-05-21 23:35:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1675134566931336535.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/CTLFireability15093771014037895687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1675134566931336535.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 245 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 271 transition count 495
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 274 place count 143 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 274 place count 143 transition count 446
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 288 place count 136 transition count 446
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 296 place count 128 transition count 438
Iterating global reduction 3 with 8 rules applied. Total rules applied 304 place count 128 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 127 transition count 431
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 127 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 308 place count 127 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 126 transition count 429
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 387 place count 87 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 87 transition count 389
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 401 place count 74 transition count 298
Iterating global reduction 6 with 13 rules applied. Total rules applied 414 place count 74 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 12 rules applied. Total rules applied 426 place count 74 transition count 286
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 432 place count 68 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 434 place count 67 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 435 place count 67 transition count 284
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 437 place count 65 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 438 place count 64 transition count 282
Applied a total of 438 rules in 70 ms. Remains 64 /274 variables (removed 210) and now considering 282/601 (removed 319) transitions.
// Phase 1: matrix 282 rows 64 cols
[2024-05-21 23:36:07] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 23:36:07] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 23:36:07] [INFO ] Invariant cache hit.
[2024-05-21 23:36:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:36:07] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [57, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 271 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/274 places, 282/601 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 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 281
Applied a total of 2 rules in 12 ms. Remains 61 /62 variables (removed 1) and now considering 281/282 (removed 1) transitions.
// Phase 1: matrix 281 rows 61 cols
[2024-05-21 23:36:07] [INFO ] Computed 8 invariants in 7 ms
[2024-05-21 23:36:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 23:36:07] [INFO ] Invariant cache hit.
[2024-05-21 23:36:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:36:07] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 61/274 places, 281/601 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 602 ms. Remains : 61/274 places, 281/601 transitions.
[2024-05-21 23:36:07] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:36:07] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:36:07] [INFO ] Input system was already deterministic with 281 transitions.
[2024-05-21 23:36:07] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:36:07] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:36:07] [INFO ] Time to serialize gal into /tmp/CTLFireability7596521935635953210.gal : 4 ms
[2024-05-21 23:36:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5955756733317600621.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/CTLFireability7596521935635953210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5955756733317600621.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:36:37] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:36:37] [INFO ] Applying decomposition
[2024-05-21 23:36:37] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7153140716283520614.txt' '-o' '/tmp/graph7153140716283520614.bin' '-w' '/tmp/graph7153140716283520614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7153140716283520614.bin' '-l' '-1' '-v' '-w' '/tmp/graph7153140716283520614.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:36:37] [INFO ] Decomposing Gal with order
[2024-05-21 23:36:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:36:37] [INFO ] Removed a total of 1267 redundant transitions.
[2024-05-21 23:36:37] [INFO ] Flatten gal took : 46 ms
[2024-05-21 23:36:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 10 ms.
[2024-05-21 23:36:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11536573189672564319.gal : 4 ms
[2024-05-21 23:36:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3223461306826213712.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/CTLFireability11536573189672564319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3223461306826213712.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,3.08691e+07,1.43139,40988,2610,99,58085,1550,561,195266,69,14318,0


Converting to forward existential form...Done !
original formula: EF(EG(((((u1.p65==1)&&(u3.p96==1))&&((i0.u5.p121==1)&&(u8.p158==1)))&&(((u10.p189==1)&&(u12.p220==1))&&((u14.p251==1)&&(i0.u5.p281==1))))...157
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((u1.p65==1)&&(u3.p96==1))&&((i0.u5.p121==1)&&(u8.p158==1)))&&(((u10.p189==1)&&(u12.p220...207
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 9
(forward)formula 0,1,9.6579,265504,1,0,335462,1550,3499,1.80357e+06,316,14318,799155
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 265 transition count 592
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 265 transition count 592
Applied a total of 18 rules in 7 ms. Remains 265 /274 variables (removed 9) and now considering 592/601 (removed 9) transitions.
// Phase 1: matrix 592 rows 265 cols
[2024-05-21 23:36:47] [INFO ] Computed 12 invariants in 2 ms
[2024-05-21 23:36:47] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-21 23:36:47] [INFO ] Invariant cache hit.
[2024-05-21 23:36:48] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-21 23:36:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 64 places in 492 ms of which 5 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 20 places in 368 ms of which 4 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 32 places in 320 ms of which 3 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 3 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 39 places in 313 ms of which 4 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 25 places in 481 ms of which 4 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 47 places in 395 ms of which 3 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 34 places in 378 ms of which 4 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 38 places in 377 ms of which 4 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 49 places in 369 ms of which 3 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 39 places in 426 ms of which 4 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 71 places in 432 ms of which 4 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 42 places in 422 ms of which 4 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 40 places in 398 ms of which 4 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 35 places in 352 ms of which 4 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 28 places in 412 ms of which 4 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 41 places in 399 ms of which 4 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 36 places in 405 ms of which 3 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 41 places in 375 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 46 places in 407 ms of which 4 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 31 places in 412 ms of which 4 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 4 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 4 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 4 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 4 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 37 places in 467 ms of which 4 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 57 places in 266 ms of which 3 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 50 places in 393 ms of which 4 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 46 places in 322 ms of which 4 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 47 places in 355 ms of which 4 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 57 places in 277 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 3 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 2 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 31 places in 351 ms of which 4 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 4 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 48 places in 337 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/857 variables, and 52 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 44 places in 403 ms of which 4 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 51 places in 418 ms of which 4 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 50 places in 415 ms of which 4 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 41 places in 339 ms of which 4 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 41 places in 333 ms of which 4 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 41 places in 317 ms of which 3 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 43 places in 297 ms of which 3 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 3 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 43 places in 306 ms of which 4 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 3 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 46 places in 271 ms of which 3 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 3 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 3 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 43 places in 276 ms of which 7 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 3 ms to minimize.
[2024-05-21 23:37:34] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 3 ms to minimize.
[2024-05-21 23:37:34] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 3 ms to minimize.
[2024-05-21 23:37:34] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 3 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 34 places in 365 ms of which 4 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 40 places in 371 ms of which 4 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 45 places in 344 ms of which 4 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 40 places in 325 ms of which 4 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 38 places in 383 ms of which 4 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 2 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 2 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 4 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 4 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 3 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 3 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 3 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 2 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 2 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 31 places in 336 ms of which 4 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 2 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 3 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 2 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 3 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/857 variables, and 97 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 85/85 constraints]
After SMT, in 61854ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 61861ms
Starting structural reductions in LTL mode, iteration 1 : 265/274 places, 592/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62566 ms. Remains : 265/274 places, 592/601 transitions.
[2024-05-21 23:37:50] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:37:50] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:37:50] [INFO ] Input system was already deterministic with 592 transitions.
[2024-05-21 23:37:50] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:37:50] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:37:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14573630203606650315.gal : 8 ms
[2024-05-21 23:37:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15383377719604526244.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/CTLFireability14573630203606650315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15383377719604526244.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:38:20] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:38:20] [INFO ] Applying decomposition
[2024-05-21 23:38:20] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17909702482374421449.txt' '-o' '/tmp/graph17909702482374421449.bin' '-w' '/tmp/graph17909702482374421449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17909702482374421449.bin' '-l' '-1' '-v' '-w' '/tmp/graph17909702482374421449.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:38:20] [INFO ] Decomposing Gal with order
[2024-05-21 23:38:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:38:20] [INFO ] Removed a total of 1600 redundant transitions.
[2024-05-21 23:38:20] [INFO ] Flatten gal took : 115 ms
[2024-05-21 23:38:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 10 ms.
[2024-05-21 23:38:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7247581783406877911.gal : 5 ms
[2024-05-21 23:38:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5589382501225903560.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/CTLFireability7247581783406877911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5589382501225903560.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 13 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 23:38:51] [INFO ] Computed 12 invariants in 2 ms
[2024-05-21 23:38:51] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 23:38:51] [INFO ] Invariant cache hit.
[2024-05-21 23:38:51] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-21 23:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 58 places in 430 ms of which 4 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 4 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 4 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 4 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 3 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 25 places in 482 ms of which 5 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 36 places in 363 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 3 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 40 places in 325 ms of which 4 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 4 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 39 places in 333 ms of which 4 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 55 places in 328 ms of which 4 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 45 places in 405 ms of which 4 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 57 places in 330 ms of which 4 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 37 places in 348 ms of which 3 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 3 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 4 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 4 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 21 places in 336 ms of which 4 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 14 places in 335 ms of which 4 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 45 places in 305 ms of which 4 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 4 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 42 places in 335 ms of which 4 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 3 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 3 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 4 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 3 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 4 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 47 places in 310 ms of which 4 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 3 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 3 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 4 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 42 places in 369 ms of which 4 ms to minimize.
SMT process timed out in 32759ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 32770ms
Starting structural reductions in LTL mode, iteration 1 : 264/274 places, 591/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33339 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-21 23:39:24] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:39:24] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:39:24] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-21 23:39:24] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:39:24] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:39:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9694743980968721979.gal : 7 ms
[2024-05-21 23:39:24] [INFO ] Time to serialize properties into /tmp/CTLFireability15018299233139715840.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/CTLFireability9694743980968721979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15018299233139715840.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 7 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 23:40:25] [INFO ] Computed 12 invariants in 2 ms
[2024-05-21 23:40:25] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 23:40:25] [INFO ] Invariant cache hit.
[2024-05-21 23:40:25] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-21 23:40:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 17 places in 501 ms of which 5 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 18 places in 419 ms of which 4 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 35 places in 464 ms of which 4 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 34 places in 454 ms of which 4 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 31 places in 434 ms of which 4 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 41 places in 411 ms of which 4 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 42 places in 401 ms of which 3 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 44 places in 375 ms of which 3 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 46 places in 311 ms of which 3 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 4 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 28 places in 380 ms of which 4 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 41 places in 402 ms of which 4 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 3 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 23 places in 300 ms of which 3 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 3 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 3 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 36 places in 365 ms of which 4 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 38 places in 381 ms of which 4 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 4 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 35 places in 404 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 32 places in 439 ms of which 4 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 3 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 40 places in 408 ms of which 4 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 46 places in 327 ms of which 3 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 47 places in 314 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 40 places in 426 ms of which 4 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 27 places in 388 ms of which 4 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 47 places in 373 ms of which 4 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 3 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 4 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 4 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 61 places in 369 ms of which 4 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 61 places in 337 ms of which 4 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 3 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 3 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 59 places in 257 ms of which 3 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 14 places in 459 ms of which 4 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 32 places in 308 ms of which 4 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 49 places in 395 ms of which 4 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 41 places in 319 ms of which 3 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 41 places in 304 ms of which 3 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 42 places in 353 ms of which 4 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 44 places in 288 ms of which 4 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 3 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 46 places in 276 ms of which 3 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 46 places in 277 ms of which 3 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 3 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 3 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 3 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 43 places in 324 ms of which 3 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 3 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 43 places in 319 ms of which 5 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 3 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 37 places in 426 ms of which 4 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 41 places in 423 ms of which 5 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 42 places in 321 ms of which 4 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 4 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 41 places in 369 ms of which 4 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 40 places in 361 ms of which 4 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 48 places in 338 ms of which 4 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 2 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 2 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 2 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 3 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 4 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 32 places in 391 ms of which 4 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 3 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 2 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 32 places in 374 ms of which 3 ms to minimize.
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 4 ms to minimize.
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 2 ms to minimize.
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 3 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:41:22] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 4 ms to minimize.
[2024-05-21 23:41:22] [INFO ] Deduced a trap composed of 32 places in 391 ms of which 4 ms to minimize.
[2024-05-21 23:41:24] [INFO ] Deduced a trap composed of 58 places in 253 ms of which 3 ms to minimize.
[2024-05-21 23:41:25] [INFO ] Deduced a trap composed of 38 places in 328 ms of which 3 ms to minimize.
[2024-05-21 23:41:26] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 2 ms to minimize.
[2024-05-21 23:41:26] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 2 ms to minimize.
[2024-05-21 23:41:27] [INFO ] Deduced a trap composed of 23 places in 405 ms of which 3 ms to minimize.
[2024-05-21 23:41:27] [INFO ] Deduced a trap composed of 25 places in 378 ms of which 3 ms to minimize.
[2024-05-21 23:41:27] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 2 ms to minimize.
[2024-05-21 23:41:28] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 3 ms to minimize.
SMT process timed out in 62613ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62624ms
Starting structural reductions in LTL mode, iteration 1 : 264/274 places, 591/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63193 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-21 23:41:28] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:41:28] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:41:28] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-21 23:41:28] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:41:28] [INFO ] Flatten gal took : 51 ms
[2024-05-21 23:41:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15544562383698629502.gal : 7 ms
[2024-05-21 23:41:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7741318900890534939.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/CTLFireability15544562383698629502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7741318900890534939.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 7 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 23:42:28] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:42:28] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 23:42:28] [INFO ] Invariant cache hit.
[2024-05-21 23:42:29] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-21 23:42:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 3 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 59 places in 313 ms of which 3 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 20 places in 314 ms of which 4 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 3 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 3 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 3 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 25 places in 462 ms of which 4 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 14 places in 374 ms of which 4 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 39 places in 356 ms of which 4 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 4 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 24 places in 372 ms of which 4 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 4 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 4 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 3 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 41 places in 325 ms of which 4 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 31 places in 363 ms of which 5 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 4 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 45 places in 330 ms of which 3 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 38 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 51 places in 314 ms of which 3 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 45 places in 358 ms of which 4 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 43 places in 334 ms of which 4 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 41 places in 340 ms of which 4 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 41 places in 340 ms of which 4 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 4 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 4 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 28 places in 350 ms of which 4 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 44 places in 347 ms of which 4 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 46 places in 328 ms of which 3 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 49 places in 312 ms of which 3 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 41 places in 359 ms of which 4 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 49 places in 427 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 3 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 3 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 59 places in 320 ms of which 3 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 4 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 31 places in 338 ms of which 4 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 4 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 4 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 3 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 3 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 3 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 38 places in 334 ms of which 4 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 4 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 3 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 3 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 40 places in 370 ms of which 4 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 42 places in 346 ms of which 4 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 4 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 41 places in 296 ms of which 3 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 42 places in 316 ms of which 3 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 37 places in 305 ms of which 3 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 48 places in 371 ms of which 3 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 45 places in 299 ms of which 3 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 31 places in 279 ms of which 3 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 48 places in 362 ms of which 4 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 15 places in 432 ms of which 4 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 32 places in 480 ms of which 4 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 36 places in 455 ms of which 10 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/855 variables, and 90 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 78/78 constraints]
After SMT, in 62367ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62374ms
Starting structural reductions in LTL mode, iteration 1 : 264/274 places, 591/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62857 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-21 23:43:31] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:43:31] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:43:31] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-21 23:43:31] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:43:31] [INFO ] Flatten gal took : 48 ms
[2024-05-21 23:43:31] [INFO ] Time to serialize gal into /tmp/CTLFireability664417783836939981.gal : 8 ms
[2024-05-21 23:43:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15258034760191041350.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/CTLFireability664417783836939981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15258034760191041350.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:44:01] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:44:01] [INFO ] Applying decomposition
[2024-05-21 23:44:02] [INFO ] Flatten gal took : 22 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/graph11933246643216293548.txt' '-o' '/tmp/graph11933246643216293548.bin' '-w' '/tmp/graph11933246643216293548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11933246643216293548.bin' '-l' '-1' '-v' '-w' '/tmp/graph11933246643216293548.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:44:02] [INFO ] Decomposing Gal with order
[2024-05-21 23:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:44:02] [INFO ] Removed a total of 1606 redundant transitions.
[2024-05-21 23:44:02] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2024-05-21 23:44:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4027449374351774442.gal : 3 ms
[2024-05-21 23:44:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17500181807532064733.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/CTLFireability4027449374351774442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17500181807532064733.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 6 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 23:44:32] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:44:32] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:44:32] [INFO ] Invariant cache hit.
[2024-05-21 23:44:32] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-21 23:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 20 places in 479 ms of which 5 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 14 places in 493 ms of which 5 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 27 places in 425 ms of which 4 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 68 places in 425 ms of which 4 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 34 places in 428 ms of which 4 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 38 places in 433 ms of which 4 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 37 places in 429 ms of which 4 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 43 places in 455 ms of which 4 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 40 places in 465 ms of which 5 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 42 places in 448 ms of which 5 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 46 places in 444 ms of which 7 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 21 places in 441 ms of which 4 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 42 places in 418 ms of which 4 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 38 places in 434 ms of which 4 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 4 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 49 places in 450 ms of which 4 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 32 places in 337 ms of which 3 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 38 places in 434 ms of which 4 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 4 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 38 places in 422 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 50 places in 418 ms of which 5 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 4 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 46 places in 394 ms of which 4 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 47 places in 379 ms of which 4 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 42 places in 378 ms of which 4 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 33 places in 382 ms of which 4 ms to minimize.
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 40 places in 389 ms of which 4 ms to minimize.
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 40 places in 393 ms of which 4 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 43 places in 381 ms of which 4 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 43 places in 359 ms of which 4 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 57 places in 366 ms of which 4 ms to minimize.
[2024-05-21 23:45:00] [INFO ] Deduced a trap composed of 37 places in 354 ms of which 3 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 32 places in 407 ms of which 3 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 28 places in 313 ms of which 3 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 2 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 3 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 3 ms to minimize.
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 44 places in 363 ms of which 4 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 41 places in 418 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 39 places in 366 ms of which 3 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 45 places in 359 ms of which 4 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 25 places in 388 ms of which 4 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 47 places in 390 ms of which 4 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 42 places in 370 ms of which 4 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 44 places in 350 ms of which 4 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 42 places in 346 ms of which 4 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 52 places in 461 ms of which 4 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 43 places in 338 ms of which 4 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 3 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 3 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 3 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 3 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 31 places in 412 ms of which 3 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 3 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 3 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 32 places in 437 ms of which 5 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 48 places in 382 ms of which 4 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 38 places in 370 ms of which 3 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 4 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 3 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 3 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 47 places in 382 ms of which 4 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 4 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 3 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 4 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 3 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 3 ms to minimize.
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 3 ms to minimize.
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 2 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 2 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 16/88 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 40 places in 418 ms of which 4 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 36 places in 393 ms of which 4 ms to minimize.
SMT process timed out in 62499ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62506ms
Starting structural reductions in LTL mode, iteration 1 : 264/274 places, 591/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62931 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-21 23:45:35] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:45:35] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:45:35] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-21 23:45:35] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:45:35] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:45:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3210972437601877733.gal : 7 ms
[2024-05-21 23:45:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18394427826333518261.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/CTLFireability3210972437601877733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18394427826333518261.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:46:05] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:46:05] [INFO ] Applying decomposition
[2024-05-21 23:46:05] [INFO ] Flatten gal took : 22 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/graph11907788937176580097.txt' '-o' '/tmp/graph11907788937176580097.bin' '-w' '/tmp/graph11907788937176580097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11907788937176580097.bin' '-l' '-1' '-v' '-w' '/tmp/graph11907788937176580097.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:46:05] [INFO ] Decomposing Gal with order
[2024-05-21 23:46:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:46:05] [INFO ] Removed a total of 1606 redundant transitions.
[2024-05-21 23:46:05] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:46:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 6 ms.
[2024-05-21 23:46:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4130996225480133171.gal : 3 ms
[2024-05-21 23:46:05] [INFO ] Time to serialize properties into /tmp/CTLFireability18268083171360097754.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/CTLFireability4130996225480133171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18268083171360097754.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,2.75983e+13,16.4098,536992,8872,122,425025,875,669,5.9136e+06,97,3358,0


Converting to forward existential form...Done !
original formula: E((AX((EX((i13.i0.u79.p260==1)) + E((((i12.u2.p6==1)&&(i12.u2.p19==1))&&((i3.u27.p92==1)&&(i12.u2.p280==1))) U (((i12.u2.p6==1)&&(i12.u2....1449
=> equivalent forward existential formula: [((FwdU(Init,(!(EX(!((EX((i13.i0.u79.p260==1)) + E((((i12.u2.p6==1)&&(i12.u2.p19==1))&&((i3.u27.p92==1)&&(i12.u2...2646
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 6 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 23:46:35] [INFO ] Computed 12 invariants in 2 ms
[2024-05-21 23:46:35] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-21 23:46:35] [INFO ] Invariant cache hit.
[2024-05-21 23:46:36] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-21 23:46:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 17 places in 445 ms of which 4 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 56 places in 413 ms of which 4 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 4 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 25 places in 394 ms of which 4 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 28 places in 410 ms of which 4 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 31 places in 392 ms of which 4 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 34 places in 402 ms of which 4 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 40 places in 367 ms of which 4 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 42 places in 598 ms of which 4 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 41 places in 476 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 52 places in 423 ms of which 4 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 39 places in 354 ms of which 4 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 37 places in 338 ms of which 4 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 38 places in 334 ms of which 4 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 42 places in 355 ms of which 3 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 36 places in 352 ms of which 4 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 20 places in 349 ms of which 4 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 4 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 37 places in 337 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 14 places in 368 ms of which 4 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 49 places in 360 ms of which 4 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 32 places in 373 ms of which 4 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 4 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 34 places in 357 ms of which 4 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 45 places in 378 ms of which 4 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 32 places in 354 ms of which 4 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 31 places in 351 ms of which 4 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 3 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 32 places in 308 ms of which 3 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 41 places in 297 ms of which 3 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 43 places in 332 ms of which 3 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 42 places in 277 ms of which 3 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 41 places in 286 ms of which 3 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 43 places in 294 ms of which 3 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 43 places in 279 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 47 places in 283 ms of which 3 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 43 places in 271 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 3 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 3 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 3 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 3 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 45 places in 343 ms of which 4 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 4 ms to minimize.
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 3 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 3 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 1 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 2 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 4 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 22 places in 325 ms of which 4 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 3 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 36 places in 403 ms of which 4 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:47:37] [INFO ] Deduced a trap composed of 41 places in 287 ms of which 3 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 3 ms to minimize.
SMT process timed out in 62671ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62681ms
Starting structural reductions in LTL mode, iteration 1 : 264/274 places, 591/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63501 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-21 23:47:39] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:47:39] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:47:39] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-21 23:47:39] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:47:39] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:47:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16759721271226709073.gal : 7 ms
[2024-05-21 23:47:39] [INFO ] Time to serialize properties into /tmp/CTLFireability12476645875494695306.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/CTLFireability16759721271226709073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12476645875494695306.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:48:09] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:48:09] [INFO ] Applying decomposition
[2024-05-21 23:48:09] [INFO ] Flatten gal took : 22 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/graph7912560825253179389.txt' '-o' '/tmp/graph7912560825253179389.bin' '-w' '/tmp/graph7912560825253179389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7912560825253179389.bin' '-l' '-1' '-v' '-w' '/tmp/graph7912560825253179389.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:48:09] [INFO ] Decomposing Gal with order
[2024-05-21 23:48:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:48:09] [INFO ] Removed a total of 1613 redundant transitions.
[2024-05-21 23:48:09] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:48:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 5 ms.
[2024-05-21 23:48:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2088966779860843818.gal : 3 ms
[2024-05-21 23:48:09] [INFO ] Time to serialize properties into /tmp/CTLFireability18206957544405304303.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/CTLFireability2088966779860843818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18206957544405304303.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,2.70292e+13,26.6405,815292,8579,122,640395,1002,628,8.96175e+06,95,6416,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 257 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 271 transition count 495
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 274 place count 143 transition count 453
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 274 place count 143 transition count 447
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 137 transition count 447
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 294 place count 129 transition count 439
Iterating global reduction 3 with 8 rules applied. Total rules applied 302 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 303 place count 128 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 306 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 127 transition count 430
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 399 place count 81 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 400 place count 81 transition count 383
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 413 place count 68 transition count 291
Iterating global reduction 6 with 13 rules applied. Total rules applied 426 place count 68 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 436 place count 68 transition count 281
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 441 place count 63 transition count 281
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 8 with 2 rules applied. Total rules applied 443 place count 62 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 62 transition count 279
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 62 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 447 place count 60 transition count 277
Applied a total of 447 rules in 73 ms. Remains 60 /274 variables (removed 214) and now considering 277/601 (removed 324) transitions.
// Phase 1: matrix 277 rows 60 cols
[2024-05-21 23:48:39] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 23:48:39] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 23:48:39] [INFO ] Invariant cache hit.
[2024-05-21 23:48:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:48:40] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [52, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 346 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/274 places, 277/601 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 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 276
Applied a total of 2 rules in 11 ms. Remains 57 /58 variables (removed 1) and now considering 276/277 (removed 1) transitions.
// Phase 1: matrix 276 rows 57 cols
[2024-05-21 23:48:40] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 23:48:40] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 23:48:40] [INFO ] Invariant cache hit.
[2024-05-21 23:48:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:48:40] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/274 places, 276/601 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 717 ms. Remains : 57/274 places, 276/601 transitions.
[2024-05-21 23:48:40] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:48:40] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:48:40] [INFO ] Input system was already deterministic with 276 transitions.
[2024-05-21 23:48:40] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:48:40] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:48:40] [INFO ] Time to serialize gal into /tmp/CTLFireability227499668218288093.gal : 3 ms
[2024-05-21 23:48:40] [INFO ] Time to serialize properties into /tmp/CTLFireability652633204523194655.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/CTLFireability227499668218288093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability652633204523194655.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:49:10] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:49:10] [INFO ] Applying decomposition
[2024-05-21 23:49:10] [INFO ] Flatten gal took : 21 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/graph15467960996429812892.txt' '-o' '/tmp/graph15467960996429812892.bin' '-w' '/tmp/graph15467960996429812892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15467960996429812892.bin' '-l' '-1' '-v' '-w' '/tmp/graph15467960996429812892.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:49:10] [INFO ] Decomposing Gal with order
[2024-05-21 23:49:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:49:10] [INFO ] Removed a total of 1309 redundant transitions.
[2024-05-21 23:49:10] [INFO ] Flatten gal took : 42 ms
[2024-05-21 23:49:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 10 ms.
[2024-05-21 23:49:10] [INFO ] Time to serialize gal into /tmp/CTLFireability10315023860976799046.gal : 2 ms
[2024-05-21 23:49:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7854611670600125307.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/CTLFireability10315023860976799046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7854611670600125307.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,2.75918e+07,0.510678,15312,927,46,19542,593,552,69387,67,2152,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((i9.u19.p320==1)||(((i8.u0.p6==1)&&(i8.u0.p14==1))&&((i7.u13.p240==1)&&(i8.u17.p280==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((i9.u19.p320==1)||(((i8.u0.p6==1)&&(i8.u0.p14==1))&&((i7.u13.p240==1)&&...191
Reverse transition relation is NOT exact ! Due to transitions t6, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55,...1046
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 9
(forward)formula 0,0,5.69476,160248,1,0,263323,1926,4717,717197,329,12345,630213
FORMULA AutonomousCar-PT-07b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 259 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 271 transition count 494
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 146 rules applied. Total rules applied 251 place count 167 transition count 452
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 276 place count 142 transition count 452
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 276 place count 142 transition count 446
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 288 place count 136 transition count 446
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 296 place count 128 transition count 438
Iterating global reduction 3 with 8 rules applied. Total rules applied 304 place count 128 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 127 transition count 431
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 127 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 308 place count 127 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 126 transition count 429
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 401 place count 80 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 402 place count 80 transition count 382
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 415 place count 67 transition count 290
Iterating global reduction 6 with 13 rules applied. Total rules applied 428 place count 67 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 438 place count 67 transition count 280
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 443 place count 62 transition count 280
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 8 with 2 rules applied. Total rules applied 445 place count 61 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 446 place count 61 transition count 278
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 447 place count 61 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 449 place count 59 transition count 276
Applied a total of 449 rules in 72 ms. Remains 59 /274 variables (removed 215) and now considering 276/601 (removed 325) transitions.
// Phase 1: matrix 276 rows 59 cols
[2024-05-21 23:49:16] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 23:49:16] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 23:49:16] [INFO ] Invariant cache hit.
[2024-05-21 23:49:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:49:16] [INFO ] Implicit Places using invariants and state equation in 202 ms returned [52, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 323 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/274 places, 276/601 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 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 275
Applied a total of 2 rules in 12 ms. Remains 56 /57 variables (removed 1) and now considering 275/276 (removed 1) transitions.
// Phase 1: matrix 275 rows 56 cols
[2024-05-21 23:49:16] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 23:49:17] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 23:49:17] [INFO ] Invariant cache hit.
[2024-05-21 23:49:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:49:17] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/274 places, 275/601 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 721 ms. Remains : 56/274 places, 275/601 transitions.
[2024-05-21 23:49:17] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:49:17] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:49:17] [INFO ] Input system was already deterministic with 275 transitions.
[2024-05-21 23:49:17] [INFO ] Flatten gal took : 58 ms
[2024-05-21 23:49:17] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:49:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7618489860688719932.gal : 3 ms
[2024-05-21 23:49:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1179883617967234636.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/ReachabilityCardinality7618489860688719932.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1179883617967234636.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 ...328
Loading property file /tmp/ReachabilityCardinality1179883617967234636.prop.
RANDOM walk for 40000 steps (2330 resets) in 772 ms. (51 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 78
BEST_FIRST walk for 34128 steps (166 resets) in 108 ms. (313 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-07b-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 10 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 23:49:17] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:49:17] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-21 23:49:17] [INFO ] Invariant cache hit.
[2024-05-21 23:49:18] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-21 23:49:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 26 places in 368 ms of which 4 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 14 places in 497 ms of which 5 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 3 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 18 places in 338 ms of which 3 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 66 places in 413 ms of which 4 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 3 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 22 places in 435 ms of which 4 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 38 places in 347 ms of which 3 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 33 places in 329 ms of which 3 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 32 places in 323 ms of which 3 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 31 places in 392 ms of which 4 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 2 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 3 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 3 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 44 places in 257 ms of which 3 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 2 ms to minimize.
[2024-05-21 23:49:38] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 4 ms to minimize.
[2024-05-21 23:49:38] [INFO ] Deduced a trap composed of 42 places in 327 ms of which 4 ms to minimize.
[2024-05-21 23:49:38] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 38 places in 399 ms of which 4 ms to minimize.
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 42 places in 403 ms of which 4 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 38 places in 405 ms of which 4 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 37 places in 416 ms of which 4 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 37 places in 417 ms of which 4 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 46 places in 424 ms of which 4 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 4 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 32 places in 431 ms of which 4 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 32 places in 412 ms of which 4 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 32 places in 404 ms of which 4 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 24 places in 400 ms of which 4 ms to minimize.
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 45 places in 306 ms of which 2 ms to minimize.
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 39 places in 315 ms of which 3 ms to minimize.
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 44 places in 315 ms of which 3 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 31 places in 419 ms of which 4 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 4 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 28 places in 429 ms of which 4 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 51 places in 334 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 50 places in 389 ms of which 4 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 4 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 36 places in 387 ms of which 3 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 4 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 41 places in 284 ms of which 3 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 3 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 2 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 3 ms to minimize.
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 41 places in 344 ms of which 4 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 3 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 2 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 3 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 43 places in 276 ms of which 3 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 3 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 2 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 3 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 40 places in 399 ms of which 3 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 2 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 41 places in 388 ms of which 3 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 65 places in 401 ms of which 4 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 3 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 3 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 31 places in 368 ms of which 4 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 3 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 2 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 2 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 3 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:50:09] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 4 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 3 ms to minimize.
[2024-05-21 23:50:10] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 3 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 45 places in 332 ms of which 4 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 31 places in 319 ms of which 3 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 32 places in 357 ms of which 4 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 3 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 4 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 15 places in 454 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/855 variables, and 94 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 82/82 constraints]
After SMT, in 62117ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62129ms
Starting structural reductions in LTL mode, iteration 1 : 264/274 places, 591/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62880 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-21 23:50:20] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:50:20] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:50:20] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-21 23:50:20] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:50:20] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:50:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15804619208622316402.gal : 7 ms
[2024-05-21 23:50:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6651222131185286832.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/CTLFireability15804619208622316402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6651222131185286832.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:51:21] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:51:21] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:51:21] [INFO ] Applying decomposition
[2024-05-21 23:51:21] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10872062087640122167.txt' '-o' '/tmp/graph10872062087640122167.bin' '-w' '/tmp/graph10872062087640122167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10872062087640122167.bin' '-l' '-1' '-v' '-w' '/tmp/graph10872062087640122167.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:51:21] [INFO ] Decomposing Gal with order
[2024-05-21 23:51:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:51:21] [INFO ] Removed a total of 1612 redundant transitions.
[2024-05-21 23:51:21] [INFO ] Flatten gal took : 71 ms
[2024-05-21 23:51:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 8 ms.
[2024-05-21 23:51:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11653738914496845706.gal : 5 ms
[2024-05-21 23:51:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6156789123711631233.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/CTLFireability11653738914496845706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6156789123711631233.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 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,3.27921e+13,471.799,6875592,14296,123,1.33714e+06,1880,715,9.02609e+07,99,13375,0


Converting to forward existential form...Done !
original formula: !(E(EF(!(((((i13.u21.p65==1)&&(i13.u30.p96==1))&&((i13.u37.p121==1)&&(i13.u50.p158==1)))&&(((i13.u60.p189==1)&&(i13.u66.p214==1))&&((i13....217
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(((((i13.u21.p65==1)&&(i13.u30.p96==1))&&((i13.u37.p121==1)&&(i13.u50.p158==1)))&&(((i13.u...271
Reverse transition relation is NOT exact ! Due to transitions t88, t115, t142, t169, t196, t224, t250, t257, t259, t263, t291, t424, t445, t598, i0.i1.t26,...931
ITS-tools command line returned an error code 137
[2024-05-22 00:09:49] [INFO ] Applying decomposition
[2024-05-22 00:09:49] [INFO ] Flatten gal took : 44 ms
[2024-05-22 00:09:49] [INFO ] Decomposing Gal with order
[2024-05-22 00:09:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:09:49] [INFO ] Removed a total of 1761 redundant transitions.
[2024-05-22 00:09:49] [INFO ] Flatten gal took : 70 ms
[2024-05-22 00:09:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 9 ms.
[2024-05-22 00:09:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13838480051384939477.gal : 4 ms
[2024-05-22 00:09:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1581606169484847711.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13838480051384939477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1581606169484847711.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 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,3.27921e+13,0.201693,6520,551,784,3189,2314,236,9323,265,13468,0


Converting to forward existential form...Done !
original formula: !(E(EF(!(((((i1.i0.i0.i0.i0.i0.i0.i0.u12.p65==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.u13.p96==1))&&((i1.i0.i0.i0.i0.i0.i0.u14.p121==1)&&(i1.i0.i0.i...322
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(((((i1.i0.i0.i0.i0.i0.i0.i0.u12.p65==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.u13.p96==1))&&((i1.i0.i...376
Reverse transition relation is NOT exact ! Due to transitions t330, i0.u2.t259, i0.u3.t257, i1.t598, i1.i0.u19.t34, i1.i0.u19.t37, i1.i0.u19.t38, i1.i0.u19...1662
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 00:13:02] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:13:02] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-22 00:13:02] [INFO ] Transformed 274 places.
[2024-05-22 00:13:02] [INFO ] Transformed 601 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:13:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7573283131705587039.gal : 4 ms
[2024-05-22 00:13:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3910613794395556816.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/CTLFireability7573283131705587039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3910613794395556816.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 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,3.27921e+13,155.372,2373720,2,418753,5,1.14172e+07,6,0,1699,5.66523e+06,0


Converting to forward existential form...Done !

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="AutonomousCar-PT-07b"
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 AutonomousCar-PT-07b, 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 r026-smll-171620167500322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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