Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167700442.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is BART-PT-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167700442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 231K Apr 12 21:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 891K Apr 12 21:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 12 21:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 351K Apr 12 21:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 278K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 405K Apr 12 22:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 22:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 383K Apr 12 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 12 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 37K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 534K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716381871318

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-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 12:44:33] [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]
[2024-05-22 12:44:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:44:34] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2024-05-22 12:44:34] [INFO ] Transformed 474 places.
[2024-05-22 12:44:34] [INFO ] Transformed 404 transitions.
[2024-05-22 12:44:34] [INFO ] Found NUPN structural information;
[2024-05-22 12:44:34] [INFO ] Parsed PT model containing 474 places and 404 transitions and 3240 arcs in 556 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 63 ms.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-002-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 264 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 18 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2024-05-22 12:44:34] [INFO ] Computed 2 invariants in 51 ms
[2024-05-22 12:44:35] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-22 12:44:35] [INFO ] Invariant cache hit.
[2024-05-22 12:44:35] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 12:44:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 25672 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 17597 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 43436ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 43486ms
Finished structural reductions in LTL mode , in 1 iterations and 44518 ms. Remains : 264/264 places, 404/404 transitions.
Support contains 264 out of 264 places after structural reductions.
[2024-05-22 12:45:19] [INFO ] Flatten gal took : 127 ms
[2024-05-22 12:45:20] [INFO ] Flatten gal took : 105 ms
[2024-05-22 12:45:20] [INFO ] Input system was already deterministic with 404 transitions.
Reduction of identical properties reduced properties to check from 68 to 61
RANDOM walk for 40000 steps (8 resets) in 1715 ms. (23 steps per ms) remains 5/61 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/5 properties
[2024-05-22 12:45:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
After SMT solving in domain Real declared 132/668 variables, and 8 constraints, problems are : Problem set: 4 solved, 0 unsolved in 65 ms.
Refiners :[Domain max(s): 7/264 constraints, Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2024-05-22 12:45:21] [INFO ] Flatten gal took : 31 ms
[2024-05-22 12:45:21] [INFO ] Flatten gal took : 42 ms
[2024-05-22 12:45:21] [INFO ] Input system was already deterministic with 404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 7 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 12:45:21] [INFO ] Invariant cache hit.
[2024-05-22 12:45:21] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 12:45:21] [INFO ] Invariant cache hit.
[2024-05-22 12:45:22] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 12:45:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 25833 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 16970 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 42880ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 42886ms
Finished structural reductions in LTL mode , in 1 iterations and 43206 ms. Remains : 264/264 places, 404/404 transitions.
[2024-05-22 12:46:05] [INFO ] Flatten gal took : 36 ms
[2024-05-22 12:46:05] [INFO ] Flatten gal took : 37 ms
[2024-05-22 12:46:05] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-22 12:46:05] [INFO ] Flatten gal took : 30 ms
[2024-05-22 12:46:05] [INFO ] Flatten gal took : 28 ms
[2024-05-22 12:46:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6764471584245193283.gal : 23 ms
[2024-05-22 12:46:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6226084430827244617.ctl : 15 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6764471584245193283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6226084430827244617.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,17424,0.318257,8172,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: AF(E(EF(AG(AX(((TrainState_1_1_1==1)||(TrainState_2_1_1==1))))) U (((((((((((TrainState_2_3_30==1)||(TrainState_2_1_19==1))||((TrainState...14367
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U !(E(TRUE U !(!(EX(!(((TrainState_1_1_1==1)||(TrainState_2_1_1==1))))))))) U (((((((((((T...14454
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.08057,52896,1,0,42,294669,28,24,6715,137187,39
FORMULA BART-PT-002-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 71 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2024-05-22 12:46:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:46:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 12:46:07] [INFO ] Invariant cache hit.
[2024-05-22 12:46:07] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 12:46:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5418 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4734 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 10197ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 10200ms
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10452 ms. Remains : 98/264 places, 238/404 transitions.
[2024-05-22 12:46:17] [INFO ] Flatten gal took : 14 ms
[2024-05-22 12:46:17] [INFO ] Flatten gal took : 13 ms
[2024-05-22 12:46:17] [INFO ] Input system was already deterministic with 238 transitions.
[2024-05-22 12:46:17] [INFO ] Flatten gal took : 14 ms
[2024-05-22 12:46:18] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:46:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12730312103483888797.gal : 5 ms
[2024-05-22 12:46:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11303120844361425303.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12730312103483888797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11303120844361425303.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2401,0.071841,4412,2,384,5,4104,6,0,633,1950,0


Converting to forward existential form...Done !
original formula: EX(EG(((TrainState_1_0_0==1)||(TrainState_2_0_0==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),((TrainState_1_0_0==1)||(TrainState_2_0_0==1)))] != FALSE
Hit Full ! (commute/partial/dont) 164/0/74
(forward)formula 0,1,0.251763,7632,1,0,7,21351,19,1,2706,7230,9
FORMULA BART-PT-002-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 264 transition count 398
Reduce places removed 6 places and 0 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Iterating post reduction 1 with 60 rules applied. Total rules applied 66 place count 258 transition count 344
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 120 place count 204 transition count 344
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 202 transition count 342
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 202 transition count 342
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 140 place count 194 transition count 334
Applied a total of 140 rules in 72 ms. Remains 194 /264 variables (removed 70) and now considering 334/404 (removed 70) transitions.
// Phase 1: matrix 334 rows 194 cols
[2024-05-22 12:46:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 12:46:18] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 12:46:18] [INFO ] Invariant cache hit.
[2024-05-22 12:46:18] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-22 12:46:18] [INFO ] Redundant transitions in 34 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-22 12:46:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 2/194 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 334/528 variables, 194/196 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 0/528 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 196 constraints, problems are : Problem set: 0 solved, 262 unsolved in 14246 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 2/194 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 334/528 variables, 194/196 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 262/458 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/528 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 458 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 24911ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 24916ms
Starting structural reductions in SI_CTL mode, iteration 1 : 194/264 places, 334/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25420 ms. Remains : 194/264 places, 334/404 transitions.
[2024-05-22 12:46:43] [INFO ] Flatten gal took : 16 ms
[2024-05-22 12:46:43] [INFO ] Flatten gal took : 17 ms
[2024-05-22 12:46:43] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-22 12:46:43] [INFO ] Flatten gal took : 18 ms
[2024-05-22 12:46:43] [INFO ] Flatten gal took : 17 ms
[2024-05-22 12:46:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4794292640769591577.gal : 5 ms
[2024-05-22 12:46:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4028952142218190269.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4794292640769591577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4028952142218190269.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9409,0.159317,6320,2,768,5,12504,6,0,1113,8897,0


Converting to forward existential form...Done !
original formula: EG(AF((((((((((TrainState_1_1_17==1)||(TrainState_1_4_17==1))||((TrainState_1_1_36==1)||(TrainState_1_1_4==1)))||(((TrainState_1_1_27==1)...3534
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((((((((TrainState_1_1_17==1)||(TrainState_1_4_17==1))||((TrainState_1_1_36==1)||(TrainState_...3583
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.869467,17128,1,0,6,78466,21,1,5146,18582,8
FORMULA BART-PT-002-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2024-05-22 12:46:44] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 12:46:44] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 12:46:44] [INFO ] Invariant cache hit.
[2024-05-22 12:46:45] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 12:46:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 27079 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 17992 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 45114ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 45118ms
Finished structural reductions in LTL mode , in 1 iterations and 45444 ms. Remains : 264/264 places, 404/404 transitions.
[2024-05-22 12:47:30] [INFO ] Flatten gal took : 23 ms
[2024-05-22 12:47:30] [INFO ] Flatten gal took : 23 ms
[2024-05-22 12:47:30] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-22 12:47:30] [INFO ] Flatten gal took : 20 ms
[2024-05-22 12:47:30] [INFO ] Flatten gal took : 20 ms
[2024-05-22 12:47:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13120391184812588902.gal : 6 ms
[2024-05-22 12:47:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17763935957991464696.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13120391184812588902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17763935957991464696.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,17424,0.197982,8292,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: !(A(AX(!(((((((((TrainState_1_2_5==1)||(TrainState_1_4_12==1))||((TrainState_2_4_12==1)||(TrainState_1_3_7==1)))||(((TrainState_2_2_5==1)...7571
=> equivalent forward existential formula: ([(EY((EY((FwdU(Init,!(((TrainState_1_1_1==1)||(TrainState_2_1_1==1)))) * !(((TrainState_1_1_1==1)||(TrainState_...7750
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 400/4/4
(forward)formula 0,1,1.51664,30932,1,0,15,158296,24,6,7416,52670,12
FORMULA BART-PT-002-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 19 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 12:47:31] [INFO ] Invariant cache hit.
[2024-05-22 12:47:31] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 12:47:31] [INFO ] Invariant cache hit.
[2024-05-22 12:47:32] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 12:47:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 26217 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 18320 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 44595ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 44600ms
Finished structural reductions in LTL mode , in 1 iterations and 44994 ms. Remains : 264/264 places, 404/404 transitions.
[2024-05-22 12:48:16] [INFO ] Flatten gal took : 17 ms
[2024-05-22 12:48:16] [INFO ] Flatten gal took : 17 ms
[2024-05-22 12:48:16] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-22 12:48:16] [INFO ] Flatten gal took : 16 ms
[2024-05-22 12:48:16] [INFO ] Flatten gal took : 16 ms
[2024-05-22 12:48:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6095547741297637095.gal : 4 ms
[2024-05-22 12:48:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10447335176271571305.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6095547741297637095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10447335176271571305.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,17424,0.282757,8292,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: EX((((((EG(AF((((((((((TrainState_2_3_30==0)&&(TrainState_2_1_19==0))&&((TrainState_1_2_22==0)&&(TrainState_2_2_19==0)))&&(((TrainState_2...5057
=> equivalent forward existential formula: ((((([FwdG(EY(Init),!(EG(!((((((((((TrainState_2_3_30==0)&&(TrainState_2_1_19==0))&&((TrainState_1_2_22==0)&&(Tr...5226
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.30132,28716,1,0,32,152184,23,20,6311,46606,29
FORMULA BART-PT-002-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 3 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 12:48:18] [INFO ] Invariant cache hit.
[2024-05-22 12:48:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 12:48:18] [INFO ] Invariant cache hit.
[2024-05-22 12:48:18] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 12:48:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 27424 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 17964 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 45426ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 45430ms
Finished structural reductions in LTL mode , in 1 iterations and 45733 ms. Remains : 264/264 places, 404/404 transitions.
[2024-05-22 12:49:04] [INFO ] Flatten gal took : 18 ms
[2024-05-22 12:49:04] [INFO ] Flatten gal took : 19 ms
[2024-05-22 12:49:04] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-22 12:49:04] [INFO ] Flatten gal took : 19 ms
[2024-05-22 12:49:04] [INFO ] Flatten gal took : 19 ms
[2024-05-22 12:49:04] [INFO ] Time to serialize gal into /tmp/CTLFireability2747535048641799981.gal : 4 ms
[2024-05-22 12:49:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12234077402722176759.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2747535048641799981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12234077402722176759.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,17424,0.278897,8296,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: EG(((EG((EF(((TrainState_1_1_1==1)||(TrainState_2_1_1==1))) + EG(((TrainState_1_1_1==0)&&(TrainState_2_1_1==0))))) + AG(((((TrainState_1_...15393
=> equivalent forward existential formula: [FwdG(Init,((EG((E(TRUE U ((TrainState_1_1_1==1)||(TrainState_2_1_1==1))) + EG(((TrainState_1_1_1==0)&&(TrainSta...15472
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,5.38247,130924,1,0,29,1.03383e+06,46,16,7990,351338,29
FORMULA BART-PT-002-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 1 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 12:49:09] [INFO ] Invariant cache hit.
[2024-05-22 12:49:09] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 12:49:09] [INFO ] Invariant cache hit.
[2024-05-22 12:49:09] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 12:49:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 27511 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 17994 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 45547ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 45552ms
Finished structural reductions in LTL mode , in 1 iterations and 45878 ms. Remains : 264/264 places, 404/404 transitions.
[2024-05-22 12:49:55] [INFO ] Flatten gal took : 17 ms
[2024-05-22 12:49:55] [INFO ] Flatten gal took : 19 ms
[2024-05-22 12:49:55] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-22 12:49:55] [INFO ] Flatten gal took : 18 ms
[2024-05-22 12:49:55] [INFO ] Flatten gal took : 18 ms
[2024-05-22 12:49:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1663111368558204615.gal : 4 ms
[2024-05-22 12:49:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8403772037926581069.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1663111368558204615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8403772037926581069.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,17424,0.299123,8292,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: AF(!(A(AX(EG((((((((((TrainState_1_1_17==1)||(TrainState_1_4_17==1))||((TrainState_1_1_36==1)||(TrainState_1_1_4==1)))||(((TrainState_1_1...17322
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((!((((((((TrainState_1_2_5==1)||(TrainState_1_4_12==1))||((TrainState_2_4_12==1)||(TrainS...45333
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 330/74/74
Hit Full ! (commute/partial/dont) 356/0/48
Using saturation style SCC detection
(forward)formula 0,0,6.79438,155236,1,0,43,1.26235e+06,58,32,8668,407739,45
FORMULA BART-PT-002-CTLFireability-2024-07 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 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 22 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2024-05-22 12:50:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:50:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 12:50:02] [INFO ] Invariant cache hit.
[2024-05-22 12:50:02] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 12:50:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5385 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4236 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 9648ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 9650ms
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9803 ms. Remains : 98/264 places, 238/404 transitions.
[2024-05-22 12:50:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:50:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:50:12] [INFO ] Input system was already deterministic with 238 transitions.
[2024-05-22 12:50:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:50:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:50:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11132503570050949128.gal : 1 ms
[2024-05-22 12:50:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10198710861384948684.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11132503570050949128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10198710861384948684.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2401,0.066837,4412,2,384,5,4104,6,0,633,1950,0


Converting to forward existential form...Done !
original formula: AF((EG(AX((TrainState_2_1_16==1))) + EG(EX((TrainState_1_1_1==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(!(EX(!((TrainState_2_1_16==1))))) + EG(EX((TrainState_1_1_1==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.355009,11592,1,0,28,51937,26,19,2628,24334,29
FORMULA BART-PT-002-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 181 place count 147 transition count 287
Iterating global reduction 0 with 53 rules applied. Total rules applied 234 place count 147 transition count 287
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 242 place count 139 transition count 279
Iterating global reduction 0 with 8 rules applied. Total rules applied 250 place count 139 transition count 279
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 256 place count 133 transition count 273
Iterating global reduction 0 with 6 rules applied. Total rules applied 262 place count 133 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 268 place count 127 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 274 place count 127 transition count 267
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 280 place count 121 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 292 place count 115 transition count 255
Iterating global reduction 0 with 6 rules applied. Total rules applied 298 place count 115 transition count 255
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 304 place count 109 transition count 249
Iterating global reduction 0 with 6 rules applied. Total rules applied 310 place count 109 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 314 place count 105 transition count 245
Iterating global reduction 0 with 4 rules applied. Total rules applied 318 place count 105 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 322 place count 101 transition count 241
Iterating global reduction 0 with 4 rules applied. Total rules applied 326 place count 101 transition count 241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 328 place count 99 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 330 place count 99 transition count 239
Applied a total of 330 rules in 12 ms. Remains 99 /264 variables (removed 165) and now considering 239/404 (removed 165) transitions.
// Phase 1: matrix 239 rows 99 cols
[2024-05-22 12:50:12] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 12:50:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 12:50:12] [INFO ] Invariant cache hit.
[2024-05-22 12:50:12] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-22 12:50:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 239/338 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 0/338 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 101 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6059 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 239/338 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 167/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 268 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 10084ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 10088ms
Starting structural reductions in LTL mode, iteration 1 : 99/264 places, 239/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10314 ms. Remains : 99/264 places, 239/404 transitions.
[2024-05-22 12:50:23] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:50:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:50:23] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-22 12:50:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:50:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:50:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8913000664152165249.gal : 2 ms
[2024-05-22 12:50:23] [INFO ] Time to serialize properties into /tmp/CTLFireability16903429429916545013.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8913000664152165249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16903429429916545013.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2450,0.075616,4412,2,388,5,4158,6,0,638,1966,0


Converting to forward existential form...Done !
original formula: AF((EG((EX((TrainState_2_1_17==0)) * AF((TrainState_2_1_8==1)))) + EF(((TrainState_1_1_13==1)&&((TrainState_2_1_34==0)||(TrainState_2_2_3...165
=> equivalent forward existential formula: [FwdG(Init,!((EG((EX((TrainState_2_1_17==0)) * !(EG(!((TrainState_2_1_8==1)))))) + E(TRUE U ((TrainState_1_1_13=...222
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.33728,9480,1,0,10,36304,34,3,2852,10829,12
FORMULA BART-PT-002-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 203 transition count 343
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 203 transition count 343
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 172 place count 153 transition count 293
Iterating global reduction 0 with 50 rules applied. Total rules applied 222 place count 153 transition count 293
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 230 place count 145 transition count 285
Iterating global reduction 0 with 8 rules applied. Total rules applied 238 place count 145 transition count 285
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 244 place count 139 transition count 279
Iterating global reduction 0 with 6 rules applied. Total rules applied 250 place count 139 transition count 279
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 256 place count 133 transition count 273
Iterating global reduction 0 with 6 rules applied. Total rules applied 262 place count 133 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 268 place count 127 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 274 place count 127 transition count 267
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 280 place count 121 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 292 place count 115 transition count 255
Iterating global reduction 0 with 6 rules applied. Total rules applied 298 place count 115 transition count 255
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 302 place count 111 transition count 251
Iterating global reduction 0 with 4 rules applied. Total rules applied 306 place count 111 transition count 251
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 310 place count 107 transition count 247
Iterating global reduction 0 with 4 rules applied. Total rules applied 314 place count 107 transition count 247
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 316 place count 105 transition count 245
Iterating global reduction 0 with 2 rules applied. Total rules applied 318 place count 105 transition count 245
Applied a total of 318 rules in 29 ms. Remains 105 /264 variables (removed 159) and now considering 245/404 (removed 159) transitions.
// Phase 1: matrix 245 rows 105 cols
[2024-05-22 12:50:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:50:23] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 12:50:23] [INFO ] Invariant cache hit.
[2024-05-22 12:50:23] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-22 12:50:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 2/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 245/350 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 0/350 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 107 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 2/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 245/350 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 173/280 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 0/350 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 280 constraints, problems are : Problem set: 0 solved, 173 unsolved in 4994 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 11239ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 11242ms
Starting structural reductions in LTL mode, iteration 1 : 105/264 places, 245/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11456 ms. Remains : 105/264 places, 245/404 transitions.
[2024-05-22 12:50:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:50:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:50:34] [INFO ] Input system was already deterministic with 245 transitions.
[2024-05-22 12:50:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:50:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:50:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10620895507447762012.gal : 3 ms
[2024-05-22 12:50:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13248284918029519885.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10620895507447762012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13248284918029519885.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2756,0.078236,4448,2,414,5,4802,6,0,668,2704,0


Converting to forward existential form...Done !
original formula: AG(((AF(((TrainState_2_2_7==0)||(TrainState_1_3_17==1))) + (EF((TrainState_1_0_0==0)) * !(E((TrainState_1_0_0!=1) U (TrainState_2_0_0==1)...282
=> equivalent forward existential formula: ([((EY((FwdU(Init,TRUE) * !((!(EG(!(((TrainState_2_2_7==0)||(TrainState_1_3_17==1))))) + (E(TRUE U (TrainState_1...620
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 243/0/2
Hit Full ! (commute/partial/dont) 208/0/37
(forward)formula 0,1,0.415292,10308,1,0,21,38525,52,9,3130,13483,24
FORMULA BART-PT-002-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 181 place count 147 transition count 287
Iterating global reduction 0 with 53 rules applied. Total rules applied 234 place count 147 transition count 287
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 242 place count 139 transition count 279
Iterating global reduction 0 with 8 rules applied. Total rules applied 250 place count 139 transition count 279
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 256 place count 133 transition count 273
Iterating global reduction 0 with 6 rules applied. Total rules applied 262 place count 133 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 268 place count 127 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 274 place count 127 transition count 267
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 280 place count 121 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 292 place count 115 transition count 255
Iterating global reduction 0 with 6 rules applied. Total rules applied 298 place count 115 transition count 255
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 304 place count 109 transition count 249
Iterating global reduction 0 with 6 rules applied. Total rules applied 310 place count 109 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 314 place count 105 transition count 245
Iterating global reduction 0 with 4 rules applied. Total rules applied 318 place count 105 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 322 place count 101 transition count 241
Iterating global reduction 0 with 4 rules applied. Total rules applied 326 place count 101 transition count 241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 328 place count 99 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 330 place count 99 transition count 239
Applied a total of 330 rules in 25 ms. Remains 99 /264 variables (removed 165) and now considering 239/404 (removed 165) transitions.
// Phase 1: matrix 239 rows 99 cols
[2024-05-22 12:50:35] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 12:50:35] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 12:50:35] [INFO ] Invariant cache hit.
[2024-05-22 12:50:35] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-22 12:50:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 239/338 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 0/338 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 101 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5761 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 239/338 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 167/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 268 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4795 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 10585ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 10589ms
Starting structural reductions in LTL mode, iteration 1 : 99/264 places, 239/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10812 ms. Remains : 99/264 places, 239/404 transitions.
[2024-05-22 12:50:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:50:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:50:46] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-22 12:50:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:50:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:50:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16821044457289064712.gal : 2 ms
[2024-05-22 12:50:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16928915050473749655.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16821044457289064712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16928915050473749655.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2450,0.073222,4420,2,388,5,4156,6,0,638,1966,0


Converting to forward existential form...Done !
original formula: E(((TrainState_1_2_27==1) + !(EG(AG((TrainState_1_1_39!=1))))) U AF(!((AX(FALSE) + !((A((TrainState_2_0_0==1) U (TrainState_1_1_36==1)) *...183
=> equivalent forward existential formula: [(FwdU(Init,((TrainState_1_2_27==1) + !(EG(!(E(TRUE U !((TrainState_1_1_39!=1)))))))) * !(EG(!(!((!(EX(!(FALSE))...326
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/0/4
(forward)formula 0,0,0.252443,7376,1,0,9,19916,29,2,2666,5297,11
FORMULA BART-PT-002-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 206 transition count 346
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 206 transition count 346
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 164 place count 158 transition count 298
Iterating global reduction 0 with 48 rules applied. Total rules applied 212 place count 158 transition count 298
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 219 place count 151 transition count 291
Iterating global reduction 0 with 7 rules applied. Total rules applied 226 place count 151 transition count 291
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 231 place count 146 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 241 place count 141 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 246 place count 141 transition count 281
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 251 place count 136 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 261 place count 131 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 270 place count 127 transition count 267
Iterating global reduction 0 with 4 rules applied. Total rules applied 274 place count 127 transition count 267
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 276 place count 125 transition count 265
Iterating global reduction 0 with 2 rules applied. Total rules applied 278 place count 125 transition count 265
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 280 place count 123 transition count 263
Iterating global reduction 0 with 2 rules applied. Total rules applied 282 place count 123 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 283 place count 122 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 284 place count 122 transition count 262
Applied a total of 284 rules in 13 ms. Remains 122 /264 variables (removed 142) and now considering 262/404 (removed 142) transitions.
// Phase 1: matrix 262 rows 122 cols
[2024-05-22 12:50:46] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 12:50:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 12:50:46] [INFO ] Invariant cache hit.
[2024-05-22 12:50:46] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-22 12:50:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 2/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 262/384 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/384 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 124 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 2/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 262/384 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 190/314 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/384 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 314 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 13929ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 13931ms
Starting structural reductions in LTL mode, iteration 1 : 122/264 places, 262/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14139 ms. Remains : 122/264 places, 262/404 transitions.
[2024-05-22 12:51:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:00] [INFO ] Input system was already deterministic with 262 transitions.
[2024-05-22 12:51:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14737920630052208507.gal : 2 ms
[2024-05-22 12:51:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6569415029723075524.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14737920630052208507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6569415029723075524.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3621,0.094735,4924,2,476,5,5906,6,0,753,3379,0


Converting to forward existential form...Done !
original formula: E(AF((((TrainState_2_3_26==1)||(TrainState_1_3_33==1))||(TrainState_1_4_28==1))) U E(AX((AF((TrainState_1_1_31==1)) * ((TrainState_1_4_20...344
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,!(EG(!((((TrainState_2_3_26==1)||(TrainState_1_3_33==1))||(TrainState_1_4_28==1)))))),!(EX(!(...741
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 225/0/37
Using saturation style SCC detection
(forward)formula 0,0,0.576234,14896,1,0,24,76246,76,14,3459,29181,36
FORMULA BART-PT-002-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 205 transition count 345
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 205 transition count 345
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 165 place count 158 transition count 298
Iterating global reduction 0 with 47 rules applied. Total rules applied 212 place count 158 transition count 298
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 219 place count 151 transition count 291
Iterating global reduction 0 with 7 rules applied. Total rules applied 226 place count 151 transition count 291
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 231 place count 146 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 241 place count 141 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 246 place count 141 transition count 281
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 251 place count 136 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 261 place count 131 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 270 place count 127 transition count 267
Iterating global reduction 0 with 4 rules applied. Total rules applied 274 place count 127 transition count 267
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 277 place count 124 transition count 264
Iterating global reduction 0 with 3 rules applied. Total rules applied 280 place count 124 transition count 264
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 282 place count 122 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 285 place count 121 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 286 place count 121 transition count 261
Applied a total of 286 rules in 16 ms. Remains 121 /264 variables (removed 143) and now considering 261/404 (removed 143) transitions.
// Phase 1: matrix 261 rows 121 cols
[2024-05-22 12:51:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:51:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 12:51:01] [INFO ] Invariant cache hit.
[2024-05-22 12:51:01] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-22 12:51:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 2/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 261/382 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/382 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 123 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7902 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 2/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 261/382 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 189/312 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/382 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 312 constraints, problems are : Problem set: 0 solved, 189 unsolved in 6186 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 14110ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 14112ms
Starting structural reductions in LTL mode, iteration 1 : 121/264 places, 261/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14298 ms. Remains : 121/264 places, 261/404 transitions.
[2024-05-22 12:51:15] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:51:15] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:15] [INFO ] Input system was already deterministic with 261 transitions.
[2024-05-22 12:51:15] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:15] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10927598421506229070.gal : 2 ms
[2024-05-22 12:51:15] [INFO ] Time to serialize properties into /tmp/CTLFireability18337041344162778896.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10927598421506229070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18337041344162778896.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3660,0.102276,4924,2,468,5,6223,6,0,748,3478,0


Converting to forward existential form...Done !
original formula: ((A((TrainState_2_3_33!=1) U (AX((EG((TrainState_2_4_24==1)) + !(EF((TrainState_2_0_0==1))))) + (TrainState_1_4_15==1))) + AF(((TrainStat...329
=> equivalent forward existential formula: ([(FwdU((Init * !((!((E(!((!(EX(!((EG((TrainState_2_4_24==1)) + !(E(TRUE U (TrainState_2_0_0==1))))))) + (TrainS...1153
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.873904,22568,1,0,64,143626,46,41,3630,55046,59
FORMULA BART-PT-002-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 388 edges and 264 vertex of which 252 / 264 are part of one of the 2 SCC in 5 ms
Free SCC test removed 250 places
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 14 transition count 20
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 12 transition count 18
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 10 transition count 16
Applied a total of 11 rules in 25 ms. Remains 10 /264 variables (removed 254) and now considering 16/404 (removed 388) transitions.
[2024-05-22 12:51:16] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 10 cols
[2024-05-22 12:51:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:51:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 12:51:16] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-22 12:51:16] [INFO ] Invariant cache hit.
[2024-05-22 12:51:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-22 12:51:16] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 12:51:16] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-22 12:51:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 14/24 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 104 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 14/24 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 30 constraints, problems are : Problem set: 0 solved, 8 unsolved in 86 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 195ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/264 places, 16/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 271 ms. Remains : 10/264 places, 16/404 transitions.
[2024-05-22 12:51:16] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:51:16] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:51:16] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-22 12:51:16] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:51:16] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:51:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14961702770222208182.gal : 1 ms
[2024-05-22 12:51:16] [INFO ] Time to serialize properties into /tmp/CTLFireability656664855583395083.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14961702770222208182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability656664855583395083.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,24,0.003176,3364,2,28,5,112,6,0,57,74,0


Converting to forward existential form...Done !
original formula: AF(!(A(!(E((TrainState_2_2_11!=1) U (TrainState_1_1_29==1))) U AF(((((TrainState_2_3_12==1)&&(TrainState_1_2_11==1))||(TrainState_2_3_26=...188
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!(((((TrainState_2_3_12==1)&&(TrainState_1_2_11==1))||(TrainState_2_3_26==1))||(Train...488
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 14/0/2
Using saturation style SCC detection
(forward)formula 0,1,0.00911,3944,1,0,14,521,36,6,268,340,16
FORMULA BART-PT-002-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 203 transition count 343
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 203 transition count 343
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 173 place count 152 transition count 292
Iterating global reduction 0 with 51 rules applied. Total rules applied 224 place count 152 transition count 292
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 230 place count 146 transition count 286
Iterating global reduction 0 with 6 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 242 place count 140 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 253 place count 135 transition count 275
Iterating global reduction 0 with 5 rules applied. Total rules applied 258 place count 135 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 263 place count 130 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 272 place count 126 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 280 place count 122 transition count 262
Iterating global reduction 0 with 4 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 286 place count 120 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 290 place count 118 transition count 258
Iterating global reduction 0 with 2 rules applied. Total rules applied 292 place count 118 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 117 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 117 transition count 257
Applied a total of 294 rules in 28 ms. Remains 117 /264 variables (removed 147) and now considering 257/404 (removed 147) transitions.
// Phase 1: matrix 257 rows 117 cols
[2024-05-22 12:51:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:51:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 12:51:16] [INFO ] Invariant cache hit.
[2024-05-22 12:51:17] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-22 12:51:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 2/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 257/374 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/374 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 119 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7425 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 2/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 257/374 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 185/304 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 304 constraints, problems are : Problem set: 0 solved, 185 unsolved in 5808 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 13278ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 13282ms
Starting structural reductions in LTL mode, iteration 1 : 117/264 places, 257/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13505 ms. Remains : 117/264 places, 257/404 transitions.
[2024-05-22 12:51:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:30] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-22 12:51:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:51:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5575085459655683480.gal : 2 ms
[2024-05-22 12:51:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16239259940772870072.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5575085459655683480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16239259940772870072.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3422,0.090979,4880,2,462,5,6102,6,0,728,3221,0


Converting to forward existential form...Done !
original formula: EF(EG(EX((EG((TrainState_2_3_27==1)) * (A((TrainState_2_1_8==1) U (TrainState_1_4_13==1)) + ((TrainState_1_2_16==1)&&(TrainState_2_4_12==...163
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX((EG((TrainState_2_3_27==1)) * (!((E(!((TrainState_1_4_13==1)) U (!((TrainState_2_1_8==1...286
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 255/0/2
(forward)formula 0,0,0.387761,9896,1,0,14,35127,36,5,3064,10091,17
FORMULA BART-PT-002-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 12:51:30] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:51:30] [INFO ] Flatten gal took : 11 ms
Total runtime 417041 ms.

BK_STOP 1716382290876

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-002"
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-5568"
echo " Executing tool itstools"
echo " Input is BART-PT-002, 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 r026-smll-171620167700442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-002.tgz
mv BART-PT-002 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;