Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.0K Mar 7 05:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 05:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 7 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 7 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 05:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 05:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 7 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 169K Mar 3 18:30 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-14a-CTLFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779896410622

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-14a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-27 15:40:12] [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]
[2026-05-27 15:40:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 15:40:13] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2026-05-27 15:40:13] [INFO ] Transformed 171 places.
[2026-05-27 15:40:13] [INFO ] Transformed 578 transitions.
[2026-05-27 15:40:13] [INFO ] Found NUPN structural information;
[2026-05-27 15:40:13] [INFO ] Parsed PT model containing 171 places and 578 transitions and 2719 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
Support contains 56 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 408/408 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 171 transition count 394
Applied a total of 14 rules in 43 ms. Remains 171 /171 variables (removed 0) and now considering 394/408 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13269138943270223436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7613479698715187941.kers'
[2026-05-27 15:40:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13269138943270223436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7613479698715187941.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 394 rows 169 cols 1139 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 15:40:13] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7613479698715187941.kers
Total runtime 3 ms.
[2026-05-27 15:40:14] [INFO ] Implicit Places using invariants in 468 ms returned []
[2026-05-27 15:40:14] [INFO ] Invariant cache hit.
[2026-05-27 15:40:14] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:40:14] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2026-05-27 15:40:14] [INFO ] Invariant cache hit.
[2026-05-27 15:40:14] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30057 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30029 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60468ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60495ms
Starting structural reductions in LTL mode, iteration 1 : 171/171 places, 394/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61644 ms. Remains : 171/171 places, 394/408 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 12 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:41:15] [INFO ] Invariant cache hit.
[2026-05-27 15:41:15] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-27 15:41:15] [INFO ] Invariant cache hit.
[2026-05-27 15:41:15] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:41:15] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 171/171 places, 394/394 transitions.
Support contains 56 out of 171 places after structural reductions.
[2026-05-27 15:41:16] [INFO ] Flatten gal took : 104 ms
[2026-05-27 15:41:16] [INFO ] Flatten gal took : 60 ms
[2026-05-27 15:41:16] [INFO ] Input system was already deterministic with 394 transitions.
Reduction of identical properties reduced properties to check from 60 to 59
RANDOM walk for 40000 steps (8 resets) in 2160 ms. (18 steps per ms) remains 1/59 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2026-05-27 15:41:17] [INFO ] Invariant cache hit.
[2026-05-27 15:41:17] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 38/565 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Domain max(s): 5/171 constraints, Positive P Invariants (semi-flows): 4/16 constraints, State Equation: 0/171 constraints, ReadFeed: 0/253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-27 15:41:17] [INFO ] Flatten gal took : 22 ms
[2026-05-27 15:41:17] [INFO ] Flatten gal took : 26 ms
[2026-05-27 15:41:17] [INFO ] Input system was already deterministic with 394 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 9 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:41:17] [INFO ] Invariant cache hit.
[2026-05-27 15:41:17] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-27 15:41:17] [INFO ] Invariant cache hit.
[2026-05-27 15:41:17] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:41:17] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 551 ms. Remains : 171/171 places, 394/394 transitions.
[2026-05-27 15:41:17] [INFO ] Flatten gal took : 32 ms
[2026-05-27 15:41:18] [INFO ] Flatten gal took : 31 ms
[2026-05-27 15:41:18] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:41:18] [INFO ] Flatten gal took : 28 ms
[2026-05-27 15:41:18] [INFO ] Flatten gal took : 25 ms
[2026-05-27 15:41:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1252720203936218201.gal : 25 ms
[2026-05-27 15:41:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8479652718539257849.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1252720203936218201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8479652718539257849.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28392e+15,9.44366,189780,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: (AG(EF(EX(((p123==0)&&(p116==0))))) + A(((A((E((((p107==1)&&(p120==1))&&(p169==1)) U (((p60==1)&&(p143==1))&&(p169==1))) * EG((((p35==1)&...470
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!(((!(E(!(EX(!((((p60==1)&&(p95==1))&&(p169==1))))) U E(TRUE U (((p48==1)&&(p119==1))&&(p1...907
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,12.6783,189812,1,0,7,1.02525e+06,14,0,5678,583984,6
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-00 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 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 10 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:41:31] [INFO ] Invariant cache hit.
[2026-05-27 15:41:31] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-27 15:41:31] [INFO ] Invariant cache hit.
[2026-05-27 15:41:31] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:41:31] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 729 ms. Remains : 171/171 places, 394/394 transitions.
[2026-05-27 15:41:31] [INFO ] Flatten gal took : 24 ms
[2026-05-27 15:41:31] [INFO ] Flatten gal took : 25 ms
[2026-05-27 15:41:31] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:41:31] [INFO ] Flatten gal took : 23 ms
[2026-05-27 15:41:31] [INFO ] Flatten gal took : 23 ms
[2026-05-27 15:41:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16644461726419668139.gal : 9 ms
[2026-05-27 15:41:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1959291290738437502.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16644461726419668139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1959291290738437502.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28392e+15,8.3365,189828,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: E(AG(!(((((AF((((p47==1)&&(p72==1))&&(p169==1))) * A((p84==1) U (((p95==1)&&(p108==1))&&(p169==1)))) * (EG((((p24==1)&&(p95==1))&&(p169==...608
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(E(TRUE U !(!(((((!(EG(!((((p47==1)&&(p72==1))&&(p169==1))))) * !((E(!((((p95==1)&&(p108==1)...1371
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 205/327/189
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 205/0/189
(forward)formula 0,1,28.3878,504172,1,0,37,3.3983e+06,73,17,7290,1.45164e+06,35
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-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 : 171/171 places, 394/394 transitions.
Graph (trivial) has 129 edges and 171 vertex of which 30 / 171 are part of one of the 10 SCC in 4 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 139 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 121 transitions
Redundant transition composition rules discarded 121 transitions
Iterating global reduction 0 with 121 rules applied. Total rules applied 146 place count 139 transition count 205
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 148 place count 139 transition count 205
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 150 place count 137 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 152 place count 137 transition count 203
Applied a total of 152 rules in 80 ms. Remains 137 /171 variables (removed 34) and now considering 203/394 (removed 191) transitions.
[2026-05-27 15:42:00] [INFO ] Flow matrix only has 194 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14539226262798936276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18189879064762549120.kers'
[2026-05-27 15:42:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14539226262798936276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18189879064762549120.kers]
Normalized transition count is 193 out of 194 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 193 rows 135 cols 423 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-27 15:42:00] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18189879064762549120.kers
Total runtime 2 ms.
[2026-05-27 15:42:00] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-27 15:42:00] [INFO ] Flow matrix only has 194 transitions (discarded 9 similar events)
[2026-05-27 15:42:00] [INFO ] Invariant cache hit.
[2026-05-27 15:42:00] [INFO ] State equation strengthened by 97 read => feed constraints.
[2026-05-27 15:42:00] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2026-05-27 15:42:00] [INFO ] Redundant transitions in 9 ms returned []
Running 202 sub problems to find dead transitions.
[2026-05-27 15:42:00] [INFO ] Flow matrix only has 194 transitions (discarded 9 similar events)
[2026-05-27 15:42:00] [INFO ] Invariant cache hit.
[2026-05-27 15:42:00] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 193/330 variables, 137/153 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 96/249 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 1/331 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 250 constraints, problems are : Problem set: 0 solved, 202 unsolved in 15523 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 137/137 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 193/330 variables, 137/153 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 96/249 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 202/451 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 1/331 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 0/331 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 452 constraints, problems are : Problem set: 0 solved, 202 unsolved in 19218 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 137/137 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34777ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 34781ms
Starting structural reductions in SI_CTL mode, iteration 1 : 137/171 places, 203/394 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35206 ms. Remains : 137/171 places, 203/394 transitions.
[2026-05-27 15:42:35] [INFO ] Flatten gal took : 12 ms
[2026-05-27 15:42:35] [INFO ] Flatten gal took : 6 ms
[2026-05-27 15:42:35] [INFO ] Input system was already deterministic with 203 transitions.
[2026-05-27 15:42:35] [INFO ] Flatten gal took : 6 ms
[2026-05-27 15:42:35] [INFO ] Flatten gal took : 5 ms
[2026-05-27 15:42:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4695797211710783907.gal : 2 ms
[2026-05-27 15:42:35] [INFO ] Time to serialize properties into /tmp/CTLFireability1536450879199829726.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4695797211710783907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1536450879199829726.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.105e+13,1.27912,30768,2,1508,5,179313,6,0,739,73140,0


Converting to forward existential form...Done !
original formula: AF((AG(!(A((((p124==1)&&(p170==1))||(((p131==1)&&(p156==1))&&(p169==1))) U AG((((p12==1)&&(p143==1))&&(p169==1)))))) + ((p5==1)&&(p170==1...159
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(!(!((E(!(!(E(TRUE U !((((p12==1)&&(p143==1))&&(p169==1)))))) U (!((((p124==1)&&(p170=...357
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.71421,30864,1,0,9,179313,25,2,3587,73140,13
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-02 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 : 171/171 places, 394/394 transitions.
Graph (trivial) has 134 edges and 171 vertex of which 36 / 171 are part of one of the 12 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 134 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 139 place count 134 transition count 190
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 140 place count 134 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 133 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 133 transition count 189
Applied a total of 142 rules in 38 ms. Remains 133 /171 variables (removed 38) and now considering 189/394 (removed 205) transitions.
[2026-05-27 15:42:37] [INFO ] Flow matrix only has 178 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16956733385150631552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15800384568192381203.kers'
[2026-05-27 15:42:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16956733385150631552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15800384568192381203.kers]
Normalized transition count is 177 out of 178 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 177 rows 131 cols 371 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-27 15:42:37] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15800384568192381203.kers
Total runtime 2 ms.
[2026-05-27 15:42:37] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-27 15:42:37] [INFO ] Flow matrix only has 178 transitions (discarded 11 similar events)
[2026-05-27 15:42:37] [INFO ] Invariant cache hit.
[2026-05-27 15:42:37] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-27 15:42:37] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2026-05-27 15:42:37] [INFO ] Redundant transitions in 11 ms returned []
Running 188 sub problems to find dead transitions.
[2026-05-27 15:42:37] [INFO ] Flow matrix only has 178 transitions (discarded 11 similar events)
[2026-05-27 15:42:37] [INFO ] Invariant cache hit.
[2026-05-27 15:42:37] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 177/310 variables, 133/149 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 86/235 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 1/311 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 236 constraints, problems are : Problem set: 0 solved, 188 unsolved in 15246 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 177/310 variables, 133/149 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 86/235 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 188/423 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 1/311 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 424 constraints, problems are : Problem set: 0 solved, 188 unsolved in 14780 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30059ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 30060ms
Starting structural reductions in SI_CTL mode, iteration 1 : 133/171 places, 189/394 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30450 ms. Remains : 133/171 places, 189/394 transitions.
[2026-05-27 15:43:07] [INFO ] Flatten gal took : 8 ms
[2026-05-27 15:43:07] [INFO ] Flatten gal took : 5 ms
[2026-05-27 15:43:08] [INFO ] Input system was already deterministic with 189 transitions.
[2026-05-27 15:43:08] [INFO ] Flatten gal took : 10 ms
[2026-05-27 15:43:08] [INFO ] Flatten gal took : 12 ms
[2026-05-27 15:43:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8498702770045131241.gal : 1 ms
[2026-05-27 15:43:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2194859830336418590.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8498702770045131241.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2194859830336418590.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 11287 steps (2 resets) in 150 ms. (74 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality2194859830336418590.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8014037596883537305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13244510146172195044.kers'
[2026-05-27 15:43:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8014037596883537305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13244510146172195044.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 394 rows 169 cols 1139 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 15:43:08] [INFO ] Computed 16 invariants in 3 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13244510146172195044.kers
Total runtime 4 ms.
[2026-05-27 15:43:08] [INFO ] Implicit Places using invariants in 201 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 222 ms. Remains : 170/171 places, 394/394 transitions.
[2026-05-27 15:43:08] [INFO ] Flatten gal took : 17 ms
[2026-05-27 15:43:08] [INFO ] Flatten gal took : 18 ms
[2026-05-27 15:43:08] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:43:08] [INFO ] Flatten gal took : 16 ms
[2026-05-27 15:43:08] [INFO ] Flatten gal took : 18 ms
[2026-05-27 15:43:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17410126729754320535.gal : 6 ms
[2026-05-27 15:43:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5728418622610503351.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17410126729754320535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5728418622610503351.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28392e+15,3.50197,75320,2,12173,5,421813,6,0,1074,240937,0


Converting to forward existential form...Done !
original formula: !(A((E(EX((((p24==1)&&(p71==1))&&(p169==1))) U AG((p39==1))) * !((((p47==1)&&(p144==1))&&(p169==1)))) U EF(AX(AF((p61==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(EX(!(!(EG(!((p61==1)))))))))) * !((E(EX((((p24==1)&&(p71==1))&&(p169==1))) U !(E(TRUE...337
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,12.4276,247052,1,0,12,1.56831e+06,32,1,6272,554855,16
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-04 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 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:43:21] [INFO ] Invariant cache hit.
[2026-05-27 15:43:21] [INFO ] Implicit Places using invariants in 226 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 227 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 170/171 places, 394/394 transitions.
[2026-05-27 15:43:21] [INFO ] Flatten gal took : 11 ms
[2026-05-27 15:43:21] [INFO ] Flatten gal took : 11 ms
[2026-05-27 15:43:21] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:43:21] [INFO ] Flatten gal took : 12 ms
[2026-05-27 15:43:21] [INFO ] Flatten gal took : 11 ms
[2026-05-27 15:43:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4179446839989698106.gal : 4 ms
[2026-05-27 15:43:21] [INFO ] Time to serialize properties into /tmp/CTLFireability16180915442635967763.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4179446839989698106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16180915442635967763.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28392e+15,3.24647,75300,2,12173,5,421813,6,0,1074,240937,0


Converting to forward existential form...Done !
original formula: EF(AG(A(EX((((p60==1)&&(p119==1))&&(p169==1))) U AG(!((((p120==1)&&(p143==1))&&(p169==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(!(E(TRUE U !(!((((p120==1)&&(p143==1))&&(p169==1))))))) U (!(EX((((p60==...325
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,10.8271,204676,1,0,10,1.38988e+06,18,2,5981,422931,15
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:43:32] [INFO ] Invariant cache hit.
[2026-05-27 15:43:32] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-27 15:43:32] [INFO ] Invariant cache hit.
[2026-05-27 15:43:32] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:43:32] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2026-05-27 15:43:32] [INFO ] Invariant cache hit.
[2026-05-27 15:43:32] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30017 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30025 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 171/171 places, 394/394 transitions.
[2026-05-27 15:44:33] [INFO ] Flatten gal took : 15 ms
[2026-05-27 15:44:33] [INFO ] Flatten gal took : 18 ms
[2026-05-27 15:44:33] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:44:33] [INFO ] Flatten gal took : 15 ms
[2026-05-27 15:44:33] [INFO ] Flatten gal took : 16 ms
[2026-05-27 15:44:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11546282645370565110.gal : 6 ms
[2026-05-27 15:44:33] [INFO ] Time to serialize properties into /tmp/CTLFireability40788807072990920.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11546282645370565110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability40788807072990920.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.28392e+15,9.07158,189800,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: EF((AF(((((((p12==1)&&(p119==1))&&(p169==1))||((p163==1)&&(p170==1)))||((p107==0)||(p144==0)))||(p169==0))) * AX(EF(((p161==1)&&(p170==1)...160
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((((((p12==1)&&(p119==1))&&(p169==1))||((p163==1)&&(p170==1)))||((p107==0)||(p144==0...230
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,13.0629,189800,1,0,9,1.02525e+06,24,2,6181,583984,10
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:44:46] [INFO ] Invariant cache hit.
[2026-05-27 15:44:46] [INFO ] Implicit Places using invariants in 174 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 175 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 170/171 places, 394/394 transitions.
[2026-05-27 15:44:46] [INFO ] Flatten gal took : 13 ms
[2026-05-27 15:44:46] [INFO ] Flatten gal took : 8 ms
[2026-05-27 15:44:46] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:44:46] [INFO ] Flatten gal took : 8 ms
[2026-05-27 15:44:46] [INFO ] Flatten gal took : 9 ms
[2026-05-27 15:44:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11315678612851911607.gal : 3 ms
[2026-05-27 15:44:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2469632310674282225.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11315678612851911607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2469632310674282225.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28392e+15,3.38227,75660,2,12173,5,421813,6,0,1074,240937,0


Converting to forward existential form...Done !
original formula: AG(EX(EF(EX(EG((((p36==1)&&(p155==1))&&(p169==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U EX(EG((((p36==1)&&(p155==1))&&(p169==1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,10.7457,194568,1,0,8,1.27131e+06,22,0,5979,362996,10
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-07 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 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:44:57] [INFO ] Invariant cache hit.
[2026-05-27 15:44:57] [INFO ] Implicit Places using invariants in 248 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 250 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 255 ms. Remains : 170/171 places, 394/394 transitions.
[2026-05-27 15:44:57] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:44:57] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:44:57] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:44:57] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:44:57] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:44:57] [INFO ] Time to serialize gal into /tmp/CTLFireability3853953712139334085.gal : 3 ms
[2026-05-27 15:44:57] [INFO ] Time to serialize properties into /tmp/CTLFireability18412649643017521228.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3853953712139334085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18412649643017521228.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28392e+15,8.14656,163732,2,19584,5,1.22881e+06,6,0,1074,459490,0


Converting to forward existential form...Done !
original formula: AG(EX(EF(((p165==1)&&(p170==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U ((p165==1)&&(p170==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,18.7651,305696,1,0,6,1.92555e+06,14,0,5238,459490,5
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-08 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 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:45:16] [INFO ] Invariant cache hit.
[2026-05-27 15:45:16] [INFO ] Implicit Places using invariants in 181 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 170/171 places, 394/394 transitions.
[2026-05-27 15:45:16] [INFO ] Flatten gal took : 6 ms
[2026-05-27 15:45:16] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:45:16] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:45:16] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:45:16] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:45:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6723097102174107581.gal : 2 ms
[2026-05-27 15:45:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4208039284156300608.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6723097102174107581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4208039284156300608.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28392e+15,2.92861,75868,2,12173,5,421813,6,0,1074,240937,0


Converting to forward existential form...Done !
original formula: EF(AG(((((p24==0)||(p131==0))||(p169==0)) * ((AX((p142==1)) + (p84==0)) + ((p143==0)||(p169==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((p24==0)||(p131==0))||(p169==0)) * ((!(EX(!((p142==1)))) + (p84==0)) + ((p14...188
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,9.13342,190712,1,0,12,1.34638e+06,18,3,5553,307820,9
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 135 edges and 171 vertex of which 36 / 171 are part of one of the 12 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 134 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 139 place count 134 transition count 190
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 140 place count 134 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 133 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 133 transition count 189
Applied a total of 142 rules in 42 ms. Remains 133 /171 variables (removed 38) and now considering 189/394 (removed 205) transitions.
[2026-05-27 15:45:26] [INFO ] Flow matrix only has 178 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6879672293875387455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3204455588584967013.kers'
[2026-05-27 15:45:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6879672293875387455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3204455588584967013.kers]
Normalized transition count is 177 out of 178 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 177 rows 131 cols 371 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-27 15:45:26] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3204455588584967013.kers
Total runtime 4 ms.
[2026-05-27 15:45:26] [INFO ] Implicit Places using invariants in 182 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 184 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 132/171 places, 189/394 transitions.
Graph (trivial) has 167 edges and 132 vertex of which 64 / 132 are part of one of the 14 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 82 transition count 99
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 66 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 33 place count 66 transition count 86
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 53 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 71 place count 53 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 95 place count 41 transition count 62
Applied a total of 95 rules in 19 ms. Remains 41 /132 variables (removed 91) and now considering 62/189 (removed 127) transitions.
[2026-05-27 15:45:26] [INFO ] Flow matrix only has 49 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2490859803183560357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10772507112914757731.kers'
[2026-05-27 15:45:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2490859803183560357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10772507112914757731.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 48 rows 40 cols 113 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-27 15:45:26] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10772507112914757731.kers
Total runtime 1 ms.
[2026-05-27 15:45:26] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-27 15:45:26] [INFO ] Flow matrix only has 49 transitions (discarded 13 similar events)
[2026-05-27 15:45:26] [INFO ] Invariant cache hit.
[2026-05-27 15:45:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-27 15:45:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 41/171 places, 62/394 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 344 ms. Remains : 41/171 places, 62/394 transitions.
[2026-05-27 15:45:26] [INFO ] Flatten gal took : 1 ms
[2026-05-27 15:45:26] [INFO ] Flatten gal took : 1 ms
[2026-05-27 15:45:26] [INFO ] Input system was already deterministic with 62 transitions.
[2026-05-27 15:45:26] [INFO ] Flatten gal took : 2 ms
[2026-05-27 15:45:26] [INFO ] Flatten gal took : 2 ms
[2026-05-27 15:45:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1991898334013626148.gal : 1 ms
[2026-05-27 15:45:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6269606299384876078.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1991898334013626148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6269606299384876078.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,301057,0.011787,4148,2,169,5,936,6,0,212,648,0


Converting to forward existential form...Done !
original formula: A((((p47==1)&&(p144==1))&&(p169==1)) U EF(AG(((p150==1)&&(p169==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U !(((p150==1)&&(p169==1)))))))))) * !(E(!(E(TRUE U !(E(TRUE U !(((p150==1)&&...279
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.029975,4920,1,0,7,3837,17,1,975,973,8
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1211201495485471670.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7336440526170090872.kers'
[2026-05-27 15:45:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1211201495485471670.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7336440526170090872.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 394 rows 169 cols 1139 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 15:45:26] [INFO ] Computed 16 invariants in 4 ms
Computed 16 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7336440526170090872.kers
Total runtime 5 ms.
[2026-05-27 15:45:26] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-27 15:45:26] [INFO ] Invariant cache hit.
[2026-05-27 15:45:26] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:45:26] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 171/171 places, 394/394 transitions.
[2026-05-27 15:45:27] [INFO ] Flatten gal took : 6 ms
[2026-05-27 15:45:27] [INFO ] Flatten gal took : 6 ms
[2026-05-27 15:45:27] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:45:27] [INFO ] Flatten gal took : 6 ms
[2026-05-27 15:45:27] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:45:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8749317198041647853.gal : 3 ms
[2026-05-27 15:45:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1385903565620583879.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8749317198041647853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1385903565620583879.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28392e+15,9.64981,189844,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: EX(E(!(((AG((p29==1)) + AX((p108==1))) + E(((((p59==1)&&(p144==1))&&((p169==1)&&(p126==1)))&&(p169==1)) U ((((p35==1)&&(p144==1))&&((p169...282
=> equivalent forward existential formula: [((FwdU(EY(Init),!(((!(E(TRUE U !((p29==1)))) + !(EX(!((p108==1))))) + E(((((p59==1)&&(p144==1))&&((p169==1)&&(p...470
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,14.9066,194688,1,0,14,1.26658e+06,17,5,5682,583984,11
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-11 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 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:45:42] [INFO ] Invariant cache hit.
[2026-05-27 15:45:42] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-27 15:45:42] [INFO ] Invariant cache hit.
[2026-05-27 15:45:42] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:45:42] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 171/171 places, 394/394 transitions.
[2026-05-27 15:45:42] [INFO ] Flatten gal took : 6 ms
[2026-05-27 15:45:42] [INFO ] Flatten gal took : 6 ms
[2026-05-27 15:45:42] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:45:42] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:45:42] [INFO ] Flatten gal took : 7 ms
[2026-05-27 15:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12978306094265287008.gal : 2 ms
[2026-05-27 15:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability13854067224303484830.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12978306094265287008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13854067224303484830.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.28392e+15,9.14367,189804,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: EF(((p68==1) * ((((p136==0)||(p170==0))&&(((p96==0)||(p131==0))||(p169==0))) + ((AX((((p23==0)||(p144==0))||(p169==0))) * AF((p85==0))) *...273
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (p68==1)) * (((p136==0)||(p170==0))&&(((p96==0)||(p131==0))||(p169==0))))] != FALSE + ([((...572
(forward)formula 0,1,9.16339,189804,1,0,8,1.02525e+06,9,2,1093,583984,2
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-12 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 : 171/171 places, 394/394 transitions.
Graph (trivial) has 138 edges and 171 vertex of which 42 / 171 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 193 edges and 140 vertex of which 135 / 140 are part of one of the 15 SCC in 0 ms
Free SCC test removed 120 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 20 transition count 286
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 275 transitions
Reduce isomorphic transitions removed 275 transitions.
Iterating post reduction 1 with 289 rules applied. Total rules applied 294 place count 6 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 295 place count 5 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 296 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 298 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 299 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 301 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 302 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 303 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 303 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 305 place count 2 transition count 3
Applied a total of 305 rules in 13 ms. Remains 2 /171 variables (removed 169) and now considering 3/394 (removed 391) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6423526979968795577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10428207103192836.kers'
[2026-05-27 15:45:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6423526979968795577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10428207103192836.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-27 15:45:51] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10428207103192836.kers
Total runtime 0 ms.
[2026-05-27 15:45:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-27 15:45:51] [INFO ] Invariant cache hit.
[2026-05-27 15:45:51] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-27 15:45:51] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-27 15:45:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 57ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/171 places, 3/394 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 121 ms. Remains : 2/171 places, 3/394 transitions.
[2026-05-27 15:45:51] [INFO ] Flatten gal took : 1 ms
[2026-05-27 15:45:51] [INFO ] Flatten gal took : 0 ms
[2026-05-27 15:45:51] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-27 15:45:51] [INFO ] Flatten gal took : 0 ms
[2026-05-27 15:45:51] [INFO ] Flatten gal took : 1 ms
[2026-05-27 15:45:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5399871133796797336.gal : 0 ms
[2026-05-27 15:45:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4255279610466577115.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5399871133796797336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4255279610466577115.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG((p116==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p116==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.002949,4004,1,0,5,19,13,0,43,10,5
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 135 edges and 171 vertex of which 36 / 171 are part of one of the 12 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 134 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 139 place count 134 transition count 190
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 140 place count 134 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 133 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 133 transition count 189
Applied a total of 142 rules in 34 ms. Remains 133 /171 variables (removed 38) and now considering 189/394 (removed 205) transitions.
[2026-05-27 15:45:52] [INFO ] Flow matrix only has 178 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15247883989492264185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9564263178262765251.kers'
[2026-05-27 15:45:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15247883989492264185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9564263178262765251.kers]
Normalized transition count is 177 out of 178 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 177 rows 131 cols 371 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-27 15:45:52] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9564263178262765251.kers
Total runtime 1 ms.
[2026-05-27 15:45:52] [INFO ] Implicit Places using invariants in 140 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 132/171 places, 189/394 transitions.
Graph (trivial) has 168 edges and 132 vertex of which 64 / 132 are part of one of the 14 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 82 transition count 99
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 66 transition count 99
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 33 place count 66 transition count 85
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 61 place count 52 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 73 place count 52 transition count 73
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 97 place count 40 transition count 61
Applied a total of 97 rules in 8 ms. Remains 40 /132 variables (removed 92) and now considering 61/189 (removed 128) transitions.
[2026-05-27 15:45:52] [INFO ] Flow matrix only has 48 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9824633456363102956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13105007838058034880.kers'
[2026-05-27 15:45:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9824633456363102956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13105007838058034880.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 47 rows 39 cols 111 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-27 15:45:52] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13105007838058034880.kers
Total runtime 0 ms.
[2026-05-27 15:45:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-27 15:45:52] [INFO ] Flow matrix only has 48 transitions (discarded 13 similar events)
[2026-05-27 15:45:52] [INFO ] Invariant cache hit.
[2026-05-27 15:45:52] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-27 15:45:52] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 40/171 places, 61/394 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 304 ms. Remains : 40/171 places, 61/394 transitions.
[2026-05-27 15:45:52] [INFO ] Flatten gal took : 9 ms
[2026-05-27 15:45:52] [INFO ] Flatten gal took : 2 ms
[2026-05-27 15:45:52] [INFO ] Input system was already deterministic with 61 transitions.
[2026-05-27 15:45:52] [INFO ] Flatten gal took : 2 ms
[2026-05-27 15:45:52] [INFO ] Flatten gal took : 1 ms
[2026-05-27 15:45:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3681262448380275041.gal : 0 ms
[2026-05-27 15:45:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10967535966331669509.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3681262448380275041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10967535966331669509.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,200705,0.019747,4144,2,147,5,857,6,0,207,592,0


Converting to forward existential form...Done !
original formula: AG(EF((((p24==0)||(p59==0))||(p169==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p24==0)||(p59==0))||(p169==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.042659,4612,1,0,6,3561,14,0,957,733,5
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-14 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 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3236040694942107744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15995332064420021717.kers'
[2026-05-27 15:45:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3236040694942107744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15995332064420021717.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 394 rows 169 cols 1139 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 15:45:52] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15995332064420021717.kers
Total runtime 4 ms.
[2026-05-27 15:45:52] [INFO ] Implicit Places using invariants in 266 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 267 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 170/171 places, 394/394 transitions.
[2026-05-27 15:45:52] [INFO ] Flatten gal took : 10 ms
[2026-05-27 15:45:52] [INFO ] Flatten gal took : 13 ms
[2026-05-27 15:45:52] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-27 15:45:52] [INFO ] Flatten gal took : 13 ms
[2026-05-27 15:45:52] [INFO ] Flatten gal took : 12 ms
[2026-05-27 15:45:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11048076401954266587.gal : 3 ms
[2026-05-27 15:45:52] [INFO ] Time to serialize properties into /tmp/CTLFireability3538341477619317388.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11048076401954266587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3538341477619317388.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28392e+15,3.58447,75892,2,12173,5,421813,6,0,1074,240937,0


Converting to forward existential form...Done !
original formula: EX((((p132==1)&&(p143==1))&&(p169==1)))
=> equivalent forward existential formula: [(EY(Init) * (((p132==1)&&(p143==1))&&(p169==1)))] != FALSE
(forward)formula 0,0,3.61227,75892,1,0,8,421813,8,1,1506,240937,2
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-27 15:45:56] [INFO ] Flatten gal took : 6 ms
[2026-05-27 15:45:56] [INFO ] Flatten gal took : 6 ms
Total runtime 343400 ms.

BK_STOP 1779896756437

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-14a"
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-5973"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-14a, 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 r130-smll-177955809100386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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