fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r086-smll-174860102700514
Last Updated
June 24, 2025

About the Execution of ITS-Tools for FlexibleBarrier-PT-18a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 731466.00 0.00 0.00 TTFFTTFFFTTFFFFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102700514.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FlexibleBarrier-PT-18a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102700514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 265K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2023-12
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2023-13
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2023-14
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2023-15
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-00
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-01
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-02
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-03
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-04
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-05
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-06
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-07
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-08
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-09
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-10
FORMULA_NAME FlexibleBarrier-PT-18a-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748968543326

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 16:35:45] [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]
[2025-06-03 16:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 16:35:46] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2025-06-03 16:35:46] [INFO ] Transformed 219 places.
[2025-06-03 16:35:46] [INFO ] Transformed 886 transitions.
[2025-06-03 16:35:46] [INFO ] Found NUPN structural information;
[2025-06-03 16:35:46] [INFO ] Parsed PT model containing 219 places and 886 transitions and 4355 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Ensure Unique test removed 290 transitions
Reduce redundant transitions removed 290 transitions.
Support contains 67 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 596/596 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 219 transition count 578
Applied a total of 18 rules in 78 ms. Remains 219 /219 variables (removed 0) and now considering 578/596 (removed 18) transitions.
// Phase 1: matrix 578 rows 219 cols
[2025-06-03 16:35:46] [INFO ] Computed 20 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:35:47] [INFO ] Implicit Places using invariants in 728 ms returned []
[2025-06-03 16:35:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:35:47] [INFO ] State equation strengthened by 397 read => feed constraints.
[2025-06-03 16:35:48] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1685 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2025-06-03 16:35:48] [INFO ] Invariant cache hit.
[2025-06-03 16:35:48] [INFO ] State equation strengthened by 397 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/797 variables, and 855 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30067 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 577/1432 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/797 variables, and 1432 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30033 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61005ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 61043ms
Starting structural reductions in LTL mode, iteration 1 : 219/219 places, 578/596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62847 ms. Remains : 219/219 places, 578/596 transitions.
Support contains 67 out of 219 places after structural reductions.
[2025-06-03 16:36:49] [INFO ] Flatten gal took : 123 ms
[2025-06-03 16:36:49] [INFO ] Flatten gal took : 56 ms
[2025-06-03 16:36:50] [INFO ] Input system was already deterministic with 578 transitions.
Reduction of identical properties reduced properties to check from 77 to 75
RANDOM walk for 30537 steps (7 resets) in 2244 ms. (13 steps per ms) remains 0/75 properties
[2025-06-03 16:36:50] [INFO ] Flatten gal took : 39 ms
[2025-06-03 16:36:51] [INFO ] Flatten gal took : 42 ms
[2025-06-03 16:36:51] [INFO ] Input system was already deterministic with 578 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 16 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2025-06-03 16:36:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:36:51] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-03 16:36:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:36:51] [INFO ] State equation strengthened by 397 read => feed constraints.
[2025-06-03 16:36:52] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2025-06-03 16:36:52] [INFO ] Invariant cache hit.
[2025-06-03 16:36:52] [INFO ] State equation strengthened by 397 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/797 variables, and 855 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30029 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 577/1432 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/797 variables, and 1432 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30030 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Finished structural reductions in LTL mode , in 1 iterations and 61413 ms. Remains : 219/219 places, 578/578 transitions.
[2025-06-03 16:37:52] [INFO ] Flatten gal took : 33 ms
[2025-06-03 16:37:52] [INFO ] Flatten gal took : 30 ms
[2025-06-03 16:37:52] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-03 16:37:52] [INFO ] Flatten gal took : 28 ms
[2025-06-03 16:37:52] [INFO ] Flatten gal took : 25 ms
[2025-06-03 16:37:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14643220905422717877.gal : 27 ms
[2025-06-03 16:37:52] [INFO ] Time to serialize properties into /tmp/CTLFireability422338909861200347.ctl : 5 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14643220905422717877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability422338909861200347.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-03 16:38:22] [INFO ] Flatten gal took : 25 ms
[2025-06-03 16:38:23] [INFO ] Applying decomposition
[2025-06-03 16:38:23] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12048974941277379417.txt' '-o' '/tmp/graph12048974941277379417.bin' '-w' '/tmp/graph12048974941277379417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12048974941277379417.bin' '-l' '-1' '-v' '-w' '/tmp/graph12048974941277379417.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:38:23] [INFO ] Decomposing Gal with order
[2025-06-03 16:38:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:38:23] [INFO ] Removed a total of 917 redundant transitions.
[2025-06-03 16:38:23] [INFO ] Flatten gal took : 122 ms
[2025-06-03 16:38:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 28 ms.
[2025-06-03 16:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9653593876799133042.gal : 20 ms
[2025-06-03 16:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3229134942552016488.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9653593876799133042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3229134942552016488.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.66233e+19,0.175689,8460,148,23,9496,428,661,10458,57,660,0


Converting to forward existential form...Done !
original formula: AX((A(EF(EX((((i3.u14.p60==1)&&(i15.u47.p191==1))&&(i3.u8.p217==1)))) U (!(((((i0.u2.p12==1)&&(i5.u17.p71==1))&&(i3.u8.p217==1))||(((i3.u...648
=> equivalent forward existential formula: ((([((FwdU(EY(Init),!((!(((((i0.u2.p12==1)&&(i5.u17.p71==1))&&(i3.u8.p217==1))||(((i3.u8.p35==1)&&(i6.u20.p84==1...1509
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,0.440873,14988,1,0,23210,428,2952,38472,245,709,37101
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2025-06-03 16:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:38:24] [INFO ] Implicit Places using invariants in 371 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 5 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 218/219 places, 578/578 transitions.
[2025-06-03 16:38:24] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:38:24] [INFO ] Flatten gal took : 23 ms
[2025-06-03 16:38:24] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-03 16:38:24] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:38:24] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:38:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3585994250835123118.gal : 8 ms
[2025-06-03 16:38:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3082104764888785615.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3585994250835123118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3082104764888785615.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66233e+19,26.3796,546436,2,70317,5,3.3359e+06,6,0,1450,1.78842e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 16:38:54] [INFO ] Flatten gal took : 33 ms
[2025-06-03 16:38:54] [INFO ] Applying decomposition
[2025-06-03 16:38:54] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1833073617103628472.txt' '-o' '/tmp/graph1833073617103628472.bin' '-w' '/tmp/graph1833073617103628472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1833073617103628472.bin' '-l' '-1' '-v' '-w' '/tmp/graph1833073617103628472.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:38:54] [INFO ] Decomposing Gal with order
[2025-06-03 16:38:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:38:54] [INFO ] Removed a total of 848 redundant transitions.
[2025-06-03 16:38:54] [INFO ] Flatten gal took : 51 ms
[2025-06-03 16:38:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-03 16:38:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10169821002173504346.gal : 6 ms
[2025-06-03 16:38:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13792051469732258391.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10169821002173504346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13792051469732258391.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66233e+19,0.153428,7876,170,19,7847,298,632,8964,44,467,0


Converting to forward existential form...Done !
original formula: EF(!(E(AG(EX((i7.u31.p77==1))) U !(((AF((i7.u33.p82==1)) * ((((i6.u28.p71==1)&&(i14.u67.p168==1))&&(i1.u14.p217==1))||(((i1.u57.p144==1)&...379
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(E(TRUE U !(EX((i7.u31.p77==1))))) U !(((!(EG(!((i7.u33.p82==1)))) * ((((i6.u28.p71==1)...449
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,0.273793,9412,1,0,8576,298,2869,24262,168,467,12924
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 165 edges and 219 vertex of which 39 / 219 are part of one of the 13 SCC in 4 ms
Free SCC test removed 26 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 178 transition count 471
Drop transitions (Redundant composition of simpler transitions.) removed 203 transitions
Redundant transition composition rules discarded 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 234 place count 178 transition count 268
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 236 place count 178 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 238 place count 176 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 240 place count 176 transition count 266
Applied a total of 240 rules in 151 ms. Remains 176 /219 variables (removed 43) and now considering 266/578 (removed 312) transitions.
[2025-06-03 16:38:55] [INFO ] Flow matrix only has 254 transitions (discarded 12 similar events)
// Phase 1: matrix 254 rows 176 cols
[2025-06-03 16:38:55] [INFO ] Computed 20 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:38:55] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-03 16:38:55] [INFO ] Flow matrix only has 254 transitions (discarded 12 similar events)
[2025-06-03 16:38:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:38:55] [INFO ] State equation strengthened by 129 read => feed constraints.
[2025-06-03 16:38:56] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 16:38:56] [INFO ] Redundant transitions in 25 ms returned []
Running 265 sub problems to find dead transitions.
[2025-06-03 16:38:56] [INFO ] Flow matrix only has 254 transitions (discarded 12 similar events)
[2025-06-03 16:38:56] [INFO ] Invariant cache hit.
[2025-06-03 16:38:56] [INFO ] State equation strengthened by 129 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 253/429 variables, 176/196 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 128/324 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/430 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/430 variables, and 325 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 176/176 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 253/429 variables, 176/196 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 128/324 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 265/589 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/430 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 0)
(t5 0)
(t6 1)
(t7 1)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 1)
(t13 1)
(t14 2)
(t15 0)
(t16 1)
(t17 0)
(t18 2)
(t19 0)
(t20 1)
(t21 1)
(t22 1)
(t23 1)
(t24 1)
(t25 0)
(t26 2)
(t27 0)
(t28 1)
(t29 0)
(t30 2)
(t31 0)
(t32 1)
(t33 1)
(t34 0)
(t35 1)
(t36 1)
(t37 1)
(t38 0)
(t39 1)
(t40 2)
(t41 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 590 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 176/176 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in SI_CTL mode, iteration 1 : 176/219 places, 266/578 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60959 ms. Remains : 176/219 places, 266/578 transitions.
[2025-06-03 16:39:56] [INFO ] Flatten gal took : 11 ms
[2025-06-03 16:39:56] [INFO ] Flatten gal took : 12 ms
[2025-06-03 16:39:56] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-03 16:39:56] [INFO ] Flatten gal took : 11 ms
[2025-06-03 16:39:56] [INFO ] Flatten gal took : 11 ms
[2025-06-03 16:39:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10356803286291721127.gal : 3 ms
[2025-06-03 16:39:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15830025085626044960.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10356803286291721127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15830025085626044960.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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,4.46585e+17,3.89268,91688,2,2741,5,649463,6,0,955,211234,0


Converting to forward existential form...Done !
original formula: EF(((((p36==1)&&(p47==1)) * ((p217==1) * AG((p89==1)))) * ((AF(((p117==0)||(p218==0))) + EG((((p59==1)&&(p120==1))&&(p217==1)))) + EG(AF(...193
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (((p36==1)&&(p47==1)) * ((p217==1) * !(E(TRUE U !((p89==1))))))) * !(EG(!(((p117==0)||(p2...463
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,4.72939,91688,1,0,12,649463,45,2,4732,211234,13
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2025-06-03 16:40:01] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:40:01] [INFO ] Implicit Places using invariants in 299 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 301 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 6 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 311 ms. Remains : 218/219 places, 578/578 transitions.
[2025-06-03 16:40:01] [INFO ] Flatten gal took : 26 ms
[2025-06-03 16:40:01] [INFO ] Flatten gal took : 16 ms
[2025-06-03 16:40:01] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-03 16:40:01] [INFO ] Flatten gal took : 13 ms
[2025-06-03 16:40:01] [INFO ] Flatten gal took : 15 ms
[2025-06-03 16:40:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5195699630646900863.gal : 5 ms
[2025-06-03 16:40:01] [INFO ] Time to serialize properties into /tmp/CTLFireability18036045227599516031.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5195699630646900863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18036045227599516031.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.66233e+19,27.4054,545628,2,70317,5,3.3359e+06,6,0,1450,1.78842e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 16:40:31] [INFO ] Flatten gal took : 23 ms
[2025-06-03 16:40:31] [INFO ] Applying decomposition
[2025-06-03 16:40:31] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph4145909553441129015.txt' '-o' '/tmp/graph4145909553441129015.bin' '-w' '/tmp/graph4145909553441129015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4145909553441129015.bin' '-l' '-1' '-v' '-w' '/tmp/graph4145909553441129015.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:40:31] [INFO ] Decomposing Gal with order
[2025-06-03 16:40:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:40:31] [INFO ] Removed a total of 849 redundant transitions.
[2025-06-03 16:40:31] [INFO ] Flatten gal took : 58 ms
[2025-06-03 16:40:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 15 ms.
[2025-06-03 16:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9891409397357711167.gal : 8 ms
[2025-06-03 16:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability8492673063078237128.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9891409397357711167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8492673063078237128.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.66233e+19,0.224187,7788,160,19,7827,298,586,8846,44,446,0


Converting to forward existential form...Done !
original formula: AG(A(!(EF(AX((((i0.u4.p11==1)&&(i8.u38.p96==1))&&(i2.u9.p217==1))))) U ((((i2.u48.p120==1)||(!((((i6.u29.p72==1)&&(i2.u34.p83==1))&&((i2....436
=> equivalent forward existential formula: ([(EY(((((FwdU(FwdU(Init,TRUE),!(((((i2.u48.p120==1)||(!((((i6.u29.p72==1)&&(i2.u34.p83==1))&&((i2.u9.p217==1)&&...1265
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,0.435931,9708,1,0,8604,298,2523,28686,170,446,11380
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2025-06-03 16:40:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:40:32] [INFO ] Implicit Places using invariants in 359 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 371 ms. Remains : 218/219 places, 578/578 transitions.
[2025-06-03 16:40:32] [INFO ] Flatten gal took : 17 ms
[2025-06-03 16:40:32] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:40:32] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-03 16:40:32] [INFO ] Flatten gal took : 19 ms
[2025-06-03 16:40:32] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:40:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15403994730190647705.gal : 4 ms
[2025-06-03 16:40:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10750411711244717305.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15403994730190647705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10750411711244717305.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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.66233e+19,29.5171,545940,2,70317,5,3.3359e+06,6,0,1450,1.78842e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 16:41:02] [INFO ] Flatten gal took : 16 ms
[2025-06-03 16:41:02] [INFO ] Applying decomposition
[2025-06-03 16:41:02] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4476237666235978362.txt' '-o' '/tmp/graph4476237666235978362.bin' '-w' '/tmp/graph4476237666235978362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4476237666235978362.bin' '-l' '-1' '-v' '-w' '/tmp/graph4476237666235978362.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:41:02] [INFO ] Decomposing Gal with order
[2025-06-03 16:41:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:41:03] [INFO ] Removed a total of 850 redundant transitions.
[2025-06-03 16:41:03] [INFO ] Flatten gal took : 52 ms
[2025-06-03 16:41:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-03 16:41:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10003782716315819982.gal : 7 ms
[2025-06-03 16:41:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15442338811049522811.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10003782716315819982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15442338811049522811.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66233e+19,0.202002,7620,149,17,7159,285,620,7853,42,421,0


Converting to forward existential form...Done !
original formula: EF(EX(AG((((i7.u34.p83==1)&&(i14.u68.p168==1))&&(i2.u9.p217==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((((i7.u34.p83==1)&&(i14.u68.p168==1))&&(i2.u9.p217==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.263175,7748,1,0,7159,285,2341,7853,142,421,5813
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 173 edges and 219 vertex of which 48 / 219 are part of one of the 16 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 170 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 182 transitions
Redundant transition composition rules discarded 182 transitions
Iterating global reduction 0 with 182 rules applied. Total rules applied 217 place count 170 transition count 242
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 170 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 169 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 169 transition count 241
Applied a total of 220 rules in 84 ms. Remains 169 /219 variables (removed 50) and now considering 241/578 (removed 337) transitions.
[2025-06-03 16:41:03] [INFO ] Flow matrix only has 226 transitions (discarded 15 similar events)
// Phase 1: matrix 226 rows 169 cols
[2025-06-03 16:41:03] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:03] [INFO ] Implicit Places using invariants in 217 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 219 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 168/219 places, 241/578 transitions.
Graph (trivial) has 213 edges and 168 vertex of which 81 / 168 are part of one of the 18 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 105 transition count 128
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 85 transition count 128
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 41 place count 85 transition count 110
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 77 place count 67 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 92 place count 67 transition count 95
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 122 place count 52 transition count 80
Applied a total of 122 rules in 29 ms. Remains 52 /168 variables (removed 116) and now considering 80/241 (removed 161) transitions.
[2025-06-03 16:41:03] [INFO ] Flow matrix only has 62 transitions (discarded 18 similar events)
// Phase 1: matrix 62 rows 52 cols
[2025-06-03 16:41:03] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-03 16:41:03] [INFO ] Flow matrix only has 62 transitions (discarded 18 similar events)
[2025-06-03 16:41:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-03 16:41:03] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 52/219 places, 80/578 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 508 ms. Remains : 52/219 places, 80/578 transitions.
[2025-06-03 16:41:03] [INFO ] Flatten gal took : 3 ms
[2025-06-03 16:41:03] [INFO ] Flatten gal took : 3 ms
[2025-06-03 16:41:03] [INFO ] Input system was already deterministic with 80 transitions.
[2025-06-03 16:41:03] [INFO ] Flatten gal took : 2 ms
[2025-06-03 16:41:03] [INFO ] Flatten gal took : 3 ms
[2025-06-03 16:41:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15124488322284154111.gal : 1 ms
[2025-06-03 16:41:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3275391678809977198.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15124488322284154111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3275391678809977198.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3275391678809977198.prop.
RANDOM walk for 3334 steps (0 resets) in 68 ms. (48 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 405
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :405 after 481
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 164 edges and 219 vertex of which 39 / 219 are part of one of the 13 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 177 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 191 transitions
Redundant transition composition rules discarded 191 transitions
Iterating global reduction 0 with 191 rules applied. Total rules applied 224 place count 177 transition count 279
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 227 place count 177 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 228 place count 176 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 229 place count 176 transition count 278
Applied a total of 229 rules in 57 ms. Remains 176 /219 variables (removed 43) and now considering 278/578 (removed 300) transitions.
[2025-06-03 16:41:03] [INFO ] Flow matrix only has 254 transitions (discarded 24 similar events)
// Phase 1: matrix 254 rows 176 cols
[2025-06-03 16:41:03] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:04] [INFO ] Implicit Places using invariants in 144 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 175/219 places, 278/578 transitions.
Graph (trivial) has 209 edges and 175 vertex of which 70 / 175 are part of one of the 17 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 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 0 with 21 rules applied. Total rules applied 22 place count 122 transition count 180
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 101 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 100 transition count 179
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 45 place count 100 transition count 161
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 81 place count 82 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 81 transition count 160
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 81 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 95 place count 81 transition count 148
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 119 place count 69 transition count 136
Applied a total of 119 rules in 19 ms. Remains 69 /175 variables (removed 106) and now considering 136/278 (removed 142) transitions.
[2025-06-03 16:41:04] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
// Phase 1: matrix 107 rows 69 cols
[2025-06-03 16:41:04] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:04] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-03 16:41:04] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2025-06-03 16:41:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-03 16:41:04] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 69/219 places, 136/578 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 356 ms. Remains : 69/219 places, 136/578 transitions.
[2025-06-03 16:41:04] [INFO ] Flatten gal took : 3 ms
[2025-06-03 16:41:04] [INFO ] Flatten gal took : 2 ms
[2025-06-03 16:41:04] [INFO ] Input system was already deterministic with 136 transitions.
[2025-06-03 16:41:04] [INFO ] Flatten gal took : 3 ms
[2025-06-03 16:41:04] [INFO ] Flatten gal took : 3 ms
[2025-06-03 16:41:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6142448570992715562.gal : 2 ms
[2025-06-03 16:41:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8816779326796899753.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6142448570992715562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8816779326796899753.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.31063e+08,0.042607,5056,2,626,5,5631,6,0,393,3292,0


Converting to forward existential form...Done !
original formula: EG((EG((((p35==1)&&(p180==1))&&(p217==1))) + E(E((AF((p183==1)) + (p179!=1)) U !(E((((p119==1)&&(p180==1))&&(p217==1)) U (((p11==1)&&(p19...195
=> equivalent forward existential formula: [FwdG(Init,(EG((((p35==1)&&(p180==1))&&(p217==1))) + E(E((!(EG(!((p183==1)))) + (p179!=1)) U !(E((((p119==1)&&(p...244
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 81/81/55
(forward)formula 0,1,1.27309,35984,1,0,147,143369,52,101,2154,203854,118
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 5 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2025-06-03 16:41:05] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:05] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-06-03 16:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:06] [INFO ] State equation strengthened by 397 read => feed constraints.
[2025-06-03 16:41:06] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2025-06-03 16:41:06] [INFO ] Invariant cache hit.
[2025-06-03 16:41:06] [INFO ] State equation strengthened by 397 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/797 variables, and 855 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30031 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 577/1432 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/797 variables, and 1432 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30032 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60346ms
Finished structural reductions in LTL mode , in 1 iterations and 61548 ms. Remains : 219/219 places, 578/578 transitions.
[2025-06-03 16:42:07] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:42:07] [INFO ] Flatten gal took : 26 ms
[2025-06-03 16:42:07] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-03 16:42:07] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:42:07] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:42:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1418789472096323108.gal : 7 ms
[2025-06-03 16:42:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10614172743957899793.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1418789472096323108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10614172743957899793.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-03 16:42:37] [INFO ] Flatten gal took : 12 ms
[2025-06-03 16:42:37] [INFO ] Applying decomposition
[2025-06-03 16:42:37] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph778140264817113901.txt' '-o' '/tmp/graph778140264817113901.bin' '-w' '/tmp/graph778140264817113901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph778140264817113901.bin' '-l' '-1' '-v' '-w' '/tmp/graph778140264817113901.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:42:37] [INFO ] Decomposing Gal with order
[2025-06-03 16:42:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:42:37] [INFO ] Removed a total of 917 redundant transitions.
[2025-06-03 16:42:37] [INFO ] Flatten gal took : 30 ms
[2025-06-03 16:42:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 10 ms.
[2025-06-03 16:42:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16480230486044596621.gal : 4 ms
[2025-06-03 16:42:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11269779371000417221.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16480230486044596621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11269779371000417221.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66233e+19,0.155716,8728,150,23,10292,361,663,10835,57,547,0


Converting to forward existential form...Done !
original formula: (EF(((AG(((((i5.u15.p61==0)||(i3.u11.p48==0))||((i8.u26.p107==0)||(i2.u5.p217==0)))||(i8.u26.p108==1))) * EF(((i0.u0.p4==1)&&(i1.i0.u3.p2...259
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((!(E(TRUE U !(((((i5.u15.p61==0)||(i3.u11.p48==0))||((i8.u26.p107==0)||(i2.u5.p217==0))...353
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.193543,8856,1,0,10292,361,2482,10835,221,547,5140
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-07 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 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2025-06-03 16:42:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:42:37] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-03 16:42:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:42:38] [INFO ] State equation strengthened by 397 read => feed constraints.
[2025-06-03 16:42:38] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2025-06-03 16:42:38] [INFO ] Invariant cache hit.
[2025-06-03 16:42:38] [INFO ] State equation strengthened by 397 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/797 variables, and 855 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30026 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 577/1432 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/797 variables, and 1432 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30026 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Finished structural reductions in LTL mode , in 1 iterations and 61140 ms. Remains : 219/219 places, 578/578 transitions.
[2025-06-03 16:43:38] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:43:38] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:43:39] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-03 16:43:39] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:43:39] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:43:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5582419375066036571.gal : 4 ms
[2025-06-03 16:43:39] [INFO ] Time to serialize properties into /tmp/CTLFireability18102500831540408073.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5582419375066036571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18102500831540408073.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-03 16:44:09] [INFO ] Flatten gal took : 12 ms
[2025-06-03 16:44:09] [INFO ] Applying decomposition
[2025-06-03 16:44:09] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16721289122894732515.txt' '-o' '/tmp/graph16721289122894732515.bin' '-w' '/tmp/graph16721289122894732515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16721289122894732515.bin' '-l' '-1' '-v' '-w' '/tmp/graph16721289122894732515.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:44:09] [INFO ] Decomposing Gal with order
[2025-06-03 16:44:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:44:09] [INFO ] Removed a total of 917 redundant transitions.
[2025-06-03 16:44:09] [INFO ] Flatten gal took : 29 ms
[2025-06-03 16:44:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 12 ms.
[2025-06-03 16:44:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1124944664059147830.gal : 5 ms
[2025-06-03 16:44:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7052294708774878331.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1124944664059147830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7052294708774878331.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.66233e+19,0.217898,9628,143,23,12081,394,659,16281,57,678,0


Converting to forward existential form...Done !
original formula: A((E(E(AF((((i4.u11.p48==1)&&(i14.u47.p191==1))&&(i1.u2.p217==1))) U (EF((i11.u33.p133==1)) * EX(((i12.u38.p153==1)&&(i0.i0.u0.p218==1)))...980
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(EG(!((((i3.u8.p35==1)&&(i1.u44.p180==1))&&(i1.u2.p217==1)))))) * E(!((E(!(EX((((i1.u44.p18...2469
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,0.554259,17180,1,0,24352,394,3115,55609,259,689,32353
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 168 edges and 219 vertex of which 39 / 219 are part of one of the 13 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 177 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 203 transitions
Redundant transition composition rules discarded 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 236 place count 177 transition count 267
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 238 place count 177 transition count 267
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 240 place count 175 transition count 265
Iterating global reduction 0 with 2 rules applied. Total rules applied 242 place count 175 transition count 265
Applied a total of 242 rules in 65 ms. Remains 175 /219 variables (removed 44) and now considering 265/578 (removed 313) transitions.
[2025-06-03 16:44:09] [INFO ] Flow matrix only has 253 transitions (discarded 12 similar events)
// Phase 1: matrix 253 rows 175 cols
[2025-06-03 16:44:09] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:44:10] [INFO ] Implicit Places using invariants in 280 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 283 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 174/219 places, 265/578 transitions.
Graph (trivial) has 216 edges and 174 vertex of which 75 / 174 are part of one of the 18 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 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 0 with 23 rules applied. Total rules applied 24 place count 117 transition count 159
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 94 transition count 159
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 47 place count 94 transition count 141
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 83 place count 76 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 96 place count 76 transition count 128
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 122 place count 63 transition count 115
Applied a total of 122 rules in 17 ms. Remains 63 /174 variables (removed 111) and now considering 115/265 (removed 150) transitions.
[2025-06-03 16:44:10] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
// Phase 1: matrix 98 rows 63 cols
[2025-06-03 16:44:10] [INFO ] Computed 19 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:44:10] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-03 16:44:10] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2025-06-03 16:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:44:10] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-03 16:44:10] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 63/219 places, 115/578 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 646 ms. Remains : 63/219 places, 115/578 transitions.
[2025-06-03 16:44:10] [INFO ] Flatten gal took : 2 ms
[2025-06-03 16:44:10] [INFO ] Flatten gal took : 3 ms
[2025-06-03 16:44:10] [INFO ] Input system was already deterministic with 115 transitions.
[2025-06-03 16:44:10] [INFO ] Flatten gal took : 3 ms
[2025-06-03 16:44:10] [INFO ] Flatten gal took : 2 ms
[2025-06-03 16:44:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2575375671982886484.gal : 1 ms
[2025-06-03 16:44:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14126292411273059932.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2575375671982886484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14126292411273059932.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.37683e+08,0.037858,4892,2,483,5,4683,6,0,349,3322,0


Converting to forward existential form...Done !
original formula: EF(EG((AG((((p131==1)&&(p168==1))&&(p217==1))) * A((((p47==1)&&(p60==1))&&(p217==1)) U (((p23==1)&&(p168==1))&&(p217==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !((((p131==1)&&(p168==1))&&(p217==1))))) * !((E(!((((p23==1)&&(p168==1))&&(p21...302
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 72/0/43
(forward)formula 0,0,0.143366,8220,1,0,10,25083,34,1,1937,9680,13
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2025-06-03 16:44:10] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:44:10] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-03 16:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:44:11] [INFO ] State equation strengthened by 397 read => feed constraints.
[2025-06-03 16:44:11] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2025-06-03 16:44:11] [INFO ] Invariant cache hit.
[2025-06-03 16:44:11] [INFO ] State equation strengthened by 397 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/797 variables, and 855 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30025 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 577/1432 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/797 variables, and 1432 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30028 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Finished structural reductions in LTL mode , in 1 iterations and 60991 ms. Remains : 219/219 places, 578/578 transitions.
[2025-06-03 16:45:11] [INFO ] Flatten gal took : 17 ms
[2025-06-03 16:45:11] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:45:11] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-03 16:45:11] [INFO ] Flatten gal took : 19 ms
[2025-06-03 16:45:11] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:45:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14404997157484107745.gal : 4 ms
[2025-06-03 16:45:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8262808595968682596.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14404997157484107745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8262808595968682596.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-03 16:45:41] [INFO ] Flatten gal took : 13 ms
[2025-06-03 16:45:41] [INFO ] Applying decomposition
[2025-06-03 16:45:41] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7943843382522565623.txt' '-o' '/tmp/graph7943843382522565623.bin' '-w' '/tmp/graph7943843382522565623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7943843382522565623.bin' '-l' '-1' '-v' '-w' '/tmp/graph7943843382522565623.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:45:41] [INFO ] Decomposing Gal with order
[2025-06-03 16:45:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:45:42] [INFO ] Removed a total of 917 redundant transitions.
[2025-06-03 16:45:42] [INFO ] Flatten gal took : 31 ms
[2025-06-03 16:45:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 9 ms.
[2025-06-03 16:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability15050995615306865530.gal : 4 ms
[2025-06-03 16:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8113393033699151405.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15050995615306865530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8113393033699151405.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.66233e+19,0.175243,8784,113,23,10454,508,629,11404,57,1414,0


Converting to forward existential form...Done !
original formula: EF(((AX(((((i3.u9.p38==1)&&(i6.i2.u21.p218==1))&&((i1.u5.p24==1)&&(i8.u29.p119==1))) * ((i2.u8.p217==1) * E(((i11.u38.p153==1)&&(i6.i2.u2...622
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!(EX(!(((((i3.u9.p38==1)&&(i6.i2.u21.p218==1))&&((i1.u5.p24==1)&&(i8.u29.p119==1))) * ((...1292
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.323847,11088,1,0,11807,508,2525,27397,219,1414,17778
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 158 edges and 219 vertex of which 33 / 219 are part of one of the 11 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 183 transition count 497
Drop transitions (Redundant composition of simpler transitions.) removed 202 transitions
Redundant transition composition rules discarded 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 231 place count 183 transition count 295
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 237 place count 183 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 242 place count 178 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 247 place count 178 transition count 290
Applied a total of 247 rules in 57 ms. Remains 178 /219 variables (removed 41) and now considering 290/578 (removed 288) transitions.
[2025-06-03 16:45:42] [INFO ] Flow matrix only has 280 transitions (discarded 10 similar events)
// Phase 1: matrix 280 rows 178 cols
[2025-06-03 16:45:42] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:45:42] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-03 16:45:42] [INFO ] Flow matrix only has 280 transitions (discarded 10 similar events)
[2025-06-03 16:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:45:42] [INFO ] State equation strengthened by 153 read => feed constraints.
[2025-06-03 16:45:43] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 16:45:43] [INFO ] Redundant transitions in 6 ms returned []
Running 289 sub problems to find dead transitions.
[2025-06-03 16:45:43] [INFO ] Flow matrix only has 280 transitions (discarded 10 similar events)
[2025-06-03 16:45:43] [INFO ] Invariant cache hit.
[2025-06-03 16:45:43] [INFO ] State equation strengthened by 153 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 279/457 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 152/350 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/458 variables, and 351 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 178/178 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 279/457 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 152/350 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 289/639 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/458 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 640 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 178/178 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in SI_CTL mode, iteration 1 : 178/219 places, 290/578 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60737 ms. Remains : 178/219 places, 290/578 transitions.
[2025-06-03 16:46:43] [INFO ] Flatten gal took : 9 ms
[2025-06-03 16:46:43] [INFO ] Flatten gal took : 8 ms
[2025-06-03 16:46:43] [INFO ] Input system was already deterministic with 290 transitions.
[2025-06-03 16:46:43] [INFO ] Flatten gal took : 9 ms
[2025-06-03 16:46:43] [INFO ] Flatten gal took : 8 ms
[2025-06-03 16:46:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1589163330958518574.gal : 2 ms
[2025-06-03 16:46:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12843534475578816221.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1589163330958518574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12843534475578816221.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.55935e+17,5.84221,120776,2,4623,5,789219,6,0,989,334267,0


Converting to forward existential form...Done !
original formula: AG(AF((A((((p30==1)&&(p217==1))&&((((p84==1)&&(p119==1))&&(p217==1))||(((p35==1)&&(p48==1))&&(p217==1)))) U (E((((p71==1)&&(p156==1))&&(p...245
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!((E(!((E((((p71==1)&&(p156==1))&&(p217==1)) U (p37==1)) + !(((p110==1)&&(p218==1))))) ...482
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 225/105/65
Using saturation style SCC detection
(forward)formula 0,0,8.86192,120776,1,0,19,789219,33,9,5427,334267,20
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2025-06-03 16:46:52] [INFO ] Computed 20 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:46:52] [INFO ] Implicit Places using invariants in 316 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 320 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 2 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 328 ms. Remains : 218/219 places, 578/578 transitions.
[2025-06-03 16:46:52] [INFO ] Flatten gal took : 17 ms
[2025-06-03 16:46:52] [INFO ] Flatten gal took : 19 ms
[2025-06-03 16:46:52] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-03 16:46:52] [INFO ] Flatten gal took : 18 ms
[2025-06-03 16:46:52] [INFO ] Flatten gal took : 18 ms
[2025-06-03 16:46:52] [INFO ] Time to serialize gal into /tmp/CTLFireability17882778386739493753.gal : 4 ms
[2025-06-03 16:46:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16293963673307515629.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17882778386739493753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16293963673307515629.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-03 16:47:22] [INFO ] Flatten gal took : 11 ms
[2025-06-03 16:47:22] [INFO ] Applying decomposition
[2025-06-03 16:47:22] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13862920271391374971.txt' '-o' '/tmp/graph13862920271391374971.bin' '-w' '/tmp/graph13862920271391374971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13862920271391374971.bin' '-l' '-1' '-v' '-w' '/tmp/graph13862920271391374971.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:47:22] [INFO ] Decomposing Gal with order
[2025-06-03 16:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:47:22] [INFO ] Removed a total of 849 redundant transitions.
[2025-06-03 16:47:22] [INFO ] Flatten gal took : 30 ms
[2025-06-03 16:47:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-06-03 16:47:22] [INFO ] Time to serialize gal into /tmp/CTLFireability454800372747294758.gal : 4 ms
[2025-06-03 16:47:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6054179974729186964.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability454800372747294758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6054179974729186964.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66233e+19,0.101845,6636,153,17,3041,282,613,3866,44,469,0


Converting to forward existential form...Done !
original formula: EX((((i0.u4.p12==0)||(i2.u9.p23==0)) + ((i2.u9.p217==0) + ((E((((i0.u4.p12==1)&&(i16.u77.p191==1))&&(i2.u9.p217==1)) U (((i0.u4.p12==1)&&...308
=> equivalent forward existential formula: ([(EY(Init) * ((i0.u4.p12==0)||(i2.u9.p23==0)))] != FALSE + ([(EY(Init) * (i2.u9.p217==0))] != FALSE + [(((EY(In...505
(forward)formula 0,1,0.10814,6764,1,0,3041,282,864,3866,55,469,587
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 178 edges and 219 vertex of which 54 / 219 are part of one of the 18 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 249 edges and 180 vertex of which 178 / 180 are part of one of the 18 SCC in 1 ms
Free SCC test removed 160 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 20 transition count 405
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 399 transitions.
Iterating post reduction 1 with 416 rules applied. Total rules applied 420 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 422 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 422 place count 3 transition count 3
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 424 place count 2 transition count 3
Applied a total of 424 rules in 11 ms. Remains 2 /219 variables (removed 217) and now considering 3/578 (removed 575) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-06-03 16:47:22] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:47:22] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 16:47:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:47:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 16:47:22] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-03 16:47:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/219 places, 3/578 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 164 ms. Remains : 2/219 places, 3/578 transitions.
[2025-06-03 16:47:23] [INFO ] Flatten gal took : 0 ms
[2025-06-03 16:47:23] [INFO ] Flatten gal took : 0 ms
[2025-06-03 16:47:23] [INFO ] Input system was already deterministic with 3 transitions.
[2025-06-03 16:47:23] [INFO ] Flatten gal took : 0 ms
[2025-06-03 16:47:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 16:47:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6312214668409552671.gal : 1 ms
[2025-06-03 16:47:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5683748109908172265.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6312214668409552671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5683748109908172265.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.004332,3660,2,4,5,12,5,0,12,6,0


Converting to forward existential form...Done !
original formula: EG((p181==0))
=> equivalent forward existential formula: [FwdG(Init,(p181==0))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.005591,3916,1,0,5,18,18,0,49,11,8
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 5 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2025-06-03 16:47:23] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:47:23] [INFO ] Implicit Places using invariants in 292 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 294 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 304 ms. Remains : 218/219 places, 578/578 transitions.
[2025-06-03 16:47:23] [INFO ] Flatten gal took : 15 ms
[2025-06-03 16:47:23] [INFO ] Flatten gal took : 16 ms
[2025-06-03 16:47:23] [INFO ] Input system was already deterministic with 578 transitions.
[2025-06-03 16:47:23] [INFO ] Flatten gal took : 16 ms
[2025-06-03 16:47:23] [INFO ] Flatten gal took : 17 ms
[2025-06-03 16:47:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4221430672737099872.gal : 4 ms
[2025-06-03 16:47:23] [INFO ] Time to serialize properties into /tmp/CTLFireability8029015864320485663.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4221430672737099872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8029015864320485663.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66233e+19,29.594,545992,2,70317,5,3.3359e+06,6,0,1450,1.78842e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 16:47:53] [INFO ] Flatten gal took : 11 ms
[2025-06-03 16:47:53] [INFO ] Applying decomposition
[2025-06-03 16:47:53] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7201051931793093041.txt' '-o' '/tmp/graph7201051931793093041.bin' '-w' '/tmp/graph7201051931793093041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7201051931793093041.bin' '-l' '-1' '-v' '-w' '/tmp/graph7201051931793093041.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:47:53] [INFO ] Decomposing Gal with order
[2025-06-03 16:47:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:47:53] [INFO ] Removed a total of 850 redundant transitions.
[2025-06-03 16:47:53] [INFO ] Flatten gal took : 27 ms
[2025-06-03 16:47:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 16:47:53] [INFO ] Time to serialize gal into /tmp/CTLFireability11376328382093720942.gal : 4 ms
[2025-06-03 16:47:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17972114949349976476.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11376328382093720942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17972114949349976476.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66233e+19,0.118998,6840,152,16,5321,256,611,5768,37,369,0


Converting to forward existential form...Done !
original formula: AG(AX(!(A(((((i4.u19.p48==1)&&(i13.u64.p155==1))&&(i1.u4.p217==1)) + E((((i7.u34.p83==1)&&(i9.u44.p108==1))&&(i1.u4.p217==1)) U (((i5.u24...349
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!((((!((i18.u87.p210==1)&&(i1.u4.p217==1)))||((i13.u62.p150==1)&&(i1.u4.p217==1)))...707
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,0.333868,9912,1,0,10739,256,2697,18279,134,369,15882
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 175 edges and 219 vertex of which 48 / 219 are part of one of the 16 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 170 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 182 transitions
Redundant transition composition rules discarded 182 transitions
Iterating global reduction 0 with 182 rules applied. Total rules applied 217 place count 170 transition count 242
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 170 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 169 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 169 transition count 241
Applied a total of 220 rules in 45 ms. Remains 169 /219 variables (removed 50) and now considering 241/578 (removed 337) transitions.
[2025-06-03 16:47:54] [INFO ] Flow matrix only has 226 transitions (discarded 15 similar events)
// Phase 1: matrix 226 rows 169 cols
[2025-06-03 16:47:54] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:47:54] [INFO ] Implicit Places using invariants in 225 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 226 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 168/219 places, 241/578 transitions.
Graph (trivial) has 216 edges and 168 vertex of which 84 / 168 are part of one of the 18 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 102 transition count 123
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 82 transition count 123
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 41 place count 82 transition count 105
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 77 place count 64 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 93 place count 64 transition count 89
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 48 transition count 73
Applied a total of 125 rules in 17 ms. Remains 48 /168 variables (removed 120) and now considering 73/241 (removed 168) transitions.
[2025-06-03 16:47:54] [INFO ] Flow matrix only has 56 transitions (discarded 17 similar events)
// Phase 1: matrix 56 rows 48 cols
[2025-06-03 16:47:54] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:47:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-03 16:47:54] [INFO ] Flow matrix only has 56 transitions (discarded 17 similar events)
[2025-06-03 16:47:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:47:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-03 16:47:54] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/219 places, 73/578 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 481 ms. Remains : 48/219 places, 73/578 transitions.
[2025-06-03 16:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-03 16:47:54] [INFO ] Flatten gal took : 4 ms
[2025-06-03 16:47:54] [INFO ] Input system was already deterministic with 73 transitions.
[2025-06-03 16:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-03 16:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-03 16:47:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15605851499530108556.gal : 1 ms
[2025-06-03 16:47:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15929174312366013048.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15605851499530108556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15929174312366013048.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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.21126e+06,0.027905,4244,2,312,5,2022,6,0,247,1426,0


Converting to forward existential form...Done !
original formula: AF(AG((((p96==0)||(p179==0))||(p217==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p96==0)||(p179==0))||(p217==0)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.094782,5524,1,0,7,8843,19,1,1292,3058,11
FORMULA FlexibleBarrier-PT-18a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-03 16:47:54] [INFO ] Flatten gal took : 29 ms
[2025-06-03 16:47:54] [INFO ] Flatten gal took : 19 ms
Total runtime 728766 ms.

BK_STOP 1748969274792

--------------------
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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="FlexibleBarrier-PT-18a"
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-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-18a, 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 r086-smll-174860102700514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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