Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 94K 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-10a-CTLFireability-2023-12
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2023-13
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2023-14
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2023-15
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-00
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-01
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-02
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-03
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-04
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-05
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-06
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-07
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-08
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-09
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-10
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748930302826

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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 05:58:25] [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 05:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:58:25] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2025-06-03 05:58:25] [INFO ] Transformed 123 places.
[2025-06-03 05:58:25] [INFO ] Transformed 334 transitions.
[2025-06-03 05:58:25] [INFO ] Found NUPN structural information;
[2025-06-03 05:58:26] [INFO ] Parsed PT model containing 123 places and 334 transitions and 1467 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
Support contains 67 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 51 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2025-06-03 05:58:26] [INFO ] Computed 12 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:58:26] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-06-03 05:58:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:58:27] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 05:58:27] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 05:58:27] [INFO ] Invariant cache hit.
[2025-06-03 05:58:27] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 24688 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 21954 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46944ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 46986ms
Starting structural reductions in LTL mode, iteration 1 : 123/123 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48120 ms. Remains : 123/123 places, 242/252 transitions.
Support contains 67 out of 123 places after structural reductions.
[2025-06-03 05:59:14] [INFO ] Flatten gal took : 56 ms
[2025-06-03 05:59:14] [INFO ] Flatten gal took : 39 ms
[2025-06-03 05:59:14] [INFO ] Input system was already deterministic with 242 transitions.
Reduction of identical properties reduced properties to check from 93 to 87
RANDOM walk for 40000 steps (8 resets) in 1615 ms. (24 steps per ms) remains 2/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2025-06-03 05:59:15] [INFO ] Invariant cache hit.
[2025-06-03 05:59:15] [INFO ] State equation strengthened by 141 read => feed constraints.
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/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp47 is UNSAT
After SMT solving in domain Real declared 87/365 variables, and 21 constraints, problems are : Problem set: 2 solved, 0 unsolved in 59 ms.
Refiners :[Domain max(s): 12/123 constraints, Positive P Invariants (semi-flows): 9/12 constraints, State Equation: 0/123 constraints, ReadFeed: 0/141 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-03 05:59:15] [INFO ] Flatten gal took : 22 ms
[2025-06-03 05:59:15] [INFO ] Flatten gal took : 16 ms
[2025-06-03 05:59:15] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 05:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:15] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-03 05:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:16] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 05:59:16] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 05:59:16] [INFO ] Invariant cache hit.
[2025-06-03 05:59:16] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 20170 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17594 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37910ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 37915ms
Finished structural reductions in LTL mode , in 1 iterations and 38444 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 05:59:54] [INFO ] Flatten gal took : 16 ms
[2025-06-03 05:59:54] [INFO ] Flatten gal took : 16 ms
[2025-06-03 05:59:54] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 05:59:54] [INFO ] Flatten gal took : 14 ms
[2025-06-03 05:59:54] [INFO ] Flatten gal took : 14 ms
[2025-06-03 05:59:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14852492287422364739.gal : 8 ms
[2025-06-03 05:59:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10445664995020791930.ctl : 4 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/CTLFireability14852492287422364739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10445664995020791930.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,6.19174e+10,0.784167,25932,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: (A(A(!(((E((p35==1) U (p47==1)) + EG(((p35==1)&&(p121==1)))) + A((p75==1) U (((p12==1)&&(p107==1))&&(p121==1))))) U (((p116==1) * ((AG((p...604
=> equivalent forward existential formula: ([((Init * !(EG(!(!(E(TRUE U !(E(TRUE U !(!(((p76==1)&&(p122==1)))))))))))) * !(E(!(!(E(TRUE U !(E(TRUE U !(!(((...1606
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.3312,27416,1,0,7,143754,24,1,3965,65272,8
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-00 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 : 123/123 places, 242/242 transitions.
Graph (trivial) has 91 edges and 123 vertex of which 21 / 123 are part of one of the 7 SCC in 4 ms
Free SCC test removed 14 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 100 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 79 place count 100 transition count 144
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 100 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 99 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 99 transition count 143
Applied a total of 82 rules in 73 ms. Remains 99 /123 variables (removed 24) and now considering 143/242 (removed 99) transitions.
[2025-06-03 05:59:55] [INFO ] Flow matrix only has 137 transitions (discarded 6 similar events)
// Phase 1: matrix 137 rows 99 cols
[2025-06-03 05:59:55] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:55] [INFO ] Implicit Places using invariants in 122 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 98/123 places, 143/242 transitions.
Graph (trivial) has 117 edges and 98 vertex of which 41 / 98 are part of one of the 10 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 67 transition count 86
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 55 transition count 86
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 25 place count 55 transition count 76
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 45 place count 45 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 52 place count 45 transition count 69
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 38 transition count 62
Applied a total of 66 rules in 14 ms. Remains 38 /98 variables (removed 60) and now considering 62/143 (removed 81) transitions.
[2025-06-03 05:59:55] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 38 cols
[2025-06-03 05:59:55] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-03 05:59:55] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2025-06-03 05:59:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:55] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-03 05:59:56] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 38/123 places, 62/242 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 328 ms. Remains : 38/123 places, 62/242 transitions.
[2025-06-03 05:59:56] [INFO ] Flatten gal took : 5 ms
[2025-06-03 05:59:56] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:59:56] [INFO ] Input system was already deterministic with 62 transitions.
[2025-06-03 05:59:56] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:59:56] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:59:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16677175887219589318.gal : 2 ms
[2025-06-03 05:59:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15611012578413499601.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/CTLFireability16677175887219589318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15611012578413499601.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,50177,0.012274,4060,2,117,5,766,6,0,204,540,0


Converting to forward existential form...Done !
original formula: AG((AG(EF((((p95==1)&&(p108==1))&&(p121==1)))) + E(((p11==1)&&(p121==1)) U EF((p92==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(E(((p11==1)&&(p121==1)) U E(TRUE U (p92==1))))),TRUE) * !(E(TRUE U (((p95==1)&&(p108...184
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.024603,4316,1,0,6,2812,14,0,936,901,5
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-01 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 : 123/123 places, 242/242 transitions.
Graph (trivial) has 83 edges and 123 vertex of which 12 / 123 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 108 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 60 place count 108 transition count 179
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 108 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 106 transition count 177
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 106 transition count 177
Applied a total of 68 rules in 46 ms. Remains 106 /123 variables (removed 17) and now considering 177/242 (removed 65) transitions.
[2025-06-03 05:59:56] [INFO ] Flow matrix only has 171 transitions (discarded 6 similar events)
// Phase 1: matrix 171 rows 106 cols
[2025-06-03 05:59:56] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:56] [INFO ] Implicit Places using invariants in 133 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 105/123 places, 177/242 transitions.
Graph (trivial) has 116 edges and 105 vertex of which 30 / 105 are part of one of the 9 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 134
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 70 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 69 transition count 133
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 69 transition count 123
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 59 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 58 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 58 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 58 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 65 place count 54 transition count 114
Applied a total of 65 rules in 32 ms. Remains 54 /105 variables (removed 51) and now considering 114/177 (removed 63) transitions.
[2025-06-03 05:59:56] [INFO ] Flow matrix only has 103 transitions (discarded 11 similar events)
// Phase 1: matrix 103 rows 54 cols
[2025-06-03 05:59:56] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-03 05:59:56] [INFO ] Flow matrix only has 103 transitions (discarded 11 similar events)
[2025-06-03 05:59:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-03 05:59:56] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/123 places, 114/242 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 380 ms. Remains : 54/123 places, 114/242 transitions.
[2025-06-03 05:59:56] [INFO ] Flatten gal took : 9 ms
[2025-06-03 05:59:56] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:59:56] [INFO ] Input system was already deterministic with 114 transitions.
[2025-06-03 05:59:56] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:59:56] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:59:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10806392891733755440.gal : 3 ms
[2025-06-03 05:59:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11954113129156733878.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/CTLFireability10806392891733755440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11954113129156733878.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.42021e+06,0.055103,4752,2,341,5,4311,6,0,320,3223,0


Converting to forward existential form...Done !
original formula: EG(AF((AG((p51==0)) * !(E(((((p83==1)&&(p96==1))&&((p121==1)&&(p24==1)))&&((p47==1)&&(p121==1))) U A((p107==1) U (((p60==1)&&(p95==1))&&(...170
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!(E(TRUE U !((p51==0)))) * !(E(((((p83==1)&&(p96==1))&&((p121==1)&&(p24==1)))&&((p47==1)&&(p1...326
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 64/0/50
Hit Full ! (commute/partial/dont) 62/163/52
(forward)formula 0,0,0.206018,7184,1,0,13,18662,42,2,1974,8830,17
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2025-06-03 05:59:56] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:56] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-03 05:59:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:59:57] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 05:59:57] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 05:59:57] [INFO ] Invariant cache hit.
[2025-06-03 05:59:57] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 18133 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 20549 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38802ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 38805ms
Finished structural reductions in LTL mode , in 1 iterations and 39191 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 06:00:35] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:00:35] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:00:35] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:00:35] [INFO ] Flatten gal took : 10 ms
[2025-06-03 06:00:35] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:00:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7630126612801309311.gal : 4 ms
[2025-06-03 06:00:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7391267390716495870.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/CTLFireability7630126612801309311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7391267390716495870.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,6.19174e+10,0.882224,25832,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: (EF((AF(!(E(((p71==1)&&(p121==1)) U (p113==1)))) + (((EG((p36==0)) * AX((p39==0))) * ((p23==1)&&(p48==1))) * (p121==1)))) * (EF(EX(AG((((...404
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(EG(!(!(E(((p71==1)&&(p121==1)) U (p113==1)))))) + (((EG((p36==0)) * !(EX(!((p39==0))))) ...841
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 148/77/94
Using saturation style SCC detection
(forward)formula 0,1,2.76609,65392,1,0,27,462331,53,8,4395,158704,34
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-03 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 : 123/123 places, 242/242 transitions.
Graph (trivial) has 87 edges and 123 vertex of which 21 / 123 are part of one of the 7 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 100 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 0 with 54 rules applied. Total rules applied 73 place count 100 transition count 150
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 100 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 99 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 99 transition count 149
Applied a total of 76 rules in 28 ms. Remains 99 /123 variables (removed 24) and now considering 149/242 (removed 93) transitions.
[2025-06-03 06:00:38] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
// Phase 1: matrix 138 rows 99 cols
[2025-06-03 06:00:38] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:00:38] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-03 06:00:38] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2025-06-03 06:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:00:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-03 06:00:39] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:00:39] [INFO ] Redundant transitions in 5 ms returned []
Running 148 sub problems to find dead transitions.
[2025-06-03 06:00:39] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2025-06-03 06:00:39] [INFO ] Invariant cache hit.
[2025-06-03 06:00:39] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/178 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 1/237 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 179 constraints, problems are : Problem set: 0 solved, 148 unsolved in 12478 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 99/99 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/178 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 148/326 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 1/237 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 327 constraints, problems are : Problem set: 0 solved, 148 unsolved in 13196 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 99/99 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25697ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 25702ms
Starting structural reductions in SI_CTL mode, iteration 1 : 99/123 places, 149/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25990 ms. Remains : 99/123 places, 149/242 transitions.
[2025-06-03 06:01:04] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:01:04] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:01:04] [INFO ] Input system was already deterministic with 149 transitions.
[2025-06-03 06:01:04] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:01:04] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:01:04] [INFO ] Time to serialize gal into /tmp/CTLFireability376671082355836346.gal : 3 ms
[2025-06-03 06:01:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1645420943035023618.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/CTLFireability376671082355836346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1645420943035023618.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.36613e+09,0.280566,10004,2,577,5,38530,6,0,536,19114,0


Converting to forward existential form...Done !
original formula: AG(((EG((p20==0)) + (p61==0)) + ((((p60==1)&&(p71==1))&&((p121==1)&&(p46==1)))&&((p19==1)&&(p122==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((((p60==1)&&(p71==1))&&((p121==1)&&(p46==1)))&&((p19==1)&&(p122==1))))) * !((p61==0))) ...182
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.453034,10260,1,0,13,38530,22,6,2462,19114,9
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2025-06-03 06:01:05] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:01:05] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-03 06:01:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:01:05] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:01:05] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:01:05] [INFO ] Invariant cache hit.
[2025-06-03 06:01:05] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23064 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 20097 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43244ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 43245ms
Finished structural reductions in LTL mode , in 1 iterations and 43720 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 06:01:49] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:01:49] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:01:49] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:01:49] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:01:49] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:01:49] [INFO ] Time to serialize gal into /tmp/CTLFireability12916644094067068365.gal : 3 ms
[2025-06-03 06:01:49] [INFO ] Time to serialize properties into /tmp/CTLFireability5252058213398892045.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/CTLFireability12916644094067068365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5252058213398892045.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,6.19174e+10,0.878355,25720,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: E(AG((EG(EF(((p88==1)&&(p122==1)))) + !(((p119==1)&&(p121==1))))) U ((EG((p5==1)) * AG((EG((((p84==1)&&(p107==1))&&(p121==1))) * EG((((p4...254
=> equivalent forward existential formula: [(((FwdU(Init,!(E(TRUE U !((EG(E(TRUE U ((p88==1)&&(p122==1)))) + !(((p119==1)&&(p121==1)))))))) * (EG((p5==1)) ...330
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,2.07789,41652,1,0,15,255909,43,3,4155,86306,16
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-05 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 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:01:51] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-03 06:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:01:51] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:01:51] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:01:51] [INFO ] Invariant cache hit.
[2025-06-03 06:01:51] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 21132 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 18576 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39754ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 39755ms
Finished structural reductions in LTL mode , in 1 iterations and 40215 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 06:02:31] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:02:31] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:02:31] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:02:31] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:02:31] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:02:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7063006562091911844.gal : 3 ms
[2025-06-03 06:02:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12523179529388114353.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/CTLFireability7063006562091911844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12523179529388114353.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,6.19174e+10,0.908304,25856,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: !(E(!(A((p73==1) U (p92==1))) U ((!(AG((((p96==1)&&(p107==1))&&(p121==1)))) + EX(((p21==1)&&(p122==1)))) * (AG((p60==1)) + ((p88==1)&&(p1...166
=> equivalent forward existential formula: ([((FwdU(Init,!(!((E(!((p92==1)) U (!((p73==1)) * !((p92==1)))) + EG(!((p92==1))))))) * (!(!(E(TRUE U !((((p96==...461
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 239/0/3
(forward)formula 0,1,6.45823,161944,1,0,240,818600,38,159,4005,877736,253
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-06 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 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:02:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:02:38] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-03 06:02:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:02:38] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:02:38] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:02:38] [INFO ] Invariant cache hit.
[2025-06-03 06:02:38] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22732 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 18187 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40987ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 40990ms
Finished structural reductions in LTL mode , in 1 iterations and 41440 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 06:03:19] [INFO ] Flatten gal took : 13 ms
[2025-06-03 06:03:19] [INFO ] Flatten gal took : 14 ms
[2025-06-03 06:03:19] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:03:19] [INFO ] Flatten gal took : 12 ms
[2025-06-03 06:03:19] [INFO ] Flatten gal took : 13 ms
[2025-06-03 06:03:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8435248727000415253.gal : 4 ms
[2025-06-03 06:03:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8916914324876345142.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/CTLFireability8435248727000415253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8916914324876345142.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,6.19174e+10,0.924149,25744,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: EF((AX((AX(((p119==0)||(p121==0))) + A(!(((p119==1)&&(p121==1))) U EF(((p52==1)&&(p122==1)))))) * EG(A(EG((p61==1)) U EF((((p24==1)&&(p11...178
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX(!((!(EX(!(((p119==0)||(p121==0))))) + !((E(!(E(TRUE U ((p52==1)&&(p122==1)))) U (!...460
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.83665,40568,1,0,11,254070,28,2,4150,66392,16
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:03:21] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-03 06:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:03:21] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:03:21] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:03:21] [INFO ] Invariant cache hit.
[2025-06-03 06:03:21] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22461 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17889 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40419ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 40421ms
Finished structural reductions in LTL mode , in 1 iterations and 40805 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 06:04:02] [INFO ] Flatten gal took : 12 ms
[2025-06-03 06:04:02] [INFO ] Flatten gal took : 15 ms
[2025-06-03 06:04:02] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:04:02] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:04:02] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5510151265909656446.gal : 4 ms
[2025-06-03 06:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability15650455535275677387.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/CTLFireability5510151265909656446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15650455535275677387.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,6.19174e+10,0.804148,25880,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: A(!((!((((p23==1)&&(p96==1))&&(p121==1))) * ((((p11==1)&&(p72==1))&&(p121==1)) + AG((((p48==1)&&(p119==1))&&(p121==1)))))) U (E(EF((AX(((...367
=> equivalent forward existential formula: [((Init * !(EG(!((E(E(TRUE U (!(EX(!(((p21==1)&&(p122==1))))) * (p65!=1))) U ((p47==1)&&(p121==1))) + (!(E(TRUE ...1109
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 221/0/21
Hit Full ! (commute/partial/dont) 190/51/52
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,3.84686,97184,1,0,48,671246,59,31,4483,331576,58
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:04:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:04:06] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-03 06:04:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:04:06] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:04:06] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:04:06] [INFO ] Invariant cache hit.
[2025-06-03 06:04:06] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 21104 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 18053 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39224ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 39225ms
Finished structural reductions in LTL mode , in 1 iterations and 39616 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 06:04:45] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:04:45] [INFO ] Flatten gal took : 7 ms
[2025-06-03 06:04:45] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:04:45] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:04:45] [INFO ] Flatten gal took : 14 ms
[2025-06-03 06:04:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2667423390327039621.gal : 2 ms
[2025-06-03 06:04:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10823026067810734737.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/CTLFireability2667423390327039621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10823026067810734737.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,6.19174e+10,0.824833,25840,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: E((!(((p77==1)&&(p122==1))) + EG(AG((EX((((p23==1)&&(p60==1))&&(p121==1))) * !((((p35==1)&&(p72==1))&&(p121==1))))))) U ((EF(((p97==1) * ...221
=> equivalent forward existential formula: [(FwdU((FwdU(((FwdU(Init,(!(((p77==1)&&(p122==1))) + EG(!(E(TRUE U !((EX((((p23==1)&&(p60==1))&&(p121==1))) * !(...293
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,7.63322,177036,1,0,251,888758,34,169,4158,982056,263
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:04:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:04:53] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-03 06:04:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:04:53] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:04:53] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:04:53] [INFO ] Invariant cache hit.
[2025-06-03 06:04:53] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22176 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 21760 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43994ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 43996ms
Finished structural reductions in LTL mode , in 1 iterations and 44418 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 06:05:37] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:05:37] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:05:37] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:05:37] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:05:37] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:05:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15749788692866678697.gal : 2 ms
[2025-06-03 06:05:37] [INFO ] Time to serialize properties into /tmp/CTLFireability20924545951070282.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/CTLFireability15749788692866678697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability20924545951070282.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.19174e+10,0.825565,25752,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: E(!((EF((p101!=1)) * AX(E(((p26==1)&&(p122==1)) U (((p12==1)&&(p83==1))&&(p121==1)))))) U (E(!((EG((p44==1)) + AX(((p33==1)&&(p122==1))))...417
=> equivalent forward existential formula: ([((FwdU(Init,!((E(TRUE U (p101!=1)) * !(EX(!(E(((p26==1)&&(p122==1)) U (((p12==1)&&(p83==1))&&(p121==1)))))))))...790
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,2.15242,50552,1,0,23,315912,43,6,3996,126299,20
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-10 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 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:05:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:05:40] [INFO ] Implicit Places using invariants in 140 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 122/123 places, 242/242 transitions.
[2025-06-03 06:05:40] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:05:40] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:05:40] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:05:40] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:05:40] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:05:40] [INFO ] Time to serialize gal into /tmp/CTLFireability310014008507146677.gal : 1 ms
[2025-06-03 06:05:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10607540041230390145.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/CTLFireability310014008507146677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10607540041230390145.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,6.19174e+10,0.33777,12664,2,2113,5,48590,6,0,730,31170,0


Converting to forward existential form...Done !
original formula: (EG((((p48==0)||(p95==0))||(p121==0))) * EF(((AG((((p24==1)&&(p59==1))&&(p121==1))) * EX((((p24==1)&&(p35==1))&&(p121==1)))) * EX((((p84=...185
=> equivalent forward existential formula: [(EY((FwdU((Init * EG((((p48==0)||(p95==0))||(p121==0)))),TRUE) * (!(E(TRUE U !((((p24==1)&&(p59==1))&&(p121==1)...249
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.975711,23780,1,0,9,124844,17,0,3583,31170,8
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:05:41] [INFO ] Implicit Places using invariants in 114 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 122/123 places, 242/242 transitions.
[2025-06-03 06:05:41] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:05:41] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:05:41] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:05:41] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:05:41] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:05:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9612115445637172896.gal : 2 ms
[2025-06-03 06:05:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14044601369516606756.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/CTLFireability9612115445637172896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14044601369516606756.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,6.19174e+10,0.428836,12532,2,2113,5,48590,6,0,730,31170,0


Converting to forward existential form...Done !
original formula: EF(EX((AX((((p12==0)||(p47==0))||(p121==0))) + (((p36==1)&&(p95==1))&&((p121==1)&&(p99==1))))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EX(!((((p12==0)||(p47==0))||(p121==0))))))] != FALSE + [(EY(FwdU(Init,TRUE)) * (((p36...206
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.04653,24908,1,0,10,131116,11,2,3624,42008,5
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 80 edges and 123 vertex of which 15 / 123 are part of one of the 5 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 105 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 0 with 51 rules applied. Total rules applied 68 place count 105 transition count 167
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 105 transition count 167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 103 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 103 transition count 165
Applied a total of 76 rules in 25 ms. Remains 103 /123 variables (removed 20) and now considering 165/242 (removed 77) transitions.
[2025-06-03 06:05:42] [INFO ] Flow matrix only has 158 transitions (discarded 7 similar events)
// Phase 1: matrix 158 rows 103 cols
[2025-06-03 06:05:42] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:05:42] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-03 06:05:42] [INFO ] Flow matrix only has 158 transitions (discarded 7 similar events)
[2025-06-03 06:05:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:05:42] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-03 06:05:42] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:05:42] [INFO ] Redundant transitions in 6 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-03 06:05:42] [INFO ] Flow matrix only has 158 transitions (discarded 7 similar events)
[2025-06-03 06:05:42] [INFO ] Invariant cache hit.
[2025-06-03 06:05:42] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 157/260 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 83/198 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 1/261 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 199 constraints, problems are : Problem set: 0 solved, 164 unsolved in 14632 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 103/103 constraints, ReadFeed: 84/84 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/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 157/260 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 83/198 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 164/362 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 1/261 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/261 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 363 constraints, problems are : Problem set: 0 solved, 164 unsolved in 15914 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 103/103 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30561ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 30562ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/123 places, 165/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30850 ms. Remains : 103/123 places, 165/242 transitions.
[2025-06-03 06:06:13] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:06:13] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:06:13] [INFO ] Input system was already deterministic with 165 transitions.
[2025-06-03 06:06:13] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:06:13] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:06:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13618383485605016524.gal : 2 ms
[2025-06-03 06:06:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2300441861236705431.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/CTLFireability13618383485605016524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2300441861236705431.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,9.5099e+09,0.261759,9008,2,584,5,29191,6,0,570,18022,0


Converting to forward existential form...Done !
original formula: EF((AF(((E((((p12==1)&&(p47==1))&&(p121==1)) U (((p24==1)&&(p35==1))&&(p121==1))) * (p83==1)) * ((p31==0)||(p122==0)))) + EG(AF(((E(((p79...223
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(((E((((p12==1)&&(p47==1))&&(p121==1)) U (((p24==1)&&(p35==1))&&(p121==1))) * (p83==1...316
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 126/57/39
Using saturation style SCC detection
(forward)formula 0,1,0.622434,13488,1,0,15,56495,26,5,3110,21783,12
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2025-06-03 06:06:14] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:06:14] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-03 06:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:06:14] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:06:14] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:06:14] [INFO ] Invariant cache hit.
[2025-06-03 06:06:14] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 24231 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 19820 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44094ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 44094ms
Finished structural reductions in LTL mode , in 1 iterations and 44420 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 06:06:58] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:06:58] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:06:58] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:06:58] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:06:58] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:06:58] [INFO ] Time to serialize gal into /tmp/CTLFireability740456094157775975.gal : 1 ms
[2025-06-03 06:06:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8917935935489612612.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/CTLFireability740456094157775975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8917935935489612612.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.19174e+10,0.796654,25876,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: EF((((EX(AX((((p12==1)&&(p47==1))&&(p121==1)))) * (p11==1)) * ((p72==1)&&(p121==1))) * (EF(((p41==1)||(p20==1))) + ((p81==1)&&(p122==1)))...157
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * ((EX(!(EX(!((((p12==1)&&(p47==1))&&(p121==1)))))) * (p11==1)) * ((p72==1)&&(p121==1))...344
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.31045,27128,1,0,12,157283,15,0,3514,65272,8
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:06:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:07:00] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-03 06:07:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:07:00] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:07:00] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:07:00] [INFO ] Invariant cache hit.
[2025-06-03 06:07:00] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 24144 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 20829 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45040ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 45041ms
Finished structural reductions in LTL mode , in 1 iterations and 45459 ms. Remains : 123/123 places, 242/242 transitions.
[2025-06-03 06:07:45] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:07:45] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:07:45] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 06:07:45] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:07:45] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:07:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7147505980980638141.gal : 2 ms
[2025-06-03 06:07:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17514066523070680710.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/CTLFireability7147505980980638141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17514066523070680710.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,6.19174e+10,0.959346,25844,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: AX((AX((((p47==1)&&(p84==1))&&(p121==1))) + ((p88==1)&&(p122==1))))
=> equivalent forward existential formula: [(EY((EY(Init) * !(((p88==1)&&(p122==1))))) * !((((p47==1)&&(p84==1))&&(p121==1))))] = FALSE
(forward)formula 0,0,0.973574,25844,1,0,12,117376,11,4,1066,65272,4
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-03 06:07:46] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:07:46] [INFO ] Flatten gal took : 5 ms
Total runtime 561025 ms.

BK_STOP 1748930866494

--------------------
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-10a"
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-10a, 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-174860102500450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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