Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730100834.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BART-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730100834
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 493K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 126K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 438K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 264K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 710K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 174K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 452K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 794K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.9M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 709K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.4M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 55K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748671844757

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 06:10:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 06:10:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:10:46] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2025-05-31 06:10:46] [INFO ] Transformed 870 places.
[2025-05-31 06:10:46] [INFO ] Transformed 1010 transitions.
[2025-05-31 06:10:46] [INFO ] Found NUPN structural information;
[2025-05-31 06:10:46] [INFO ] Parsed PT model containing 870 places and 1010 transitions and 8100 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 660 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 24 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2025-05-31 06:10:46] [INFO ] Computed 5 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:10:46] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-05-31 06:10:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:10:47] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2025-05-31 06:10:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30036 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30017 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Finished structural reductions in LTL mode , in 1 iterations and 61155 ms. Remains : 660/660 places, 1010/1010 transitions.
Support contains 660 out of 660 places after structural reductions.
[2025-05-31 06:11:47] [INFO ] Flatten gal took : 89 ms
[2025-05-31 06:11:47] [INFO ] Flatten gal took : 51 ms
[2025-05-31 06:11:48] [INFO ] Input system was already deterministic with 1010 transitions.
Reduction of identical properties reduced properties to check from 47 to 43
RANDOM walk for 40000 steps (8 resets) in 814 ms. (49 steps per ms) remains 1/43 properties
BEST_FIRST walk for 30071 steps (6 resets) in 76 ms. (390 steps per ms) remains 0/1 properties
[2025-05-31 06:11:48] [INFO ] Flatten gal took : 36 ms
[2025-05-31 06:11:48] [INFO ] Flatten gal took : 40 ms
[2025-05-31 06:11:48] [INFO ] Input system was already deterministic with 1010 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 17 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2025-05-31 06:11:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:11:49] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-31 06:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:11:49] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:11:49] [INFO ] Redundant transitions in 59 ms returned []
Running 830 sub problems to find dead transitions.
[2025-05-31 06:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30023 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30026 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60764 ms. Remains : 660/660 places, 1010/1010 transitions.
[2025-05-31 06:12:49] [INFO ] Flatten gal took : 32 ms
[2025-05-31 06:12:49] [INFO ] Flatten gal took : 27 ms
[2025-05-31 06:12:49] [INFO ] Input system was already deterministic with 1010 transitions.
[2025-05-31 06:12:49] [INFO ] Flatten gal took : 26 ms
[2025-05-31 06:12:49] [INFO ] Flatten gal took : 25 ms
[2025-05-31 06:12:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5003738909448797375.gal : 15 ms
[2025-05-31 06:12:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7887277202998512617.ctl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5003738909448797375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7887277202998512617.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,6.31055,191336,2,20712,5,1.21389e+06,6,0,3653,884823,0


Converting to forward existential form...Done !
original formula: EG(((AF((((((((((TrainState_1_0_0==1)||(TrainState_3_0_0==1))||((TrainState_2_0_0==1)||(TrainState_1_0_0==1)))||(((TrainState_2_0_0==1)||...38307
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((((((((((TrainState_1_0_0==1)||(TrainState_3_0_0==1))||((TrainState_2_0_0==1)||(TrainState_1...61223
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 06:13:20] [INFO ] Flatten gal took : 25 ms
[2025-05-31 06:13:20] [INFO ] Applying decomposition
[2025-05-31 06:13:20] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4466422970927503667.txt' '-o' '/tmp/graph4466422970927503667.bin' '-w' '/tmp/graph4466422970927503667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4466422970927503667.bin' '-l' '-1' '-v' '-w' '/tmp/graph4466422970927503667.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:13:20] [INFO ] Decomposing Gal with order
[2025-05-31 06:13:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:13:20] [INFO ] Removed a total of 170 redundant transitions.
[2025-05-31 06:13:20] [INFO ] Flatten gal took : 105 ms
[2025-05-31 06:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2025-05-31 06:13:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4427216242075702797.gal : 14 ms
[2025-05-31 06:13:20] [INFO ] Time to serialize properties into /tmp/CTLFireability10123870691038696162.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4427216242075702797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10123870691038696162.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.198812,10212,395,75,7330,3074,1283,8242,251,2371,0


Converting to forward existential form...Done !
original formula: EG(((AF((((((((((i0.u12.TrainState_1_0_0==1)||(i5.i0.i0.u13.TrainState_3_0_0==1))||((i4.i0.i0.u15.TrainState_2_0_0==1)||(i0.u12.TrainStat...54282
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((((((((((i0.u12.TrainState_1_0_0==1)||(i5.i0.i0.u13.TrainState_3_0_0==1))||((i4.i0.i0.u15.Tr...86750
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,8.84807,299876,1,0,481198,141868,11707,2.09614e+06,1389,481928,282941
FORMULA BART-PT-005-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 115 place count 545 transition count 895
Iterating global reduction 0 with 115 rules applied. Total rules applied 230 place count 545 transition count 895
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 325 place count 450 transition count 800
Iterating global reduction 0 with 95 rules applied. Total rules applied 420 place count 450 transition count 800
Applied a total of 420 rules in 65 ms. Remains 450 /660 variables (removed 210) and now considering 800/1010 (removed 210) transitions.
// Phase 1: matrix 800 rows 450 cols
[2025-05-31 06:13:29] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:13:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-31 06:13:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:13:29] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2025-05-31 06:13:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 800/1250 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1250/1250 variables, and 455 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 800/1250 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 620/1075 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 20)
(t1 21)
(t2 20)
(t3 30)
(t4 20)
(t5 1)
(t6 1)
(t7 1)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 1)
(t13 1)
(t14 1)
(t15 1)
(t16 1)
(t17 1)
(t18 1)
(t19 1)
(t20 0)
(t21 0)
(t22 0)
(t23 1)
(t24 0)
(t25 1)
(t26 1)
(t27 1)
(t28 1)
(t29 1)
(t30 1)
(t31 1)
(t32 1)
(t33 1)
(t34 1)
(t35 1)
(t36 1)
(t37 1)
(t38 1)
(t39 1)
(t40 1)
(t41 1)
(t42 1)
(t43 1)
(t44 1)
(t45 1)
(t46 1)
(t47 1)
(t48 1)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 1)
(t54 0)
(t55 1)
(t56 1)
(t57 1)
(t58 1)
(t59 1)
(t60 1)
(t61 1)
(t62 1)
(t63 1)
(t64 1)
(t65 0)
(t66 1)
(t67 1)
(t68 1)
(t69 1)
(t70 1)
(t71 1)
(t72 1)
(t73 1)
(t74 1)
(t75 1)
(t76 1)
(t77 1)
(t78 1)
(t79 1)
(t80 1)
(t81 1)
(t82 1)
(t83 1)
(t84 1)
(t85 1)
(t86 1)
(t87 0)
(t88 1)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 1)
(t94 0)
(t95 0)
(t96 1)
(t97 0)
(t98 1)
(t99 1)
(t100 0)
(t101 1)
(t102 1)
(t103 1)
(t104 0)
(t105 1)
(t106 0)
(t107 0)
(t108 1)
(t109 0)
(t110 0)
(t111 1)
(t112 1)
(t113 1)
(t114 1)
(t115 1)
(t116 0)
(t117 0)
(t118 1)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 1)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 1)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 1)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 1)
(t143 0)
(t144 0)
(t145 1)
(t146 0)
(t147 1)
(t148 0)
(t149 1)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 1)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 1)
(t160 1)
(t161 1)
(t162 0)
(t163 1)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 1)
(t169 0)
(t170 1)
(t171 0)
(t172 1)
(t173 1)
(t174 1)
(t175 1)
(t176 1)
(t177 0)
(t178 1)
(t179 1)
(t180 0)
(t181 1)
(t182 1)
(t183 1)
(t184 0)
(t185 1)
(t186 1)
(t187 1)
(t188 1)
(t189 1)
(t190 1)
(t191 1)
(t192 1)
(t193 9)
(t194 1)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 1)
(t201 1)
(t202 1)
(t203 1)
(t204 1)
(t205 1)
(t206 1)
(t207 1)
(t208 1)
(t209 1)
(t210 1)
(t211 1)
(t212 1)
(t213 1)
(t214 1)
(t215 1)
(t216 1)
(t217 1)
(t218 1)
(t219 1)
(t220 1)
(t221 1)
(t222 1)
(t223 1)
(t224 1)
(t225 1)
(t226 1)
(t227 0)
(t228 0)
(t229 0)
(t230 1)
(t231 1)
(t232 1)
(t233 1)
(t234 1)
(t235 1)
(t236 1)
(t237 1)
(t238 1)
(t239 1)
(t240 0)
(t241 1)
(t242 1)
(t243 1)
(t244 1)
(t245 1)
(t246 1)
(t247 1)
(t248 1)
(t249 1)
(t250 1)
(t251 1)
(t252 1)
(t253 1)
(t254 1)
(t255 1)
(t256 1)
(t257 1)
(t258 1)
(t259 1)
(t260 1)
(t261 1)
(t262 1)
(t263 1)
(t264 1)
(t265 0)
(t266 1)
(t267 0)
(t268 0)
(t269 0)
(t270 1)
(t271 0)
(t272 1)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 1)
(t279 0)
(t280 0)
(t281 1)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 1)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 1)
(t317 0)
(t318 0)
(t319 0)
(t320 1)
(t321 0)
(t322 1)
(t323 0)
(t324 1)
(t325 0)
(t326 0)
(t327 1)
(t328 0)
(t329 1)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 1)
(t335 1)
(t336 0)
(t337 0)
(t338 1)
(t339 1)
(t340 0)
(t341 0)
(t342 0)
(t343 1)
(t344 0)
(t345 1)
(t346 0)
(t347timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/1250 variables, and 1075 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 450/660 places, 800/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60482 ms. Remains : 450/660 places, 800/1010 transitions.
[2025-05-31 06:14:30] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:14:30] [INFO ] Flatten gal took : 30 ms
[2025-05-31 06:14:30] [INFO ] Input system was already deterministic with 800 transitions.
[2025-05-31 06:14:30] [INFO ] Flatten gal took : 21 ms
[2025-05-31 06:14:30] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:14:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17366988112706669986.gal : 6 ms
[2025-05-31 06:14:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11542217830057099353.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17366988112706669986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11542217830057099353.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.9049e+09,0.287002,9400,2,896,5,11613,6,0,2603,17164,0


Converting to forward existential form...Done !
original formula: AF((AX(EG((((((((TrainState_1_4_13==1)||(TrainState_4_2_4==1))||((TrainState_3_3_9==1)||(TrainState_4_4_14==1)))||(((TrainState_1_3_7==1)...4851
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG((((((((TrainState_1_4_13==1)||(TrainState_4_2_4==1))||((TrainState_3_3_9==1)||(TrainStat...4902
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,3.31978,105576,1,0,65,544149,29,56,10279,595267,63
FORMULA BART-PT-005-CTLFireability-2025-01 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 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 890 edges and 660 vertex of which 205 / 660 are part of one of the 5 SCC in 3 ms
Free SCC test removed 200 places
Ensure Unique test removed 375 transitions
Reduce isomorphic transitions removed 375 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 281 place count 460 transition count 355
Reduce places removed 280 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 340 rules applied. Total rules applied 621 place count 180 transition count 295
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 60 rules applied. Total rules applied 681 place count 160 transition count 255
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 60 rules applied. Total rules applied 741 place count 140 transition count 215
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 781 place count 120 transition count 195
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 806 place count 95 transition count 170
Iterating global reduction 5 with 25 rules applied. Total rules applied 831 place count 95 transition count 170
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 856 place count 95 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 861 place count 95 transition count 140
Applied a total of 861 rules in 36 ms. Remains 95 /660 variables (removed 565) and now considering 140/1010 (removed 870) transitions.
[2025-05-31 06:14:33] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
// Phase 1: matrix 136 rows 95 cols
[2025-05-31 06:14:33] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:14:33] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-31 06:14:33] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
[2025-05-31 06:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:14:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:14:33] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2025-05-31 06:14:33] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
[2025-05-31 06:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 5/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 135/230 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 0/230 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/231 variables, and 100 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 5/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 135/230 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 90/190 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/230 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/231 variables, and 190 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1982 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4349ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 4349ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/660 places, 140/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4535 ms. Remains : 95/660 places, 140/1010 transitions.
[2025-05-31 06:14:38] [INFO ] Flatten gal took : 4 ms
[2025-05-31 06:14:38] [INFO ] Flatten gal took : 3 ms
[2025-05-31 06:14:38] [INFO ] Input system was already deterministic with 140 transitions.
[2025-05-31 06:14:38] [INFO ] Flatten gal took : 2 ms
[2025-05-31 06:14:38] [INFO ] Flatten gal took : 3 ms
[2025-05-31 06:14:38] [INFO ] Time to serialize gal into /tmp/CTLFireability9617638741270567971.gal : 1 ms
[2025-05-31 06:14:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7391862627187750488.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9617638741270567971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7391862627187750488.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((((((((TrainState_1_4_13==0)&&(TrainState_4_2_4==0))&&((TrainState_3_3_9==0)&&(TrainState_4_4_14==0)))&&(((TrainState_1_3_7==0)&&(Trai...1163
=> equivalent forward existential formula: [FwdG(Init,(((((((TrainState_1_4_13==0)&&(TrainState_4_2_4==0))&&((TrainState_3_3_9==0)&&(TrainState_4_4_14==0))...1206
Hit Full ! (commute/partial/dont) 50/3935/90
(forward)formula 0,1,0.069714,5768,1,0,6,10766,19,1,2577,2340,8
FORMULA BART-PT-005-CTLFireability-2025-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 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 320 place count 660 transition count 690
Reduce places removed 320 places and 0 transitions.
Iterating post reduction 1 with 320 rules applied. Total rules applied 640 place count 340 transition count 690
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 640 place count 340 transition count 670
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 710 place count 290 transition count 640
Iterating global reduction 2 with 30 rules applied. Total rules applied 740 place count 290 transition count 640
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 745 place count 290 transition count 635
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 765 place count 270 transition count 615
Iterating global reduction 3 with 20 rules applied. Total rules applied 785 place count 270 transition count 615
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 800 place count 255 transition count 600
Iterating global reduction 3 with 15 rules applied. Total rules applied 815 place count 255 transition count 600
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 830 place count 240 transition count 585
Iterating global reduction 3 with 15 rules applied. Total rules applied 845 place count 240 transition count 585
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 855 place count 230 transition count 575
Iterating global reduction 3 with 10 rules applied. Total rules applied 865 place count 230 transition count 575
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 875 place count 220 transition count 565
Iterating global reduction 3 with 10 rules applied. Total rules applied 885 place count 220 transition count 565
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 890 place count 215 transition count 560
Iterating global reduction 3 with 5 rules applied. Total rules applied 895 place count 215 transition count 560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 955 place count 185 transition count 530
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 965 place count 185 transition count 520
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 975 place count 180 transition count 515
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 985 place count 180 transition count 505
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 995 place count 175 transition count 500
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1005 place count 175 transition count 490
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1015 place count 170 transition count 485
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1025 place count 170 transition count 475
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1035 place count 165 transition count 470
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1045 place count 165 transition count 460
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1055 place count 160 transition count 455
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1065 place count 160 transition count 445
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1075 place count 155 transition count 440
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1085 place count 155 transition count 430
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1095 place count 150 transition count 425
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1105 place count 150 transition count 415
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1115 place count 145 transition count 410
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1125 place count 145 transition count 400
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1135 place count 140 transition count 395
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1145 place count 140 transition count 385
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 1155 place count 135 transition count 380
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1165 place count 135 transition count 370
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1175 place count 130 transition count 365
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1185 place count 130 transition count 355
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 1195 place count 125 transition count 350
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 1205 place count 125 transition count 340
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 1215 place count 120 transition count 335
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 1225 place count 120 transition count 325
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 1235 place count 115 transition count 320
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 1245 place count 115 transition count 310
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 18 with 10 rules applied. Total rules applied 1255 place count 110 transition count 305
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 1265 place count 110 transition count 295
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 19 with 10 rules applied. Total rules applied 1275 place count 105 transition count 290
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 1285 place count 105 transition count 280
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 20 with 10 rules applied. Total rules applied 1295 place count 100 transition count 275
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 10 rules applied. Total rules applied 1305 place count 100 transition count 265
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 21 with 10 rules applied. Total rules applied 1315 place count 95 transition count 260
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 21 with 10 rules applied. Total rules applied 1325 place count 95 transition count 250
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 22 with 10 rules applied. Total rules applied 1335 place count 90 transition count 245
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 22 with 10 rules applied. Total rules applied 1345 place count 90 transition count 235
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 23 with 10 rules applied. Total rules applied 1355 place count 85 transition count 230
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 23 with 10 rules applied. Total rules applied 1365 place count 85 transition count 220
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 24 with 10 rules applied. Total rules applied 1375 place count 80 transition count 215
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 24 with 10 rules applied. Total rules applied 1385 place count 80 transition count 205
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 25 with 10 rules applied. Total rules applied 1395 place count 75 transition count 200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 25 with 10 rules applied. Total rules applied 1405 place count 75 transition count 190
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 26 with 10 rules applied. Total rules applied 1415 place count 70 transition count 185
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 26 with 10 rules applied. Total rules applied 1425 place count 70 transition count 175
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 27 with 10 rules applied. Total rules applied 1435 place count 65 transition count 170
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 1445 place count 65 transition count 160
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 28 with 10 rules applied. Total rules applied 1455 place count 60 transition count 155
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 28 with 10 rules applied. Total rules applied 1465 place count 60 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 29 with 10 rules applied. Total rules applied 1475 place count 55 transition count 140
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 29 with 10 rules applied. Total rules applied 1485 place count 55 transition count 130
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 30 with 10 rules applied. Total rules applied 1495 place count 50 transition count 125
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 30 with 10 rules applied. Total rules applied 1505 place count 50 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 31 with 10 rules applied. Total rules applied 1515 place count 45 transition count 110
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 31 with 10 rules applied. Total rules applied 1525 place count 45 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 32 with 10 rules applied. Total rules applied 1535 place count 40 transition count 95
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 32 with 10 rules applied. Total rules applied 1545 place count 40 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 33 with 10 rules applied. Total rules applied 1555 place count 35 transition count 80
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 33 with 10 rules applied. Total rules applied 1565 place count 35 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 34 with 10 rules applied. Total rules applied 1575 place count 30 transition count 65
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 34 with 10 rules applied. Total rules applied 1585 place count 30 transition count 55
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 35 with 10 rules applied. Total rules applied 1595 place count 25 transition count 50
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 35 with 10 rules applied. Total rules applied 1605 place count 25 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 36 with 10 rules applied. Total rules applied 1615 place count 20 transition count 35
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 36 with 15 rules applied. Total rules applied 1630 place count 20 transition count 20
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 37 with 10 rules applied. Total rules applied 1640 place count 15 transition count 15
Applied a total of 1640 rules in 229 ms. Remains 15 /660 variables (removed 645) and now considering 15/1010 (removed 995) transitions.
// Phase 1: matrix 15 rows 15 cols
[2025-05-31 06:14:38] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:14:38] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-31 06:14:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:14:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:14:38] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2025-05-31 06:14:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 218ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/660 places, 15/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 535 ms. Remains : 15/660 places, 15/1010 transitions.
[2025-05-31 06:14:38] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:14:38] [INFO ] Flatten gal took : 1 ms
[2025-05-31 06:14:38] [INFO ] Input system was already deterministic with 15 transitions.
[2025-05-31 06:14:38] [INFO ] Flatten gal took : 1 ms
[2025-05-31 06:14:38] [INFO ] Flatten gal took : 1 ms
[2025-05-31 06:14:38] [INFO ] Time to serialize gal into /tmp/CTLFireability903500074394433006.gal : 0 ms
[2025-05-31 06:14:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11701015020685478719.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability903500074394433006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11701015020685478719.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AF(((((TrainState_1_1_1!=1)&&(TrainState_2_1_1!=1))&&((TrainState_3_1_1!=1)&&(TrainState_4_1_1!=1)))&&(TrainState_5_1_1!=1))) * AG(((...3827
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((((TrainState_1_1_1!=1)&&(TrainState_2_1_1!=1))&&((TrainState_3_1_1!=1)&&(TrainStat...3897
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.027586,5068,1,0,6,371,15,0,323,125,5
FORMULA BART-PT-005-CTLFireability-2025-03 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 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 660 transition count 1000
Reduce places removed 10 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 1 with 55 rules applied. Total rules applied 65 place count 650 transition count 955
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 110 place count 605 transition count 955
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 110 place count 605 transition count 935
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 150 place count 585 transition count 935
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 180 place count 555 transition count 905
Iterating global reduction 3 with 30 rules applied. Total rules applied 210 place count 555 transition count 905
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 555 transition count 900
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 230 place count 540 transition count 885
Iterating global reduction 4 with 15 rules applied. Total rules applied 245 place count 540 transition count 885
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 260 place count 525 transition count 870
Iterating global reduction 4 with 15 rules applied. Total rules applied 275 place count 525 transition count 870
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 290 place count 510 transition count 855
Iterating global reduction 4 with 15 rules applied. Total rules applied 305 place count 510 transition count 855
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 315 place count 500 transition count 845
Iterating global reduction 4 with 10 rules applied. Total rules applied 325 place count 500 transition count 845
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 335 place count 490 transition count 835
Iterating global reduction 4 with 10 rules applied. Total rules applied 345 place count 490 transition count 835
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 350 place count 485 transition count 830
Iterating global reduction 4 with 5 rules applied. Total rules applied 355 place count 485 transition count 830
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 415 place count 455 transition count 800
Applied a total of 415 rules in 77 ms. Remains 455 /660 variables (removed 205) and now considering 800/1010 (removed 210) transitions.
// Phase 1: matrix 800 rows 455 cols
[2025-05-31 06:14:38] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:14:38] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-05-31 06:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:14:39] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:14:39] [INFO ] Redundant transitions in 6 ms returned []
Running 620 sub problems to find dead transitions.
[2025-05-31 06:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 5/455 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 800/1255 variables, 455/460 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1255/1255 variables, and 460 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 5/455 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 800/1255 variables, 455/460 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1255 variables, 620/1080 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1255/1255 variables, and 1080 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in SI_CTL mode, iteration 1 : 455/660 places, 800/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60527 ms. Remains : 455/660 places, 800/1010 transitions.
[2025-05-31 06:15:39] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:15:39] [INFO ] Flatten gal took : 13 ms
[2025-05-31 06:15:39] [INFO ] Input system was already deterministic with 800 transitions.
RANDOM walk for 67 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
FORMULA BART-PT-005-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-31 06:15:39] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:15:39] [INFO ] Flatten gal took : 11 ms
[2025-05-31 06:15:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3868231391592601858.gal : 3 ms
[2025-05-31 06:15:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10625604951247440913.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3868231391592601858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10625604951247440913.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 2 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2025-05-31 06:15:39] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:15:39] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-31 06:15:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:15:40] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2025-05-31 06:15:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30027 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30017 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Finished structural reductions in LTL mode , in 1 iterations and 60700 ms. Remains : 660/660 places, 1010/1010 transitions.
[2025-05-31 06:16:40] [INFO ] Flatten gal took : 17 ms
[2025-05-31 06:16:40] [INFO ] Flatten gal took : 19 ms
[2025-05-31 06:16:40] [INFO ] Input system was already deterministic with 1010 transitions.
[2025-05-31 06:16:40] [INFO ] Flatten gal took : 18 ms
[2025-05-31 06:16:40] [INFO ] Flatten gal took : 18 ms
[2025-05-31 06:16:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9218998520119645316.gal : 3 ms
[2025-05-31 06:16:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13300076026964713833.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9218998520119645316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13300076026964713833.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,6.40872,190384,2,20712,5,1.21389e+06,6,0,3653,884823,0


Converting to forward existential form...Done !
original formula: EF((A((((((((((TrainState_1_0_0==1)||(TrainState_3_0_0==1))||((TrainState_2_0_0==1)||(TrainState_1_0_0==1)))||(((TrainState_2_0_0==1)||(T...25313
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainSta...27934
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 06:17:10] [INFO ] Flatten gal took : 19 ms
[2025-05-31 06:17:10] [INFO ] Applying decomposition
[2025-05-31 06:17:10] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17351136620195048149.txt' '-o' '/tmp/graph17351136620195048149.bin' '-w' '/tmp/graph17351136620195048149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17351136620195048149.bin' '-l' '-1' '-v' '-w' '/tmp/graph17351136620195048149.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:17:10] [INFO ] Decomposing Gal with order
[2025-05-31 06:17:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:17:10] [INFO ] Removed a total of 64 redundant transitions.
[2025-05-31 06:17:10] [INFO ] Flatten gal took : 68 ms
[2025-05-31 06:17:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2025-05-31 06:17:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11148284671271318608.gal : 12 ms
[2025-05-31 06:17:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14548058392383316769.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11148284671271318608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14548058392383316769.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.22191,10556,286,75,7056,2941,1032,9486,239,2261,0


Converting to forward existential form...Done !
original formula: EF((A((((((((((i0.i0.i0.u11.TrainState_1_0_0==1)||(i8.i0.i0.u12.TrainState_3_0_0==1))||((i1.i0.i0.u14.TrainState_2_0_0==1)||(i0.i0.i0.u11...36707
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(((((i0.i0.i0.u0.TrainState_1_1_1==1)||(i1.i0.i0.u1.TrainState_2_1_1==1))||((i8.i0.i...40517
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,7.00047,286012,1,0,491818,163036,2870,1.84761e+06,910,669681,144698
FORMULA BART-PT-005-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 320 place count 660 transition count 690
Reduce places removed 320 places and 0 transitions.
Iterating post reduction 1 with 320 rules applied. Total rules applied 640 place count 340 transition count 690
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 640 place count 340 transition count 665
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 720 place count 285 transition count 635
Iterating global reduction 2 with 30 rules applied. Total rules applied 750 place count 285 transition count 635
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 755 place count 285 transition count 630
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 775 place count 265 transition count 610
Iterating global reduction 3 with 20 rules applied. Total rules applied 795 place count 265 transition count 610
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 810 place count 250 transition count 595
Iterating global reduction 3 with 15 rules applied. Total rules applied 825 place count 250 transition count 595
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 840 place count 235 transition count 580
Iterating global reduction 3 with 15 rules applied. Total rules applied 855 place count 235 transition count 580
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 865 place count 225 transition count 570
Iterating global reduction 3 with 10 rules applied. Total rules applied 875 place count 225 transition count 570
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 885 place count 215 transition count 560
Iterating global reduction 3 with 10 rules applied. Total rules applied 895 place count 215 transition count 560
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 900 place count 210 transition count 555
Iterating global reduction 3 with 5 rules applied. Total rules applied 905 place count 210 transition count 555
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 965 place count 180 transition count 525
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 975 place count 180 transition count 515
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 985 place count 175 transition count 510
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 995 place count 175 transition count 500
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1005 place count 170 transition count 495
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1015 place count 170 transition count 485
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1025 place count 165 transition count 480
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1035 place count 165 transition count 470
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1045 place count 160 transition count 465
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1055 place count 160 transition count 455
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1065 place count 155 transition count 450
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1075 place count 155 transition count 440
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1085 place count 150 transition count 435
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1095 place count 150 transition count 425
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1105 place count 145 transition count 420
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1115 place count 145 transition count 410
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1125 place count 140 transition count 405
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1135 place count 140 transition count 395
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1145 place count 135 transition count 390
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1155 place count 135 transition count 380
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 1165 place count 130 transition count 375
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1175 place count 130 transition count 365
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1185 place count 125 transition count 360
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1195 place count 125 transition count 350
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 1205 place count 120 transition count 345
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 1215 place count 120 transition count 335
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 1225 place count 115 transition count 330
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 1235 place count 115 transition count 320
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 1245 place count 110 transition count 315
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 1255 place count 110 transition count 305
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 18 with 10 rules applied. Total rules applied 1265 place count 105 transition count 300
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 1275 place count 105 transition count 290
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 19 with 10 rules applied. Total rules applied 1285 place count 100 transition count 285
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 1295 place count 100 transition count 275
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 20 with 10 rules applied. Total rules applied 1305 place count 95 transition count 270
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 10 rules applied. Total rules applied 1315 place count 95 transition count 260
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 21 with 10 rules applied. Total rules applied 1325 place count 90 transition count 255
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 21 with 10 rules applied. Total rules applied 1335 place count 90 transition count 245
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 22 with 10 rules applied. Total rules applied 1345 place count 85 transition count 240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 22 with 10 rules applied. Total rules applied 1355 place count 85 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 23 with 10 rules applied. Total rules applied 1365 place count 80 transition count 225
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 23 with 10 rules applied. Total rules applied 1375 place count 80 transition count 215
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 24 with 10 rules applied. Total rules applied 1385 place count 75 transition count 210
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 24 with 10 rules applied. Total rules applied 1395 place count 75 transition count 200
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 25 with 10 rules applied. Total rules applied 1405 place count 70 transition count 195
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 25 with 10 rules applied. Total rules applied 1415 place count 70 transition count 185
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 26 with 10 rules applied. Total rules applied 1425 place count 65 transition count 180
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 26 with 10 rules applied. Total rules applied 1435 place count 65 transition count 170
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 27 with 10 rules applied. Total rules applied 1445 place count 60 transition count 165
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 1455 place count 60 transition count 155
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 28 with 10 rules applied. Total rules applied 1465 place count 55 transition count 150
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 28 with 10 rules applied. Total rules applied 1475 place count 55 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 29 with 10 rules applied. Total rules applied 1485 place count 50 transition count 135
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 29 with 10 rules applied. Total rules applied 1495 place count 50 transition count 125
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 30 with 10 rules applied. Total rules applied 1505 place count 45 transition count 120
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 30 with 10 rules applied. Total rules applied 1515 place count 45 transition count 110
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 31 with 10 rules applied. Total rules applied 1525 place count 40 transition count 105
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 31 with 10 rules applied. Total rules applied 1535 place count 40 transition count 95
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 32 with 10 rules applied. Total rules applied 1545 place count 35 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 32 with 10 rules applied. Total rules applied 1555 place count 35 transition count 80
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 33 with 10 rules applied. Total rules applied 1565 place count 30 transition count 75
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 33 with 10 rules applied. Total rules applied 1575 place count 30 transition count 65
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 34 with 10 rules applied. Total rules applied 1585 place count 25 transition count 60
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 34 with 10 rules applied. Total rules applied 1595 place count 25 transition count 50
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 35 with 10 rules applied. Total rules applied 1605 place count 20 transition count 45
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 35 with 10 rules applied. Total rules applied 1615 place count 20 transition count 35
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 36 with 10 rules applied. Total rules applied 1625 place count 15 transition count 30
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 36 with 15 rules applied. Total rules applied 1640 place count 15 transition count 15
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 37 with 10 rules applied. Total rules applied 1650 place count 10 transition count 10
Applied a total of 1650 rules in 123 ms. Remains 10 /660 variables (removed 650) and now considering 10/1010 (removed 1000) transitions.
// Phase 1: matrix 10 rows 10 cols
[2025-05-31 06:17:17] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:17:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-31 06:17:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:17:17] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:17:17] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-05-31 06:17:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/20 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/20 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/660 places, 10/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 276 ms. Remains : 10/660 places, 10/1010 transitions.
[2025-05-31 06:17:18] [INFO ] Flatten gal took : 1 ms
[2025-05-31 06:17:18] [INFO ] Flatten gal took : 1 ms
[2025-05-31 06:17:18] [INFO ] Input system was already deterministic with 10 transitions.
[2025-05-31 06:17:18] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:17:18] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:17:18] [INFO ] Time to serialize gal into /tmp/CTLFireability13846714850268087919.gal : 1 ms
[2025-05-31 06:17:18] [INFO ] Time to serialize properties into /tmp/CTLFireability18280199005547134268.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13846714850268087919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18280199005547134268.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(AF(((((TrainState_1_0_0==0)&&(TrainState_3_0_0==0))&&((TrainState_2_0_0==0)&&(TrainState_5_0_0==0)))&&(TrainState_4_0_0==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((((TrainState_1_0_0==0)&&(TrainState_3_0_0==0))&&((TrainState_2_0_0==0)&&(TrainState_5_0_0==0...196
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.004249,3916,1,0,7,199,23,2,213,93,6
FORMULA BART-PT-005-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 615 transition count 965
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 615 transition count 965
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 120 place count 585 transition count 935
Iterating global reduction 0 with 30 rules applied. Total rules applied 150 place count 585 transition count 935
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 165 place count 570 transition count 920
Iterating global reduction 0 with 15 rules applied. Total rules applied 180 place count 570 transition count 920
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 555 transition count 905
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 555 transition count 905
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 225 place count 540 transition count 890
Iterating global reduction 0 with 15 rules applied. Total rules applied 240 place count 540 transition count 890
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 255 place count 525 transition count 875
Iterating global reduction 0 with 15 rules applied. Total rules applied 270 place count 525 transition count 875
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 280 place count 515 transition count 865
Iterating global reduction 0 with 10 rules applied. Total rules applied 290 place count 515 transition count 865
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 300 place count 505 transition count 855
Iterating global reduction 0 with 10 rules applied. Total rules applied 310 place count 505 transition count 855
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 315 place count 500 transition count 850
Iterating global reduction 0 with 5 rules applied. Total rules applied 320 place count 500 transition count 850
Applied a total of 320 rules in 29 ms. Remains 500 /660 variables (removed 160) and now considering 850/1010 (removed 160) transitions.
// Phase 1: matrix 850 rows 500 cols
[2025-05-31 06:17:18] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:17:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-31 06:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:17:18] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2025-05-31 06:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (OVERLAPS) 850/1350 variables, 500/505 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1350/1350 variables, and 505 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (OVERLAPS) 850/1350 variables, 500/505 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1350 variables, 670/1175 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1350/1350 variables, and 1175 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 500/660 places, 850/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60483 ms. Remains : 500/660 places, 850/1010 transitions.
[2025-05-31 06:18:18] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:18:18] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:18:18] [INFO ] Input system was already deterministic with 850 transitions.
[2025-05-31 06:18:18] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:18:18] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:18:18] [INFO ] Time to serialize gal into /tmp/CTLFireability13971597005565949412.gal : 2 ms
[2025-05-31 06:18:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12383669468472286150.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13971597005565949412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12383669468472286150.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1e+10,2.56374,90508,2,15540,5,585002,6,0,2853,322496,0


Converting to forward existential form...Done !
original formula: AX(EX(AX(((((((((((TrainState_4_1_38==1)||(TrainState_1_1_15==1))||((TrainState_1_1_31==1)||(TrainState_5_2_10==1)))||(((TrainState_2_1_2...11446
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EX(!(((((((((((TrainState_4_1_38==1)||(TrainState_1_1_15==1))||((TrainState_1_1_31==1)||(Tra...11499
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,25.3352,713132,1,0,11,5.30952e+06,11,3,12550,899246,6
FORMULA BART-PT-005-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 156 places :
Symmetric choice reduction at 0 with 156 rule applications. Total rules 156 place count 504 transition count 854
Iterating global reduction 0 with 156 rules applied. Total rules applied 312 place count 504 transition count 854
Discarding 131 places :
Symmetric choice reduction at 0 with 131 rule applications. Total rules 443 place count 373 transition count 723
Iterating global reduction 0 with 131 rules applied. Total rules applied 574 place count 373 transition count 723
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 594 place count 353 transition count 703
Iterating global reduction 0 with 20 rules applied. Total rules applied 614 place count 353 transition count 703
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 629 place count 338 transition count 688
Iterating global reduction 0 with 15 rules applied. Total rules applied 644 place count 338 transition count 688
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 658 place count 324 transition count 674
Iterating global reduction 0 with 14 rules applied. Total rules applied 672 place count 324 transition count 674
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 686 place count 310 transition count 660
Iterating global reduction 0 with 14 rules applied. Total rules applied 700 place count 310 transition count 660
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 714 place count 296 transition count 646
Iterating global reduction 0 with 14 rules applied. Total rules applied 728 place count 296 transition count 646
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 742 place count 282 transition count 632
Iterating global reduction 0 with 14 rules applied. Total rules applied 756 place count 282 transition count 632
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 765 place count 273 transition count 623
Iterating global reduction 0 with 9 rules applied. Total rules applied 774 place count 273 transition count 623
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 783 place count 264 transition count 614
Iterating global reduction 0 with 9 rules applied. Total rules applied 792 place count 264 transition count 614
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 797 place count 259 transition count 609
Iterating global reduction 0 with 5 rules applied. Total rules applied 802 place count 259 transition count 609
Applied a total of 802 rules in 52 ms. Remains 259 /660 variables (removed 401) and now considering 609/1010 (removed 401) transitions.
// Phase 1: matrix 609 rows 259 cols
[2025-05-31 06:18:44] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:18:44] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-31 06:18:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:18:44] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2025-05-31 06:18:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 5/259 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (OVERLAPS) 609/868 variables, 259/264 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/868 variables, and 264 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 5/259 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (OVERLAPS) 609/868 variables, 259/264 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 429/693 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/868 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (OVERLAPS) 0/868 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Int declared 868/868 variables, and 693 constraints, problems are : Problem set: 0 solved, 429 unsolved in 29351 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59394ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 59396ms
Starting structural reductions in LTL mode, iteration 1 : 259/660 places, 609/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59843 ms. Remains : 259/660 places, 609/1010 transitions.
[2025-05-31 06:19:44] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:19:44] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:19:44] [INFO ] Input system was already deterministic with 609 transitions.
[2025-05-31 06:19:44] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:19:44] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:19:44] [INFO ] Time to serialize gal into /tmp/CTLFireability10545359353959776815.gal : 2 ms
[2025-05-31 06:19:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13342197924494013283.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10545359353959776815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13342197924494013283.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.70352e+08,0.125546,6704,2,514,5,4187,6,0,1648,2428,0


Converting to forward existential form...Done !
original formula: (EG((TrainState_3_2_14==0)) + AG(((((((TrainState_5_0_0==0)&&(TrainState_2_3_24==0)) + EX((TrainState_2_1_20==1))) * E(((TrainState_1_0_0...394
=> equivalent forward existential formula: (([(((FwdU((Init * !(EG((TrainState_3_2_14==0)))),TRUE) * !(!((E(!((!(!(EX(!((TrainState_2_1_24==1))))) + !(E(TR...1425
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 570/0/39
(forward)formula 0,1,0.552024,19120,1,0,19,87111,46,4,7373,15786,18
FORMULA BART-PT-005-CTLFireability-2025-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 : 660/660 places, 1010/1010 transitions.
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 158 place count 502 transition count 852
Iterating global reduction 0 with 158 rules applied. Total rules applied 316 place count 502 transition count 852
Discarding 132 places :
Symmetric choice reduction at 0 with 132 rule applications. Total rules 448 place count 370 transition count 720
Iterating global reduction 0 with 132 rules applied. Total rules applied 580 place count 370 transition count 720
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 600 place count 350 transition count 700
Iterating global reduction 0 with 20 rules applied. Total rules applied 620 place count 350 transition count 700
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 635 place count 335 transition count 685
Iterating global reduction 0 with 15 rules applied. Total rules applied 650 place count 335 transition count 685
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 665 place count 320 transition count 670
Iterating global reduction 0 with 15 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 695 place count 305 transition count 655
Iterating global reduction 0 with 15 rules applied. Total rules applied 710 place count 305 transition count 655
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 725 place count 290 transition count 640
Iterating global reduction 0 with 15 rules applied. Total rules applied 740 place count 290 transition count 640
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 755 place count 275 transition count 625
Iterating global reduction 0 with 15 rules applied. Total rules applied 770 place count 275 transition count 625
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 780 place count 265 transition count 615
Iterating global reduction 0 with 10 rules applied. Total rules applied 790 place count 265 transition count 615
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 800 place count 255 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 810 place count 255 transition count 605
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 815 place count 250 transition count 600
Iterating global reduction 0 with 5 rules applied. Total rules applied 820 place count 250 transition count 600
Applied a total of 820 rules in 41 ms. Remains 250 /660 variables (removed 410) and now considering 600/1010 (removed 410) transitions.
// Phase 1: matrix 600 rows 250 cols
[2025-05-31 06:19:44] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:19:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-31 06:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:19:44] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2025-05-31 06:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 5/250 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 600/850 variables, 250/255 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/850 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 0/850 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 850/850 variables, and 255 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 5/250 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 600/850 variables, 250/255 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/850 variables, 420/675 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/850 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (OVERLAPS) 0/850 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 850/850 variables, and 675 constraints, problems are : Problem set: 0 solved, 420 unsolved in 28440 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58478ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 58483ms
Starting structural reductions in LTL mode, iteration 1 : 250/660 places, 600/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58732 ms. Remains : 250/660 places, 600/1010 transitions.
[2025-05-31 06:20:43] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:20:43] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:20:43] [INFO ] Input system was already deterministic with 600 transitions.
[2025-05-31 06:20:43] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:20:43] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:20:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15253060822503609619.gal : 2 ms
[2025-05-31 06:20:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5276043562614896746.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15253060822503609619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5276043562614896746.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.1225e+08,0.602344,28992,2,7742,5,180983,6,0,1603,72392,0


Converting to forward existential form...Done !
original formula: (AF((EF((TrainState_4_1_30==1)) + (TrainState_1_1_26==0))) * (AX(E((TrainState_3_3_21==1) U (TrainState_4_2_9==1))) + EG(!(A((TrainState_...198
=> equivalent forward existential formula: ([FwdG(Init,!((E(TRUE U (TrainState_4_1_30==1)) + (TrainState_1_1_26==0))))] = FALSE * [(EY((Init * !(EG(!(!((E(...353
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 598/0/2
Using saturation style SCC detection
(forward)formula 0,0,12.3744,381288,1,0,16,2.6289e+06,33,9,7154,1.03362e+06,18
FORMULA BART-PT-005-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 44 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
// Phase 1: matrix 595 rows 245 cols
[2025-05-31 06:20:56] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:20:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-31 06:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:20:56] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-31 06:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 29206 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 27852 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57094ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 57095ms
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57395 ms. Remains : 245/660 places, 595/1010 transitions.
[2025-05-31 06:21:53] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:21:53] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:21:53] [INFO ] Input system was already deterministic with 595 transitions.
[2025-05-31 06:21:53] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:21:53] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:21:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15902113460060204903.gal : 1 ms
[2025-05-31 06:21:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12450769742777807948.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15902113460060204903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12450769742777807948.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,0.557814,26332,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: AX(AF(((TrainState_3_1_11==0) * EF((TrainState_2_1_40==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((TrainState_3_1_11==0) * E(TRUE U (TrainState_2_1_40==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,7.08138,224788,1,0,55,1.36532e+06,21,44,6544,626529,53
FORMULA BART-PT-005-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 44 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
[2025-05-31 06:22:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:22:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-31 06:22:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:22:00] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-31 06:22:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 29361 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 27772 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57172ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 57173ms
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57424 ms. Remains : 245/660 places, 595/1010 transitions.
[2025-05-31 06:22:58] [INFO ] Flatten gal took : 11 ms
[2025-05-31 06:22:58] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:22:58] [INFO ] Input system was already deterministic with 595 transitions.
[2025-05-31 06:22:58] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:22:58] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:22:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17192568711282848303.gal : 2 ms
[2025-05-31 06:22:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11527323261449336330.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17192568711282848303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11527323261449336330.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,0.558478,26320,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: EF(AX(!(A(AG((TrainState_1_0_0==1)) U EF((TrainState_4_0_0==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(!((E(!(E(TRUE U (TrainState_4_0_0==1))) U (!(!(E(TRUE U !((TrainState_1_0_0==1)))))...252
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,4.14074,144640,1,0,6,809543,23,0,6546,129631,7
FORMULA BART-PT-005-CTLFireability-2025-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 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 451 place count 368 transition count 718
Iterating global reduction 0 with 133 rules applied. Total rules applied 584 place count 368 transition count 718
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 603 place count 349 transition count 699
Iterating global reduction 0 with 19 rules applied. Total rules applied 622 place count 349 transition count 699
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 636 place count 335 transition count 685
Iterating global reduction 0 with 14 rules applied. Total rules applied 650 place count 335 transition count 685
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 664 place count 321 transition count 671
Iterating global reduction 0 with 14 rules applied. Total rules applied 678 place count 321 transition count 671
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 692 place count 307 transition count 657
Iterating global reduction 0 with 14 rules applied. Total rules applied 706 place count 307 transition count 657
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 720 place count 293 transition count 643
Iterating global reduction 0 with 14 rules applied. Total rules applied 734 place count 293 transition count 643
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 748 place count 279 transition count 629
Iterating global reduction 0 with 14 rules applied. Total rules applied 762 place count 279 transition count 629
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 771 place count 270 transition count 620
Iterating global reduction 0 with 9 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 789 place count 261 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 798 place count 261 transition count 611
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 802 place count 257 transition count 607
Iterating global reduction 0 with 4 rules applied. Total rules applied 806 place count 257 transition count 607
Applied a total of 806 rules in 38 ms. Remains 257 /660 variables (removed 403) and now considering 607/1010 (removed 403) transitions.
// Phase 1: matrix 607 rows 257 cols
[2025-05-31 06:23:02] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:23:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-31 06:23:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:23:02] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-05-31 06:23:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 5/257 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 607/864 variables, 257/262 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/864 variables, and 262 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 5/257 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 607/864 variables, 257/262 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 427/689 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/864 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (OVERLAPS) 0/864 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Int declared 864/864 variables, and 689 constraints, problems are : Problem set: 0 solved, 427 unsolved in 29900 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59946ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 59947ms
Starting structural reductions in LTL mode, iteration 1 : 257/660 places, 607/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60187 ms. Remains : 257/660 places, 607/1010 transitions.
[2025-05-31 06:24:02] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:24:02] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:24:02] [INFO ] Input system was already deterministic with 607 transitions.
[2025-05-31 06:24:02] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:24:02] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:24:02] [INFO ] Time to serialize gal into /tmp/CTLFireability15939529982815655698.gal : 1 ms
[2025-05-31 06:24:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6780166490258909289.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15939529982815655698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6780166490258909289.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.52947e+08,0.606233,28068,2,7856,5,173931,6,0,1638,71756,0


Converting to forward existential form...Done !
original formula: AX(EX((AF(((TrainState_4_2_25==0)&&(TrainState_5_0_0==0))) + AG((TrainState_1_1_3==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((!(EG(!(((TrainState_4_2_25==0)&&(TrainState_5_0_0==0))))) + !(E(TRUE U !((TrainState_1_1_3==0...172
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,5.8129,180044,1,0,11,1.17041e+06,25,3,6811,220465,11
FORMULA BART-PT-005-CTLFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 158 place count 502 transition count 852
Iterating global reduction 0 with 158 rules applied. Total rules applied 316 place count 502 transition count 852
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 449 place count 369 transition count 719
Iterating global reduction 0 with 133 rules applied. Total rules applied 582 place count 369 transition count 719
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 602 place count 349 transition count 699
Iterating global reduction 0 with 20 rules applied. Total rules applied 622 place count 349 transition count 699
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 637 place count 334 transition count 684
Iterating global reduction 0 with 15 rules applied. Total rules applied 652 place count 334 transition count 684
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 667 place count 319 transition count 669
Iterating global reduction 0 with 15 rules applied. Total rules applied 682 place count 319 transition count 669
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 696 place count 305 transition count 655
Iterating global reduction 0 with 14 rules applied. Total rules applied 710 place count 305 transition count 655
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 724 place count 291 transition count 641
Iterating global reduction 0 with 14 rules applied. Total rules applied 738 place count 291 transition count 641
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 752 place count 277 transition count 627
Iterating global reduction 0 with 14 rules applied. Total rules applied 766 place count 277 transition count 627
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 775 place count 268 transition count 618
Iterating global reduction 0 with 9 rules applied. Total rules applied 784 place count 268 transition count 618
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 793 place count 259 transition count 609
Iterating global reduction 0 with 9 rules applied. Total rules applied 802 place count 259 transition count 609
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 807 place count 254 transition count 604
Iterating global reduction 0 with 5 rules applied. Total rules applied 812 place count 254 transition count 604
Applied a total of 812 rules in 44 ms. Remains 254 /660 variables (removed 406) and now considering 604/1010 (removed 406) transitions.
// Phase 1: matrix 604 rows 254 cols
[2025-05-31 06:24:08] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:24:08] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-31 06:24:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:24:08] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-05-31 06:24:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 5/254 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 604/858 variables, 254/259 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/858 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/858 variables, and 259 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 5/254 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 604/858 variables, 254/259 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/858 variables, 424/683 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (OVERLAPS) 0/858 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Int declared 858/858 variables, and 683 constraints, problems are : Problem set: 0 solved, 424 unsolved in 28844 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58895ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 58896ms
Starting structural reductions in LTL mode, iteration 1 : 254/660 places, 604/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59159 ms. Remains : 254/660 places, 604/1010 transitions.
[2025-05-31 06:25:07] [INFO ] Flatten gal took : 9 ms
[2025-05-31 06:25:07] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:25:07] [INFO ] Input system was already deterministic with 604 transitions.
[2025-05-31 06:25:07] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:25:07] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:25:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16631902678945172048.gal : 1 ms
[2025-05-31 06:25:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1498901641615102940.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16631902678945172048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1498901641615102940.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.353e+08,0.684615,31200,2,7826,5,194467,6,0,1623,80184,0


Converting to forward existential form...Done !
original formula: A((AX(E(EG((TrainState_2_4_17==1)) U AF((TrainState_5_0_0==1)))) + AF(E((EG((TrainState_4_1_15==1)) + E((TrainState_2_2_28==1) U (TrainSt...251
=> equivalent forward existential formula: [((Init * !(EG(!((TrainState_4_1_20==1))))) * !(E(!((TrainState_4_1_20==1)) U (!((!(EX(!(E(EG((TrainState_2_4_17...390
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 602/0/2
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 600/0/4
(forward)formula 0,0,15.462,462044,1,0,66,3.67042e+06,62,45,7566,1.10347e+06,58
FORMULA BART-PT-005-CTLFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 452 place count 367 transition count 717
Iterating global reduction 0 with 134 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 606 place count 347 transition count 697
Iterating global reduction 0 with 20 rules applied. Total rules applied 626 place count 347 transition count 697
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 641 place count 332 transition count 682
Iterating global reduction 0 with 15 rules applied. Total rules applied 656 place count 332 transition count 682
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 671 place count 317 transition count 667
Iterating global reduction 0 with 15 rules applied. Total rules applied 686 place count 317 transition count 667
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 701 place count 302 transition count 652
Iterating global reduction 0 with 15 rules applied. Total rules applied 716 place count 302 transition count 652
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 731 place count 287 transition count 637
Iterating global reduction 0 with 15 rules applied. Total rules applied 746 place count 287 transition count 637
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 761 place count 272 transition count 622
Iterating global reduction 0 with 15 rules applied. Total rules applied 776 place count 272 transition count 622
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 786 place count 262 transition count 612
Iterating global reduction 0 with 10 rules applied. Total rules applied 796 place count 262 transition count 612
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 806 place count 252 transition count 602
Iterating global reduction 0 with 10 rules applied. Total rules applied 816 place count 252 transition count 602
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 821 place count 247 transition count 597
Iterating global reduction 0 with 5 rules applied. Total rules applied 826 place count 247 transition count 597
Applied a total of 826 rules in 43 ms. Remains 247 /660 variables (removed 413) and now considering 597/1010 (removed 413) transitions.
// Phase 1: matrix 597 rows 247 cols
[2025-05-31 06:25:23] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:25:23] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 06:25:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:25:23] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2025-05-31 06:25:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 5/247 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 597/844 variables, 247/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 0/844 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 844/844 variables, and 252 constraints, problems are : Problem set: 0 solved, 417 unsolved in 29264 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 5/247 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 597/844 variables, 247/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 417/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/844 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (OVERLAPS) 0/844 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 844/844 variables, and 669 constraints, problems are : Problem set: 0 solved, 417 unsolved in 27809 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57106ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 57107ms
Starting structural reductions in LTL mode, iteration 1 : 247/660 places, 597/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57333 ms. Remains : 247/660 places, 597/1010 transitions.
[2025-05-31 06:26:20] [INFO ] Flatten gal took : 11 ms
[2025-05-31 06:26:20] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:26:20] [INFO ] Input system was already deterministic with 597 transitions.
[2025-05-31 06:26:20] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:26:20] [INFO ] Flatten gal took : 6 ms
[2025-05-31 06:26:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1754209438548317249.gal : 1 ms
[2025-05-31 06:26:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7251423005200032803.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1754209438548317249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7251423005200032803.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX(AG((TrainState_2_3_18!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((TrainState_2_3_18!=1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,4.00922,141104,1,0,6,845961,15,0,6362,87270,5
FORMULA BART-PT-005-CTLFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 155 places :
Symmetric choice reduction at 0 with 155 rule applications. Total rules 155 place count 505 transition count 855
Iterating global reduction 0 with 155 rules applied. Total rules applied 310 place count 505 transition count 855
Discarding 130 places :
Symmetric choice reduction at 0 with 130 rule applications. Total rules 440 place count 375 transition count 725
Iterating global reduction 0 with 130 rules applied. Total rules applied 570 place count 375 transition count 725
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 589 place count 356 transition count 706
Iterating global reduction 0 with 19 rules applied. Total rules applied 608 place count 356 transition count 706
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 622 place count 342 transition count 692
Iterating global reduction 0 with 14 rules applied. Total rules applied 636 place count 342 transition count 692
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 649 place count 329 transition count 679
Iterating global reduction 0 with 13 rules applied. Total rules applied 662 place count 329 transition count 679
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 675 place count 316 transition count 666
Iterating global reduction 0 with 13 rules applied. Total rules applied 688 place count 316 transition count 666
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 700 place count 304 transition count 654
Iterating global reduction 0 with 12 rules applied. Total rules applied 712 place count 304 transition count 654
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 724 place count 292 transition count 642
Iterating global reduction 0 with 12 rules applied. Total rules applied 736 place count 292 transition count 642
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 744 place count 284 transition count 634
Iterating global reduction 0 with 8 rules applied. Total rules applied 752 place count 284 transition count 634
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 759 place count 277 transition count 627
Iterating global reduction 0 with 7 rules applied. Total rules applied 766 place count 277 transition count 627
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 770 place count 273 transition count 623
Iterating global reduction 0 with 4 rules applied. Total rules applied 774 place count 273 transition count 623
Applied a total of 774 rules in 40 ms. Remains 273 /660 variables (removed 387) and now considering 623/1010 (removed 387) transitions.
// Phase 1: matrix 623 rows 273 cols
[2025-05-31 06:26:24] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:26:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 06:26:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:26:24] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2025-05-31 06:26:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 5/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 623/896 variables, 273/278 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 896/896 variables, and 278 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 5/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 623/896 variables, 273/278 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 443/721 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 896/896 variables, and 721 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 273/660 places, 623/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60303 ms. Remains : 273/660 places, 623/1010 transitions.
[2025-05-31 06:27:24] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:27:24] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:27:24] [INFO ] Input system was already deterministic with 623 transitions.
[2025-05-31 06:27:24] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:27:24] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:27:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16119180119279692727.gal : 2 ms
[2025-05-31 06:27:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5586407449540652826.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16119180119279692727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5586407449540652826.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.78888e+08,0.146406,6796,2,542,5,4496,6,0,1718,2742,0


Converting to forward existential form...Done !
original formula: (AG((!(A(A((TrainState_2_4_26==1) U (TrainState_2_1_27==1)) U (((TrainState_4_3_8==1)&&(TrainState_3_1_22==1))&&(TrainState_2_2_7==1)))) ...271
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !((!(!((E(!((((TrainState_4_3_8==1)&&(TrainState_3_1_22==1))&&(TrainState_2_2_7==1))...586
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 619/0/4
Hit Full ! (commute/partial/dont) 614/0/9
Hit Full ! (commute/partial/dont) 620/0/3
(forward)formula 0,0,0.772654,23052,1,0,18,100566,55,8,8615,22363,26
FORMULA BART-PT-005-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-05-31 06:27:25] [INFO ] Flatten gal took : 13 ms
[2025-05-31 06:27:25] [INFO ] Flatten gal took : 11 ms
Total runtime 999884 ms.

BK_STOP 1748672845832

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-PT-005"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is BART-PT-005, 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 r002-tall-174853730100834"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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