Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102500410.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-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102500410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 69K 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-04b-CTLFireability-2023-12
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2023-13
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2023-14
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2023-15
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-00
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-01
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-02
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-03
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-04
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-05
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-06
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-07
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-08
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-09
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-10
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748917489932

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 02:24:51] [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 02:24:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:24:52] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2025-06-03 02:24:52] [INFO ] Transformed 268 places.
[2025-06-03 02:24:52] [INFO ] Transformed 305 transitions.
[2025-06-03 02:24:52] [INFO ] Found NUPN structural information;
[2025-06-03 02:24:52] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Support contains 89 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 305/305 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 225 transition count 262
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 225 transition count 262
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 215 transition count 252
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 215 transition count 252
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 212 transition count 249
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 212 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 212 transition count 247
Applied a total of 114 rules in 158 ms. Remains 212 /268 variables (removed 56) and now considering 247/305 (removed 58) transitions.
// Phase 1: matrix 247 rows 212 cols
[2025-06-03 02:24:52] [INFO ] Computed 6 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:53] [INFO ] Implicit Places using invariants in 514 ms returned []
[2025-06-03 02:24:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:53] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2025-06-03 02:24:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:00] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:00] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:00] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:01] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:01] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:01] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:02] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:02] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:02] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:03] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:04] [INFO ] Deduced a trap composed of 91 places in 274 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:04] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:05] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:05] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:09] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:09] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 247/459 variables, 212/234 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:18] [INFO ] Deduced a trap composed of 75 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:19] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:19] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:22] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 28 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 238 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/459 variables, 212/238 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 246/484 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:31] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:31] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:32] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:32] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:32] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:33] [INFO ] Deduced a trap composed of 60 places in 227 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:33] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:33] [INFO ] Deduced a trap composed of 122 places in 188 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:34] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:35] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:35] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:36] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 12/496 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:39] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:39] [INFO ] Deduced a trap composed of 133 places in 260 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:40] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:40] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:40] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:40] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:42] [INFO ] Deduced a trap composed of 133 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:43] [INFO ] Deduced a trap composed of 142 places in 163 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 8/504 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:53] [INFO ] Deduced a trap along path composed of 7 places in 74 ms of which 18 ms to minimize.
(s127 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0timeout
) 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 Int declared 459/459 variables, and 505 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Starting structural reductions in LTL mode, iteration 1 : 212/268 places, 247/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61726 ms. Remains : 212/268 places, 247/305 transitions.
Support contains 89 out of 212 places after structural reductions.
[2025-06-03 02:25:54] [INFO ] Flatten gal took : 86 ms
[2025-06-03 02:25:54] [INFO ] Flatten gal took : 41 ms
[2025-06-03 02:25:54] [INFO ] Input system was already deterministic with 247 transitions.
RANDOM walk for 40000 steps (939 resets) in 2067 ms. (19 steps per ms) remains 8/68 properties
BEST_FIRST walk for 40004 steps (173 resets) in 302 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (172 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (174 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (87 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (89 resets) in 76 ms. (519 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (175 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (166 resets) in 80 ms. (493 steps per ms) remains 5/7 properties
[2025-06-03 02:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 166/177 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/212 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 247/459 variables, 212/218 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/459 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 218 constraints, problems are : Problem set: 1 solved, 4 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 168/177 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:56] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 13 ms to minimize.
Problem AtomicPropp6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:56] [INFO ] Deduced a trap composed of 61 places in 232 ms of which 42 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 35/212 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 247/459 variables, 212/220 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 3/223 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/459 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 223 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1563ms problems are : Problem set: 2 solved, 3 unsolved
Finished Parikh walk after 5359 steps, including 93 resets, run visited all 3 properties in 100 ms. (steps per millisecond=53 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 109 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-03 02:25:57] [INFO ] Flatten gal took : 27 ms
[2025-06-03 02:25:57] [INFO ] Flatten gal took : 19 ms
[2025-06-03 02:25:57] [INFO ] Input system was already deterministic with 247 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Graph (trivial) has 171 edges and 212 vertex of which 19 / 212 are part of one of the 3 SCC in 3 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 195 transition count 188
Reduce places removed 41 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 154 transition count 185
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 151 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 89 place count 151 transition count 175
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 109 place count 141 transition count 175
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 141 place count 109 transition count 143
Iterating global reduction 3 with 32 rules applied. Total rules applied 173 place count 109 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 173 place count 109 transition count 142
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 108 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 104 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 104 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 104 transition count 135
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 4 with 32 rules applied. Total rules applied 218 place count 88 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 220 place count 86 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 86 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 224 place count 86 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 227 place count 86 transition count 112
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 86 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 84 transition count 110
Applied a total of 231 rules in 89 ms. Remains 84 /212 variables (removed 128) and now considering 110/247 (removed 137) transitions.
[2025-06-03 02:25:57] [INFO ] Flow matrix only has 108 transitions (discarded 2 similar events)
// Phase 1: matrix 108 rows 84 cols
[2025-06-03 02:25:57] [INFO ] Computed 6 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:57] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-03 02:25:57] [INFO ] Flow matrix only has 108 transitions (discarded 2 similar events)
[2025-06-03 02:25:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:58] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:25:58] [INFO ] Redundant transitions in 4 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-03 02:25:58] [INFO ] Flow matrix only has 108 transitions (discarded 2 similar events)
[2025-06-03 02:25:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 4/84 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:58] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:58] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:58] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:59] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:59] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 107/191 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4383 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 4/84 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 107/191 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 81/176 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/192 variables, and 176 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3455 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7861ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 7864ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/212 places, 110/247 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8184 ms. Remains : 84/212 places, 110/247 transitions.
[2025-06-03 02:26:06] [INFO ] Flatten gal took : 13 ms
[2025-06-03 02:26:06] [INFO ] Flatten gal took : 13 ms
[2025-06-03 02:26:06] [INFO ] Input system was already deterministic with 110 transitions.
[2025-06-03 02:26:06] [INFO ] Flatten gal took : 13 ms
[2025-06-03 02:26:06] [INFO ] Flatten gal took : 12 ms
[2025-06-03 02:26:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17515427430137730346.gal : 4 ms
[2025-06-03 02:26:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5743258682154766686.ctl : 21 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/CTLFireability17515427430137730346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5743258682154766686.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.07197e+06,0.189735,8872,2,1535,5,24022,6,0,446,20520,0


Converting to forward existential form...Done !
original formula: E(E(!(EG(!(((p259==1)||(p77==1))))) U !(((((((p189==1)||(p47==1))&&((p47==1)||(p241==1)))||(p103!=1))||((p186==1)||(p237==1))) * ((p94==1...201
=> equivalent forward existential formula: [(FwdU(Init,E(!(EG(!(((p259==1)||(p77==1))))) U !(((((((p189==1)||(p47==1))&&((p47==1)||(p241==1)))||(p103!=1))|...259
(forward)formula 0,0,0.191457,9000,1,0,5,24022,8,0,452,20520,0
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 174 transition count 209
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 174 transition count 209
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 92 place count 158 transition count 193
Iterating global reduction 0 with 16 rules applied. Total rules applied 108 place count 158 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 158 transition count 192
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 117 place count 150 transition count 184
Iterating global reduction 1 with 8 rules applied. Total rules applied 125 place count 150 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 127 place count 150 transition count 182
Applied a total of 127 rules in 40 ms. Remains 150 /212 variables (removed 62) and now considering 182/247 (removed 65) transitions.
// Phase 1: matrix 182 rows 150 cols
[2025-06-03 02:26:06] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:06] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-03 02:26:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:06] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-06-03 02:26:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 182/332 variables, 150/156 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 0/332 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 156 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11496 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 182/332 variables, 150/156 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 181/337 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:22] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:22] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:22] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:23] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:23] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:23] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:24] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:25] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:27] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:29] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:29] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:29] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:32] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 350 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41554ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 41555ms
Starting structural reductions in LTL mode, iteration 1 : 150/212 places, 182/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42019 ms. Remains : 150/212 places, 182/247 transitions.
[2025-06-03 02:26:48] [INFO ] Flatten gal took : 18 ms
[2025-06-03 02:26:48] [INFO ] Flatten gal took : 19 ms
[2025-06-03 02:26:48] [INFO ] Input system was already deterministic with 182 transitions.
[2025-06-03 02:26:48] [INFO ] Flatten gal took : 17 ms
[2025-06-03 02:26:48] [INFO ] Flatten gal took : 19 ms
[2025-06-03 02:26:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17123785669887381468.gal : 16 ms
[2025-06-03 02:26:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1017063270611389025.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/CTLFireability17123785669887381468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1017063270611389025.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.11947e+07,1.69858,39772,2,8077,5,138232,6,0,784,199862,0


Converting to forward existential form...Done !
original formula: AF(E((((p151==1) + EX((p197!=1))) + EF((p18==1))) U (A(!(((p48==1)&&(p64==1))) U (AX((p195==1)) * ((p197==1)||(p99==1)))) + EF(((p6!=1)&&...182
=> equivalent forward existential formula: [FwdG(Init,!(E((((p151==1) + EX((p197!=1))) + E(TRUE U (p18==1))) U (!((E(!((!(EX(!((p195==1)))) * ((p197==1)||(...364
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t15, t17, t20, t24, t29, t33, t34, t45, t46, t48, t50, t55, t59, t60, t70, t7...371
Detected timeout of ITS tools.
[2025-06-03 02:27:18] [INFO ] Flatten gal took : 13 ms
[2025-06-03 02:27:18] [INFO ] Applying decomposition
[2025-06-03 02:27:18] [INFO ] Flatten gal took : 14 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/graph15584612510202942848.txt' '-o' '/tmp/graph15584612510202942848.bin' '-w' '/tmp/graph15584612510202942848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15584612510202942848.bin' '-l' '-1' '-v' '-w' '/tmp/graph15584612510202942848.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:27:18] [INFO ] Decomposing Gal with order
[2025-06-03 02:27:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:27:18] [INFO ] Removed a total of 83 redundant transitions.
[2025-06-03 02:27:18] [INFO ] Flatten gal took : 75 ms
[2025-06-03 02:27:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2025-06-03 02:27:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4468096765627777376.gal : 8 ms
[2025-06-03 02:27:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11884938192174488154.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/CTLFireability4468096765627777376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11884938192174488154.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,5.11947e+07,0.290958,12172,814,107,16492,992,556,25528,102,2463,0


Converting to forward existential form...Done !
original formula: AF(E((((i6.i1.u36.p151==1) + EX((i7.i1.u44.p197!=1))) + EF((i2.i0.u6.p18==1))) U (A(!(((i2.i1.u13.p48==1)&&(i4.i1.u15.p64==1))) U (AX((i7...287
=> equivalent forward existential formula: [FwdG(Init,!(E((((i6.i1.u36.p151==1) + EX((i7.i1.u44.p197!=1))) + E(TRUE U (i2.i0.u6.p18==1))) U (!((E(!((!(EX(!...529
Reverse transition relation is NOT exact ! Due to transitions t1, t45, t46, t75, t76, t105, t153, t155, t156, i0.i1.u2.t119, i0.i1.u7.t120, i0.i2.t115, i1....605
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,20.734,497824,1,0,874187,4617,3109,1.69236e+06,480,21219,1516154
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 168 transition count 203
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 168 transition count 203
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 107 place count 149 transition count 184
Iterating global reduction 0 with 19 rules applied. Total rules applied 126 place count 149 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 149 transition count 183
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 137 place count 139 transition count 173
Iterating global reduction 1 with 10 rules applied. Total rules applied 147 place count 139 transition count 173
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 152 place count 139 transition count 168
Applied a total of 152 rules in 17 ms. Remains 139 /212 variables (removed 73) and now considering 168/247 (removed 79) transitions.
// Phase 1: matrix 168 rows 139 cols
[2025-06-03 02:27:39] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:40] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-03 02:27:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:40] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2025-06-03 02:27:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:43] [INFO ] Deduced a trap composed of 88 places in 218 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:43] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:44] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:44] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:45] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:46] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:46] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/307 variables, 139/152 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:50] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 153 constraints, problems are : Problem set: 0 solved, 167 unsolved in 16709 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/307 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 167/320 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:00] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:00] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:00] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:01] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:01] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:01] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:01] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:02] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 8/328 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:04] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 329 constraints, problems are : Problem set: 0 solved, 167 unsolved in 24967 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41729ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 41730ms
Starting structural reductions in LTL mode, iteration 1 : 139/212 places, 168/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42193 ms. Remains : 139/212 places, 168/247 transitions.
[2025-06-03 02:28:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:28:22] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:28:22] [INFO ] Input system was already deterministic with 168 transitions.
[2025-06-03 02:28:22] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:28:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:28:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15935746804735963510.gal : 2 ms
[2025-06-03 02:28:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13260187119663897656.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/CTLFireability15935746804735963510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13260187119663897656.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.53859e+07,1.06059,26864,2,6077,5,96495,6,0,726,122525,0


Converting to forward existential form...Done !
original formula: AG((AG((p151==0)) + EG((EX((((p19==0)||(p104==0))||(p209==0))) * EX((p204==0))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG((EX((((p19==0)||(p104==0))||(p209==0))) * EX((p204==0)))))),TRUE) * !((p151==0)))...164
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t16, t18, t20, t24, t29, t33, t34, t45, t46, t48, t50, t55, t59, t60, t72, t73, t...338
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.1903,240828,1,0,425,1.26586e+06,364,212,4673,1.20578e+06,470
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 169 transition count 204
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 169 transition count 204
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 104 place count 151 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 122 place count 151 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 151 transition count 185
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 134 place count 140 transition count 174
Iterating global reduction 1 with 11 rules applied. Total rules applied 145 place count 140 transition count 174
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 151 place count 140 transition count 168
Applied a total of 151 rules in 11 ms. Remains 140 /212 variables (removed 72) and now considering 168/247 (removed 79) transitions.
// Phase 1: matrix 168 rows 140 cols
[2025-06-03 02:28:33] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:33] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-03 02:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:33] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2025-06-03 02:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/308 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 0/308 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 146 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11866 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/308 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 167/313 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:50] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:50] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:50] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:50] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 7/320 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:54] [INFO ] Deduced a trap along path composed of 4 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:00] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:00] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:00] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:00] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 325 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41896ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 41897ms
Starting structural reductions in LTL mode, iteration 1 : 140/212 places, 168/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42152 ms. Remains : 140/212 places, 168/247 transitions.
[2025-06-03 02:29:15] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:29:15] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:29:15] [INFO ] Input system was already deterministic with 168 transitions.
[2025-06-03 02:29:15] [INFO ] Flatten gal took : 11 ms
[2025-06-03 02:29:15] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:29:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11511763796322204843.gal : 2 ms
[2025-06-03 02:29:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4909691057326567439.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/CTLFireability11511763796322204843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4909691057326567439.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,3.79651e+07,1.30994,33912,2,7209,5,123336,6,0,730,159734,0


Converting to forward existential form...Done !
original formula: AX(EX(AG(A((p216==1) U (p92!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U !(!((E(!((p92!=1)) U (!((p216==1)) * !((p92!=1)))) + EG(!((p92!=1)))))))))))] = FAL...157
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t15, t19, t22, t26, t31, t35, t36, t47, t48, t50, t52, t57, t61, t62, t74, t7...343
Detected timeout of ITS tools.
[2025-06-03 02:29:45] [INFO ] Flatten gal took : 12 ms
[2025-06-03 02:29:45] [INFO ] Applying decomposition
[2025-06-03 02:29:45] [INFO ] Flatten gal took : 6 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/graph14780918985049694851.txt' '-o' '/tmp/graph14780918985049694851.bin' '-w' '/tmp/graph14780918985049694851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14780918985049694851.bin' '-l' '-1' '-v' '-w' '/tmp/graph14780918985049694851.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:29:45] [INFO ] Decomposing Gal with order
[2025-06-03 02:29:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:29:45] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-03 02:29:45] [INFO ] Flatten gal took : 18 ms
[2025-06-03 02:29:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 02:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15266955919309727819.gal : 9 ms
[2025-06-03 02:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13349386448138234194.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/CTLFireability15266955919309727819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13349386448138234194.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,3.79651e+07,0.253014,11236,623,176,13843,2418,463,23506,114,5528,0


Converting to forward existential form...Done !
original formula: AX(EX(AG(A((i9.u42.p216==1) U (i3.i1.u18.p92!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U !(!((E(!((i3.i1.u18.p92!=1)) U (!((i9.u42.p216==1)) * !((i3.i1.u18.p92!=1)))) + EG(...194
Reverse transition relation is NOT exact ! Due to transitions t1, t47, t48, t74, t75, t101, t143, t144, t146, i1.t145, i1.i0.u2.t114, i1.i0.u6.t115, i1.i1....544
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,5.81261,151012,1,0,280372,7824,2623,546485,545,31537,478688
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 173 transition count 208
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 173 transition count 208
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 94 place count 157 transition count 192
Iterating global reduction 0 with 16 rules applied. Total rules applied 110 place count 157 transition count 192
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 120 place count 147 transition count 182
Iterating global reduction 0 with 10 rules applied. Total rules applied 130 place count 147 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 134 place count 147 transition count 178
Applied a total of 134 rules in 12 ms. Remains 147 /212 variables (removed 65) and now considering 178/247 (removed 69) transitions.
// Phase 1: matrix 178 rows 147 cols
[2025-06-03 02:29:51] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:51] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-03 02:29:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:52] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-06-03 02:29:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 178/325 variables, 147/153 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 0/325 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 153 constraints, problems are : Problem set: 0 solved, 177 unsolved in 13935 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 178/325 variables, 147/153 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 177/330 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:10] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:11] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:11] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:11] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:11] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:12] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:12] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:13] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:13] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:14] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:14] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:15] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:15] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:16] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 5/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:20] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:24] [INFO ] Deduced a trap along path composed of 4 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:31] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 347 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43985ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 43986ms
Starting structural reductions in LTL mode, iteration 1 : 147/212 places, 178/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44325 ms. Remains : 147/212 places, 178/247 transitions.
[2025-06-03 02:30:36] [INFO ] Flatten gal took : 13 ms
[2025-06-03 02:30:36] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:30:36] [INFO ] Input system was already deterministic with 178 transitions.
[2025-06-03 02:30:36] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:30:36] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:30:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5137708151549179412.gal : 2 ms
[2025-06-03 02:30:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1433156560925609477.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/CTLFireability5137708151549179412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1433156560925609477.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,4.84061e+07,5.19798,114856,2,13184,5,360383,6,0,768,685697,0


Converting to forward existential form...Done !
original formula: EF((((EX(AG((p63==1))) * E((p237==1) U (p162==1))) * ((p54==0)&&(p66==0))) * (((p67==0)&&((p188==0)||(p265==0)))&&(((p38==0)||(p265==0))&...195
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,TRUE) * (((p67==0)&&((p188==0)||(p265==0)))&&(((p38==0)||(p265==0))&&(((p178==0)||(p265==0))...260
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t10, t18, t21, t25, t30, t34, t35, t45, t49, t50, t52, t54, t59, t63, t64, t7...366
(forward)formula 0,0,15.5946,275648,1,0,329,1.35767e+06,385,151,4510,1.12782e+06,371
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 168 transition count 203
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 168 transition count 203
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 107 place count 149 transition count 184
Iterating global reduction 0 with 19 rules applied. Total rules applied 126 place count 149 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 149 transition count 183
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 139 place count 137 transition count 171
Iterating global reduction 1 with 12 rules applied. Total rules applied 151 place count 137 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 157 place count 137 transition count 165
Applied a total of 157 rules in 8 ms. Remains 137 /212 variables (removed 75) and now considering 165/247 (removed 82) transitions.
// Phase 1: matrix 165 rows 137 cols
[2025-06-03 02:30:51] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-03 02:30:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:52] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-03 02:30:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 165/302 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 0/302 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 143 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11354 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 165/302 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 164/307 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:06] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:07] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:07] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:07] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:07] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:09] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:10] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:12] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:12] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:15] [INFO ] Deduced a trap along path composed of 4 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:31:19] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 318 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41373ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 41375ms
Starting structural reductions in LTL mode, iteration 1 : 137/212 places, 165/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41627 ms. Remains : 137/212 places, 165/247 transitions.
[2025-06-03 02:31:33] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:31:33] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:31:33] [INFO ] Input system was already deterministic with 165 transitions.
[2025-06-03 02:31:33] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:31:33] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:31:33] [INFO ] Time to serialize gal into /tmp/CTLFireability5651527334598604142.gal : 2 ms
[2025-06-03 02:31:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9826005559133990320.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/CTLFireability5651527334598604142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9826005559133990320.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,3.33651e+07,2.13422,49696,2,7591,5,162803,6,0,715,268860,0


Converting to forward existential form...Done !
original formula: EX(((p36==1) + E(EF((p253!=1)) U EX(EG(((p80==1)&&(p265==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * (p36==1))] != FALSE + [FwdG(EY(FwdU(EY(Init),E(TRUE U (p253!=1)))),((p80==1)&&(p265==1)))] != FALS...157
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t16, t19, t23, t28, t32, t33, t44, t45, t47, t49, t54, t58, t59, t71, t72, t7...337
Hit Full ! (commute/partial/dont) 146/18/19
(forward)formula 0,1,11.5866,209048,1,0,312,922934,363,143,4686,972632,362
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Graph (trivial) has 164 edges and 212 vertex of which 12 / 212 are part of one of the 2 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 201 transition count 191
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 156 transition count 189
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 97 place count 154 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 153 transition count 187
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 98 place count 153 transition count 169
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 134 place count 135 transition count 169
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 171 place count 98 transition count 132
Iterating global reduction 4 with 37 rules applied. Total rules applied 208 place count 98 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 208 place count 98 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 97 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 214 place count 93 transition count 127
Iterating global reduction 4 with 4 rules applied. Total rules applied 218 place count 93 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 222 place count 93 transition count 123
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 5 with 28 rules applied. Total rules applied 250 place count 79 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 252 place count 77 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 77 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 256 place count 77 transition count 105
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 77 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 259 place count 75 transition count 103
Applied a total of 259 rules in 49 ms. Remains 75 /212 variables (removed 137) and now considering 103/247 (removed 144) transitions.
[2025-06-03 02:31:45] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
// Phase 1: matrix 100 rows 75 cols
[2025-06-03 02:31:45] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:45] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-03 02:31:45] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2025-06-03 02:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:45] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:31:45] [INFO ] Redundant transitions in 3 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-03 02:31:45] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2025-06-03 02:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 99/174 variables, 75/81 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 0/174 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/175 variables, and 81 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4437 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 99/174 variables, 75/81 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 87/168 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/174 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/175 variables, and 168 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4091 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8537ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 8537ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/212 places, 103/247 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8781 ms. Remains : 75/212 places, 103/247 transitions.
[2025-06-03 02:31:53] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:31:53] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:31:53] [INFO ] Input system was already deterministic with 103 transitions.
[2025-06-03 02:31:53] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:31:53] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:31:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8761737451329931801.gal : 2 ms
[2025-06-03 02:31:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6582572393827507234.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/CTLFireability8761737451329931801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6582572393827507234.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,1.23552e+06,0.083866,5240,2,348,5,6852,6,0,404,5234,0


Converting to forward existential form...Done !
original formula: E(EF((((p151!=1)&&(!(((p17==1)&&(p104==1))&&(p209==1)))) + (E(EF(((p89==1)&&(p253==1))) U EF((p26==1))) * EG(((p201==1)||(p200==1)))))) U...166
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((p151!=1)&&(!(((p17==1)&&(p104==1))&&(p209==1)))) + (E(E(TRUE U ((p89==1)&&(p253==1))) U ...230
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.14203,28596,1,0,19,152014,30,8,2051,99495,21
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 174 transition count 209
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 174 transition count 209
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 93 place count 157 transition count 192
Iterating global reduction 0 with 17 rules applied. Total rules applied 110 place count 157 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 157 transition count 191
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 121 place count 147 transition count 181
Iterating global reduction 1 with 10 rules applied. Total rules applied 131 place count 147 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 135 place count 147 transition count 177
Applied a total of 135 rules in 13 ms. Remains 147 /212 variables (removed 65) and now considering 177/247 (removed 70) transitions.
// Phase 1: matrix 177 rows 147 cols
[2025-06-03 02:31:55] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-03 02:31:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:55] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-03 02:31:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/324 variables, 147/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 0/324 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 153 constraints, problems are : Problem set: 0 solved, 176 unsolved in 13411 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/324 variables, 147/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 176/329 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:12] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:12] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:13] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:13] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:13] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:13] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:13] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:15] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:18] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:19] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:19] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:19] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:32:19] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 342 constraints, problems are : Problem set: 0 solved, 176 unsolved in 23633 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37061ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 37061ms
Starting structural reductions in LTL mode, iteration 1 : 147/212 places, 177/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37328 ms. Remains : 147/212 places, 177/247 transitions.
[2025-06-03 02:32:32] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:32:32] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:32:32] [INFO ] Input system was already deterministic with 177 transitions.
[2025-06-03 02:32:32] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:32:32] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:32:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11009591634133478465.gal : 3 ms
[2025-06-03 02:32:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9716516786511686091.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/CTLFireability11009591634133478465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9716516786511686091.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,4.6418e+07,1.4708,39320,2,7465,5,144914,6,0,767,189068,0


Converting to forward existential form...Done !
original formula: E(!(A(((p41==1)&&(p264==1)) U EX(EF((p60==1))))) U (!(EG(!(AX((p76==1))))) * (EF((p40==1)) + A((!(EX((p213==1))) * A((p101==1) U (p100==1...191
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!((E(!(EX(E(TRUE U (p60==1)))) U (!(((p41==1)&&(p264==1))) * !(EX(E(TRUE U (p60==1)))))) + ...645
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t15, t17, t20, t24, t29, t33, t34, t46, t48, t50, t55, t56, t61, t73, t77, t7...344
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-03 02:33:02] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:33:02] [INFO ] Applying decomposition
[2025-06-03 02:33:02] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7739460867336781457.txt' '-o' '/tmp/graph7739460867336781457.bin' '-w' '/tmp/graph7739460867336781457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7739460867336781457.bin' '-l' '-1' '-v' '-w' '/tmp/graph7739460867336781457.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:33:02] [INFO ] Decomposing Gal with order
[2025-06-03 02:33:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:33:02] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-03 02:33:02] [INFO ] Flatten gal took : 23 ms
[2025-06-03 02:33:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2025-06-03 02:33:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3320230862960866575.gal : 5 ms
[2025-06-03 02:33:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10610242799461714039.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/CTLFireability3320230862960866575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10610242799461714039.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,4.6418e+07,0.433983,10928,568,146,13139,1795,489,23014,119,4866,0


Converting to forward existential form...Done !
original formula: E(!(A(((i1.i1.u8.p41==1)&&(i4.i2.u46.p264==1)) U EX(EF((i3.i0.u16.p60==1))))) U (!(EG(!(AX((i3.i1.u17.p76==1))))) * (EF((i0.i1.u7.p40==1)...280
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!((E(!(EX(E(TRUE U (i3.i0.u16.p60==1)))) U (!(((i1.i1.u8.p41==1)&&(i4.i2.u46.p264==1))) * !...867
Reverse transition relation is NOT exact ! Due to transitions t1, t73, t105, t149, t150, t151, u45.t6, u45.t15, u45.t17, i0.i1.t114, i0.i2.u2.t118, i0.i2.u...555
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,17.8833,359060,1,0,520062,7845,2942,1.32024e+06,563,21854,807435
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 169 transition count 204
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 169 transition count 204
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 105 place count 150 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 124 place count 150 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 150 transition count 184
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 136 place count 139 transition count 173
Iterating global reduction 1 with 11 rules applied. Total rules applied 147 place count 139 transition count 173
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 152 place count 139 transition count 168
Applied a total of 152 rules in 43 ms. Remains 139 /212 variables (removed 73) and now considering 168/247 (removed 79) transitions.
// Phase 1: matrix 168 rows 139 cols
[2025-06-03 02:33:20] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:33:20] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-03 02:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:33:20] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2025-06-03 02:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/307 variables, 139/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 0/307 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 145 constraints, problems are : Problem set: 0 solved, 167 unsolved in 12353 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/307 variables, 139/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:37] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:37] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:37] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:38] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:39] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:39] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:39] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:40] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:40] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:41] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 6/322 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:43] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:43] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:45] [INFO ] Deduced a trap along path composed of 4 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 0/307 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 325 constraints, problems are : Problem set: 0 solved, 167 unsolved in 26005 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38379ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 38380ms
Starting structural reductions in LTL mode, iteration 1 : 139/212 places, 168/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38685 ms. Remains : 139/212 places, 168/247 transitions.
[2025-06-03 02:33:59] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:33:59] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:33:59] [INFO ] Input system was already deterministic with 168 transitions.
[2025-06-03 02:33:59] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:33:59] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:33:59] [INFO ] Time to serialize gal into /tmp/CTLFireability958208815667514143.gal : 1 ms
[2025-06-03 02:33:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11657548979735792348.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/CTLFireability958208815667514143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11657548979735792348.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,3.61497e+07,1.54209,36840,2,7016,5,128523,6,0,726,180458,0


Converting to forward existential form...Done !
original formula: EF(EX((p230==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p230==1))] != FALSE
(forward)formula 0,1,1.74618,36840,1,0,8,128523,8,1,1208,180458,2
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Graph (trivial) has 195 edges and 212 vertex of which 25 / 212 are part of one of the 4 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 190 transition count 172
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 138 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 105 place count 138 transition count 161
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 127 place count 127 transition count 161
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 167 place count 87 transition count 121
Iterating global reduction 2 with 40 rules applied. Total rules applied 207 place count 87 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 207 place count 87 transition count 119
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 85 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 215 place count 81 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 81 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 223 place count 81 transition count 111
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 247 place count 69 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 249 place count 67 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 67 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 253 place count 67 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 257 place count 67 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 259 place count 65 transition count 89
Applied a total of 259 rules in 35 ms. Remains 65 /212 variables (removed 147) and now considering 89/247 (removed 158) transitions.
[2025-06-03 02:34:01] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 65 cols
[2025-06-03 02:34:01] [INFO ] Computed 6 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-03 02:34:01] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-03 02:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:01] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:34:01] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-03 02:34:01] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-03 02:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 4/65 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 85/150 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/150 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/151 variables, and 71 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1692 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 4/65 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 85/150 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/151 variables, and 129 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2421 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4125ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4125ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/212 places, 89/247 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4389 ms. Remains : 65/212 places, 89/247 transitions.
[2025-06-03 02:34:05] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:34:05] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:34:05] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-03 02:34:05] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:34:05] [INFO ] Flatten gal took : 17 ms
[2025-06-03 02:34:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8529563726528812702.gal : 1 ms
[2025-06-03 02:34:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7310145862433764845.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/ReachabilityCardinality8529563726528812702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7310145862433764845.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 9582 steps (861 resets) in 190 ms. (50 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
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 ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 173 transition count 208
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 173 transition count 208
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 95 place count 156 transition count 191
Iterating global reduction 0 with 17 rules applied. Total rules applied 112 place count 156 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 113 place count 156 transition count 190
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 123 place count 146 transition count 180
Iterating global reduction 1 with 10 rules applied. Total rules applied 133 place count 146 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 137 place count 146 transition count 176
Applied a total of 137 rules in 10 ms. Remains 146 /212 variables (removed 66) and now considering 176/247 (removed 71) transitions.
// Phase 1: matrix 176 rows 146 cols
[2025-06-03 02:34:05] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:05] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-06-03 02:34:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:06] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2025-06-03 02:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:08] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:08] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/322 variables, 146/154 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 154 constraints, problems are : Problem set: 0 solved, 175 unsolved in 14932 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/322 variables, 146/154 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 175/329 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:25] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:25] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:25] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:26] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:26] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:26] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:28] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:30] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:30] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:31] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:32] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:32] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:36] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:38] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:38] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:38] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:40] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:44] [INFO ] Deduced a trap along path composed of 4 places in 55 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 347 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44967ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 44968ms
Starting structural reductions in LTL mode, iteration 1 : 146/212 places, 176/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45465 ms. Remains : 146/212 places, 176/247 transitions.
[2025-06-03 02:34:51] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:34:51] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:34:51] [INFO ] Input system was already deterministic with 176 transitions.
[2025-06-03 02:34:51] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:34:51] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:34:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14022884949529702780.gal : 2 ms
[2025-06-03 02:34:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17976245709731007847.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/CTLFireability14022884949529702780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17976245709731007847.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.57529e+07,1.85848,42760,2,8841,5,157354,6,0,762,208600,0


Converting to forward existential form...Done !
original formula: (EG(EX((AX((p9==0)) * AF((p182==0))))) * E(((p227==1) + EF((p36!=1))) U EG(((p179!=1)&&(p102==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * EG(EX((!(EX(!((p9==0)))) * !(EG(!((p182==0)))))))),((p227==1) + E(TRUE U (p36!=1)))),((p179!=...180
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t12, t18, t21, t25, t30, t37, t48, t49, t51, t53, t58, t62, t63, t75, t76, t7...355
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 172/4/4
(forward)formula 0,1,19.7025,422212,1,0,532,2.40146e+06,399,256,5358,2.14589e+06,608
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-10 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 : 212/212 places, 247/247 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 173 transition count 208
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 173 transition count 208
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 96 place count 155 transition count 190
Iterating global reduction 0 with 18 rules applied. Total rules applied 114 place count 155 transition count 190
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 125 place count 144 transition count 179
Iterating global reduction 0 with 11 rules applied. Total rules applied 136 place count 144 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 141 place count 144 transition count 174
Applied a total of 141 rules in 6 ms. Remains 144 /212 variables (removed 68) and now considering 174/247 (removed 73) transitions.
// Phase 1: matrix 174 rows 144 cols
[2025-06-03 02:35:11] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:35:11] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-03 02:35:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:35:11] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-03 02:35:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:13] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/318 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 151 constraints, problems are : Problem set: 0 solved, 173 unsolved in 10231 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/318 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 173/324 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:24] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:25] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:25] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:25] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:26] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 5/329 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:27] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:27] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:28] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:28] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:29] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:31] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:31] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:34] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:37] [INFO ] Deduced a trap along path composed of 29 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:37] [INFO ] Deduced a trap along path composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:41] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 340 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40265ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 40266ms
Starting structural reductions in LTL mode, iteration 1 : 144/212 places, 174/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40569 ms. Remains : 144/212 places, 174/247 transitions.
[2025-06-03 02:35:51] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:35:51] [INFO ] Flatten gal took : 13 ms
[2025-06-03 02:35:51] [INFO ] Input system was already deterministic with 174 transitions.
[2025-06-03 02:35:51] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:35:51] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:35:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6101274638738657775.gal : 2 ms
[2025-06-03 02:35:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14922512610158935429.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/CTLFireability6101274638738657775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14922512610158935429.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.24263e+07,3.26769,75684,2,13947,5,249116,6,0,752,421781,0


Converting to forward existential form...Done !
original formula: EF((EX(EG((((p238==1)||(p174==1)) * EF((p223==1))))) + ((p72==1) * AG((p257==0)))))
=> equivalent forward existential formula: ([FwdG(EY(FwdU(Init,TRUE)),(((p238==1)||(p174==1)) * E(TRUE U (p223==1))))] != FALSE + [((FwdU(Init,TRUE) * (p72...200
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t15, t19, t21, t26, t31, t32, t35, t36, t37, t49, t50, t52, t54, t59...383
Detected timeout of ITS tools.
[2025-06-03 02:36:21] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:36:21] [INFO ] Applying decomposition
[2025-06-03 02:36:21] [INFO ] Flatten gal took : 6 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/graph7032280507596585015.txt' '-o' '/tmp/graph7032280507596585015.bin' '-w' '/tmp/graph7032280507596585015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7032280507596585015.bin' '-l' '-1' '-v' '-w' '/tmp/graph7032280507596585015.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:36:21] [INFO ] Decomposing Gal with order
[2025-06-03 02:36:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:36:21] [INFO ] Removed a total of 57 redundant transitions.
[2025-06-03 02:36:21] [INFO ] Flatten gal took : 19 ms
[2025-06-03 02:36:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-06-03 02:36:21] [INFO ] Time to serialize gal into /tmp/CTLFireability2611641534143229277.gal : 4 ms
[2025-06-03 02:36:21] [INFO ] Time to serialize properties into /tmp/CTLFireability12170655301712788869.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/CTLFireability2611641534143229277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12170655301712788869.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,5.24263e+07,0.690745,15584,966,260,21067,1993,494,38605,135,6819,0


Converting to forward existential form...Done !
original formula: EF((EX(EG((((u41.p238==1)||(i7.i0.u36.p174==1)) * EF((u41.p223==1))))) + ((i4.i0.u20.p72==1) * AG((i9.u42.p257==0)))))
=> equivalent forward existential formula: ([FwdG(EY(FwdU(Init,TRUE)),(((u41.p238==1)||(i7.i0.u36.p174==1)) * E(TRUE U (u41.p223==1))))] != FALSE + [((FwdU...235
Reverse transition relation is NOT exact ! Due to transitions t1, t49, t62, t76, t89, t105, t147, t148, t149, t150, u41.t7, u41.t11, u41.t15, u41.t19, i0.t...620
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,7.101,145120,1,0,242889,5684,2706,438008,599,19079,520984
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Graph (trivial) has 197 edges and 212 vertex of which 25 / 212 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 190 transition count 172
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 138 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 105 place count 138 transition count 161
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 127 place count 127 transition count 161
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 166 place count 88 transition count 122
Iterating global reduction 2 with 39 rules applied. Total rules applied 205 place count 88 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 205 place count 88 transition count 120
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 86 transition count 120
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 214 place count 81 transition count 115
Iterating global reduction 2 with 5 rules applied. Total rules applied 219 place count 81 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 224 place count 81 transition count 110
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 248 place count 69 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 68 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 68 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 68 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 255 place count 68 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 257 place count 66 transition count 90
Applied a total of 257 rules in 26 ms. Remains 66 /212 variables (removed 146) and now considering 90/247 (removed 157) transitions.
[2025-06-03 02:36:29] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 66 cols
[2025-06-03 02:36:29] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:36:29] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-03 02:36:29] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2025-06-03 02:36:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:36:29] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:36:29] [INFO ] Redundant transitions in 3 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-03 02:36:29] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2025-06-03 02:36:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 86/152 variables, 66/72 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/153 variables, and 72 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2827 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 86/152 variables, 66/72 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 59/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/153 variables, and 131 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2554 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5391ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 5392ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/212 places, 90/247 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5698 ms. Remains : 66/212 places, 90/247 transitions.
[2025-06-03 02:36:34] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:36:34] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:36:34] [INFO ] Input system was already deterministic with 90 transitions.
[2025-06-03 02:36:34] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:36:34] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:36:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1219960510039771115.gal : 1 ms
[2025-06-03 02:36:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13649358956462446080.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/CTLFireability1219960510039771115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13649358956462446080.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,659100,0.053443,4824,2,260,5,4873,6,0,353,3722,0


Converting to forward existential form...Done !
original formula: EF(AG((p68==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p68==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.440627,12632,1,0,9,53276,15,3,1585,36986,5
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 172 transition count 207
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 172 transition count 207
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 97 place count 155 transition count 190
Iterating global reduction 0 with 17 rules applied. Total rules applied 114 place count 155 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 155 transition count 189
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 123 place count 147 transition count 181
Iterating global reduction 1 with 8 rules applied. Total rules applied 131 place count 147 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 134 place count 147 transition count 178
Applied a total of 134 rules in 13 ms. Remains 147 /212 variables (removed 65) and now considering 178/247 (removed 69) transitions.
// Phase 1: matrix 178 rows 147 cols
[2025-06-03 02:36:35] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:36:35] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-03 02:36:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:36:35] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-06-03 02:36:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 178/325 variables, 147/153 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 0/325 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 153 constraints, problems are : Problem set: 0 solved, 177 unsolved in 13656 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 178/325 variables, 147/153 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 177/330 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:54] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:54] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:54] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:54] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:55] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:55] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:55] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 7/337 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:57] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:57] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:36:57] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:37:04] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:37:04] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:37:10] [INFO ] Deduced a trap along path composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 343 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43694ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 43695ms
Starting structural reductions in LTL mode, iteration 1 : 147/212 places, 178/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44095 ms. Remains : 147/212 places, 178/247 transitions.
[2025-06-03 02:37:19] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:37:19] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:37:19] [INFO ] Input system was already deterministic with 178 transitions.
[2025-06-03 02:37:19] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:37:19] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:37:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17986323489575058447.gal : 2 ms
[2025-06-03 02:37:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1398430204727709868.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/CTLFireability17986323489575058447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1398430204727709868.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,4.83138e+07,1.6678,39148,2,8163,5,140983,6,0,768,190015,0


Converting to forward existential form...Done !
original formula: AF(EG((AX(((EF((p100==1)) + (p72==1)) + (p114==1))) + (((!(E((((p23==1)&&(p156==1))&&(p214==1)) U (p151==1))) * (p19==1)) * ((p104==1)&&(...211
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(EX(!(((E(TRUE U (p100==1)) + (p72==1)) + (p114==1))))) + (((!(E((((p23==1)&&(p156==1))&&(p214...268
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t9, t19, t22, t26, t31, t35, t36, t47, t48, t50, t52, t57, t61, t62, t71, t73...357
Detected timeout of ITS tools.
[2025-06-03 02:37:49] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:37:49] [INFO ] Applying decomposition
[2025-06-03 02:37:49] [INFO ] Flatten gal took : 6 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/graph192398995550660375.txt' '-o' '/tmp/graph192398995550660375.bin' '-w' '/tmp/graph192398995550660375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph192398995550660375.bin' '-l' '-1' '-v' '-w' '/tmp/graph192398995550660375.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:37:49] [INFO ] Decomposing Gal with order
[2025-06-03 02:37:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:37:49] [INFO ] Removed a total of 64 redundant transitions.
[2025-06-03 02:37:49] [INFO ] Flatten gal took : 18 ms
[2025-06-03 02:37:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 8 ms.
[2025-06-03 02:37:49] [INFO ] Time to serialize gal into /tmp/CTLFireability11714340286654351994.gal : 4 ms
[2025-06-03 02:37:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7989056236474658923.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/CTLFireability11714340286654351994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7989056236474658923.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,4.83138e+07,0.310975,13292,694,140,18010,2080,514,31526,122,4887,0


Converting to forward existential form...Done !
original formula: AF(EG((AX(((EF((i2.i1.u12.p100==1)) + (i2.i0.u14.p72==1)) + (i3.i1.u24.p114==1))) + (((!(E((((i0.i0.u10.p23==1)&&(i3.i1.u32.p156==1))&&(i...331
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(EX(!(((E(TRUE U (i2.i1.u12.p100==1)) + (i2.i0.u14.p72==1)) + (i3.i1.u24.p114==1))))) + (((!(E...388
Reverse transition relation is NOT exact ! Due to transitions t1, t22, t48, t76, t151, t152, t153, i0.i0.u3.t108, i0.i1.u2.t106, i0.i1.u2.t119, i0.i1.u9.t1...584
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,22.1192,498484,1,0,713505,7264,3020,2.08795e+06,559,23152,989475
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 171 transition count 206
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 171 transition count 206
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 100 place count 153 transition count 188
Iterating global reduction 0 with 18 rules applied. Total rules applied 118 place count 153 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 119 place count 153 transition count 187
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 129 place count 143 transition count 177
Iterating global reduction 1 with 10 rules applied. Total rules applied 139 place count 143 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 143 transition count 173
Applied a total of 143 rules in 8 ms. Remains 143 /212 variables (removed 69) and now considering 173/247 (removed 74) transitions.
// Phase 1: matrix 173 rows 143 cols
[2025-06-03 02:38:11] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:38:11] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-03 02:38:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:38:12] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2025-06-03 02:38:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 173/316 variables, 143/149 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 149 constraints, problems are : Problem set: 0 solved, 172 unsolved in 11186 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 173/316 variables, 143/149 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 172/321 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:27] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:28] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:28] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:28] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:29] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:30] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:31] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:32] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:33] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:35] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:35] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:35] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:38:39] [INFO ] Deduced a trap along path composed of 4 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 334 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41225ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 41225ms
Starting structural reductions in LTL mode, iteration 1 : 143/212 places, 173/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41503 ms. Remains : 143/212 places, 173/247 transitions.
[2025-06-03 02:38:53] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:38:53] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:38:53] [INFO ] Input system was already deterministic with 173 transitions.
[2025-06-03 02:38:53] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:38:53] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:38:53] [INFO ] Time to serialize gal into /tmp/CTLFireability18077395132212914241.gal : 1 ms
[2025-06-03 02:38:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16171912796710470705.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/CTLFireability18077395132212914241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16171912796710470705.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.06656e+07,1.49863,34432,2,6711,5,118760,6,0,747,167698,0


Converting to forward existential form...Done !
original formula: AX((EX((AF((p101==1)) + AG((p92==1)))) + (!(A(A((p27==1) U (p20==1)) U !(((p129==1)||(p47==1))))) * AF(((p99==1)&&((p114==0)||(p149==0)))...159
=> equivalent forward existential formula: ([(((EY(Init) * !(EX((!(EG(!((p101==1)))) + !(E(TRUE U !((p92==1)))))))) * !(EG(!(!(((p129==1)||(p47==1))))))) *...430
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t16, t19, t23, t28, t32, t33, t44, t45, t47, t49, t54, t59, t61, t69, t74, t7...349
Detected timeout of ITS tools.
[2025-06-03 02:39:23] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:39:23] [INFO ] Applying decomposition
[2025-06-03 02:39:23] [INFO ] Flatten gal took : 6 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/graph18212559219440615228.txt' '-o' '/tmp/graph18212559219440615228.bin' '-w' '/tmp/graph18212559219440615228.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18212559219440615228.bin' '-l' '-1' '-v' '-w' '/tmp/graph18212559219440615228.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:39:23] [INFO ] Decomposing Gal with order
[2025-06-03 02:39:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:39:23] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-03 02:39:23] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:39:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2025-06-03 02:39:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5074734047992663234.gal : 2 ms
[2025-06-03 02:39:23] [INFO ] Time to serialize properties into /tmp/CTLFireability13547348302454213134.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/CTLFireability5074734047992663234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13547348302454213134.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,4.06656e+07,0.288333,10416,666,144,12709,1386,494,20169,116,4410,0


Converting to forward existential form...Done !
original formula: AX((EX((AF((i4.i1.u14.p101==1)) + AG((i3.u15.p92==1)))) + (!(A(A((i2.i1.u5.p27==1) U (i1.i0.u12.p20==1)) U !(((i6.i0.u26.p129==1)||(i1.i1...245
=> equivalent forward existential formula: ([(((EY(Init) * !(EX((!(EG(!((i4.i1.u14.p101==1)))) + !(E(TRUE U !((i3.u15.p92==1)))))))) * !(EG(!(!(((i6.i0.u26...593
Reverse transition relation is NOT exact ! Due to transitions t1, t44, t45, t74, t102, t146, t147, t148, t149, u43.t6, u43.t16, i1.i0.u3.t104, i1.i0.u12.t1...562
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,2.92621,82096,1,0,136981,11267,3187,213459,549,29372,297726
FORMULA FlexibleBarrier-PT-04b-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 LTL mode, iteration 0 : 212/212 places, 247/247 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 169 transition count 204
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 169 transition count 204
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 105 place count 150 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 124 place count 150 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 150 transition count 184
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 137 place count 138 transition count 172
Iterating global reduction 1 with 12 rules applied. Total rules applied 149 place count 138 transition count 172
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 155 place count 138 transition count 166
Applied a total of 155 rules in 5 ms. Remains 138 /212 variables (removed 74) and now considering 166/247 (removed 81) transitions.
// Phase 1: matrix 166 rows 138 cols
[2025-06-03 02:39:26] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:39:26] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-03 02:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:39:26] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-03 02:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/304 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 0/304 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 144 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12361 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/304 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 165/309 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:43] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:43] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:43] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:44] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:44] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:46] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:46] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:47] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:50] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:53] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:57] [INFO ] Deduced a trap along path composed of 4 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:02] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 28 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 321 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42400ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 42401ms
Starting structural reductions in LTL mode, iteration 1 : 138/212 places, 166/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42770 ms. Remains : 138/212 places, 166/247 transitions.
[2025-06-03 02:40:09] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:40:09] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:40:09] [INFO ] Input system was already deterministic with 166 transitions.
[2025-06-03 02:40:09] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:40:09] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:40:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8606296536572582810.gal : 1 ms
[2025-06-03 02:40:09] [INFO ] Time to serialize properties into /tmp/CTLFireability1650009857868940891.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/CTLFireability8606296536572582810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1650009857868940891.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,3.44683e+07,1.26208,28324,2,5440,5,104137,6,0,720,128792,0


Converting to forward existential form...Done !
original formula: (AF((EF((((p34==0)||(p265==0))||(p253==1))) * AG(EX(((p142==0)||(p265==0)))))) * AF((p189==0)))
=> equivalent forward existential formula: ([FwdG(Init,!((E(TRUE U (((p34==0)||(p265==0))||(p253==1))) * !(E(TRUE U !(EX(((p142==0)||(p265==0)))))))))] = F...196
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t16, t19, t23, t30, t33, t34, t45, t46, t48, t50, t55, t59, t60, t72, t73, t7...337
(forward)formula 0,0,20.304,431876,1,0,358,2.71142e+06,365,169,4619,1.90035e+06,416
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 02:40:29] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:40:29] [INFO ] Flatten gal took : 9 ms
Total runtime 937724 ms.

BK_STOP 1748918429782

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ 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-04b"
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-04b, 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-174860102500410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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