Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689500602.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689500602
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 149K Apr 29 20:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 520K Apr 29 20:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 302K Apr 29 20:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 1021K Apr 29 20:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 253K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 672K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 94K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 254K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 68K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.3M May 10 09:33 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-005-CTLFireability-00
FORMULA_NAME BART-PT-005-CTLFireability-01
FORMULA_NAME BART-PT-005-CTLFireability-02
FORMULA_NAME BART-PT-005-CTLFireability-03
FORMULA_NAME BART-PT-005-CTLFireability-04
FORMULA_NAME BART-PT-005-CTLFireability-05
FORMULA_NAME BART-PT-005-CTLFireability-06
FORMULA_NAME BART-PT-005-CTLFireability-07
FORMULA_NAME BART-PT-005-CTLFireability-08
FORMULA_NAME BART-PT-005-CTLFireability-09
FORMULA_NAME BART-PT-005-CTLFireability-10
FORMULA_NAME BART-PT-005-CTLFireability-11
FORMULA_NAME BART-PT-005-CTLFireability-12
FORMULA_NAME BART-PT-005-CTLFireability-13
FORMULA_NAME BART-PT-005-CTLFireability-14
FORMULA_NAME BART-PT-005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652667327036

Running Version 202205111006
[2022-05-16 02:15:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:15:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:15:28] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2022-05-16 02:15:28] [INFO ] Transformed 870 places.
[2022-05-16 02:15:28] [INFO ] Transformed 1010 transitions.
[2022-05-16 02:15:28] [INFO ] Found NUPN structural information;
[2022-05-16 02:15:28] [INFO ] Parsed PT model containing 870 places and 1010 transitions in 295 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 56 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 660 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 19 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:15:28] [INFO ] Computed 5 place invariants in 21 ms
[2022-05-16 02:15:29] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:15:29] [INFO ] Computed 5 place invariants in 14 ms
[2022-05-16 02:15:29] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:15:29] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 02:15:30] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 660/660 places, 1010/1010 transitions.
Support contains 660 out of 660 places after structural reductions.
[2022-05-16 02:15:30] [INFO ] Flatten gal took : 136 ms
[2022-05-16 02:15:31] [INFO ] Flatten gal took : 79 ms
[2022-05-16 02:15:31] [INFO ] Input system was already deterministic with 1010 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 40) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:15:32] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-16 02:15:33] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2022-05-16 02:15:33] [INFO ] Flatten gal took : 53 ms
[2022-05-16 02:15:33] [INFO ] Flatten gal took : 64 ms
[2022-05-16 02:15:33] [INFO ] Input system was already deterministic with 1010 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 22 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:15:33] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-16 02:15:34] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:15:34] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-16 02:15:34] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2022-05-16 02:15:34] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:15:34] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 02:15:34] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 660/660 places, 1010/1010 transitions.
[2022-05-16 02:15:35] [INFO ] Flatten gal took : 27 ms
[2022-05-16 02:15:35] [INFO ] Flatten gal took : 30 ms
[2022-05-16 02:15:35] [INFO ] Input system was already deterministic with 1010 transitions.
[2022-05-16 02:15:35] [INFO ] Flatten gal took : 29 ms
[2022-05-16 02:15:35] [INFO ] Flatten gal took : 28 ms
[2022-05-16 02:15:35] [INFO ] Time to serialize gal into /tmp/CTLFireability18393671056586807005.gal : 17 ms
[2022-05-16 02:15:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10075951596091103714.ctl : 50 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18393671056586807005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10075951596091103714.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (E(EG(!(AG((((((((((TrainState_1_0_0==1)||(TrainState_3_0_0==1))||((TrainState_2_0_0==1)||(TrainState_1_0_0==1)))||(((TrainState_2_0_0==1...47601
Detected timeout of ITS tools.
=> equivalent forward existential formula: ((([FwdG((FwdU(Init,EG(!(!(E(TRUE U !((((((((((TrainState_1_0_0==1)||(TrainState_3_0_0==1))||((TrainState_2_0_0=...91662
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:181)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:186)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:16:05] [INFO ] Flatten gal took : 63 ms
[2022-05-16 02:16:05] [INFO ] Applying decomposition
[2022-05-16 02:16:05] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14503214937993742241.txt' '-o' '/tmp/graph14503214937993742241.bin' '-w' '/tmp/graph14503214937993742241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14503214937993742241.bin' '-l' '-1' '-v' '-w' '/tmp/graph14503214937993742241.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:16:05] [INFO ] Decomposing Gal with order
[2022-05-16 02:16:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:16:05] [INFO ] Removed a total of 59 redundant transitions.
[2022-05-16 02:16:05] [INFO ] Flatten gal took : 145 ms
[2022-05-16 02:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-16 02:16:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17544296051444420415.gal : 12 ms
[2022-05-16 02:16:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16238259903314328827.ctl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17544296051444420415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16238259903314328827.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.251682,11180,294,75,7202,2895,1148,8842,234,2271,0


Converting to forward existential form...Done !
original formula: (E(EG(!(AG((((((((((i5.i0.i0.u16.TrainState_1_0_0==1)||(i1.i0.i0.u14.TrainState_3_0_0==1))||((i7.i1.i0.u13.TrainState_2_0_0==1)||(i5.i0.i...71072
=> equivalent forward existential formula: ((([FwdG((FwdU(Init,EG(!(!(E(TRUE U !((((((((((i5.i0.i0.u16.TrainState_1_0_0==1)||(i1.i0.i0.u14.TrainState_3_0_0...138779
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,1.0681,23288,1,0,19277,40738,12452,27539,1528,44747,40286
FORMULA BART-PT-005-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 660 transition count 895
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 545 transition count 895
Applied a total of 230 rules in 87 ms. Remains 545 /660 variables (removed 115) and now considering 895/1010 (removed 115) transitions.
// Phase 1: matrix 895 rows 545 cols
[2022-05-16 02:16:07] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-16 02:16:07] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 895 rows 545 cols
[2022-05-16 02:16:07] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-16 02:16:07] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2022-05-16 02:16:07] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 895 rows 545 cols
[2022-05-16 02:16:07] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-16 02:16:08] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 545/660 places, 895/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 545/660 places, 895/1010 transitions.
[2022-05-16 02:16:08] [INFO ] Flatten gal took : 16 ms
[2022-05-16 02:16:08] [INFO ] Flatten gal took : 18 ms
[2022-05-16 02:16:08] [INFO ] Input system was already deterministic with 895 transitions.
[2022-05-16 02:16:08] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:16:08] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:16:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16976835290675175763.gal : 2 ms
[2022-05-16 02:16:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12163500945087817510.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16976835290675175763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12163500945087817510.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53862e+10,4.00995,125044,2,17078,5,830852,6,0,3078,531396,0


Converting to forward existential form...Done !
original formula: EG((((((((((E((((((((TrainState_1_4_13==1)||(TrainState_4_2_4==1))||((TrainState_3_3_9==1)||(TrainState_4_4_14==1)))||(((TrainState_1_3_7...13754
=> equivalent forward existential formula: [FwdG(Init,(((((((((E((((((((TrainState_1_4_13==1)||(TrainState_4_2_4==1))||((TrainState_3_3_9==1)||(TrainState_...13797
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 775/0/120
Detected timeout of ITS tools.
[2022-05-16 02:16:38] [INFO ] Flatten gal took : 15 ms
[2022-05-16 02:16:38] [INFO ] Applying decomposition
[2022-05-16 02:16:38] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4247402191702942030.txt' '-o' '/tmp/graph4247402191702942030.bin' '-w' '/tmp/graph4247402191702942030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4247402191702942030.bin' '-l' '-1' '-v' '-w' '/tmp/graph4247402191702942030.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:16:38] [INFO ] Decomposing Gal with order
[2022-05-16 02:16:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:16:38] [INFO ] Removed a total of 215 redundant transitions.
[2022-05-16 02:16:38] [INFO ] Flatten gal took : 69 ms
[2022-05-16 02:16:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 16 ms.
[2022-05-16 02:16:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6068122958201441332.gal : 7 ms
[2022-05-16 02:16:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9773503930899222008.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6068122958201441332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9773503930899222008.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53862e+10,0.193949,9948,389,75,4285,2899,1116,3896,248,2100,0


Converting to forward existential form...Done !
original formula: EG((((((((((E((((((((i1.i0.u60.TrainState_1_4_13==1)||(i0.i0.u18.TrainState_4_2_4==1))||((i3.i0.u29.TrainState_3_3_9==1)||(i0.i1.u92.Trai...19250
=> equivalent forward existential formula: [FwdG(Init,(((((((((E((((((((i1.i0.u60.TrainState_1_4_13==1)||(i0.i0.u18.TrainState_4_2_4==1))||((i3.i0.u29.Trai...19293
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,2.13248,100408,1,0,161604,30945,6569,621446,1090,59049,237310
FORMULA BART-PT-005-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 106 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
// Phase 1: matrix 595 rows 245 cols
[2022-05-16 02:16:41] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 02:16:41] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 595 rows 245 cols
[2022-05-16 02:16:41] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 02:16:41] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 595 rows 245 cols
[2022-05-16 02:16:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 02:16:41] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 245/660 places, 595/1010 transitions.
[2022-05-16 02:16:41] [INFO ] Flatten gal took : 12 ms
[2022-05-16 02:16:41] [INFO ] Flatten gal took : 12 ms
[2022-05-16 02:16:41] [INFO ] Input system was already deterministic with 595 transitions.
[2022-05-16 02:16:41] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:16:41] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:16:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9703316323730767595.gal : 1 ms
[2022-05-16 02:16:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9367317364767720061.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9703316323730767595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9367317364767720061.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(EX(EF(AX(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(TrainState_5_1_1==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U !(EX(!(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(Tra...214
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,5.66432,165572,1,0,8,1.15238e+06,15,1,6317,187479,6
FORMULA BART-PT-005-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 615 transition count 965
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 615 transition count 965
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 120 place count 585 transition count 935
Iterating global reduction 0 with 30 rules applied. Total rules applied 150 place count 585 transition count 935
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 165 place count 570 transition count 920
Iterating global reduction 0 with 15 rules applied. Total rules applied 180 place count 570 transition count 920
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 555 transition count 905
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 555 transition count 905
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 225 place count 540 transition count 890
Iterating global reduction 0 with 15 rules applied. Total rules applied 240 place count 540 transition count 890
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 255 place count 525 transition count 875
Iterating global reduction 0 with 15 rules applied. Total rules applied 270 place count 525 transition count 875
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 280 place count 515 transition count 865
Iterating global reduction 0 with 10 rules applied. Total rules applied 290 place count 515 transition count 865
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 300 place count 505 transition count 855
Iterating global reduction 0 with 10 rules applied. Total rules applied 310 place count 505 transition count 855
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 315 place count 500 transition count 850
Iterating global reduction 0 with 5 rules applied. Total rules applied 320 place count 500 transition count 850
Applied a total of 320 rules in 66 ms. Remains 500 /660 variables (removed 160) and now considering 850/1010 (removed 160) transitions.
// Phase 1: matrix 850 rows 500 cols
[2022-05-16 02:16:47] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-16 02:16:47] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 850 rows 500 cols
[2022-05-16 02:16:47] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-16 02:16:47] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
// Phase 1: matrix 850 rows 500 cols
[2022-05-16 02:16:47] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 02:16:48] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 500/660 places, 850/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/660 places, 850/1010 transitions.
[2022-05-16 02:16:48] [INFO ] Flatten gal took : 16 ms
[2022-05-16 02:16:48] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:16:48] [INFO ] Input system was already deterministic with 850 transitions.
[2022-05-16 02:16:48] [INFO ] Flatten gal took : 20 ms
[2022-05-16 02:16:48] [INFO ] Flatten gal took : 25 ms
[2022-05-16 02:16:48] [INFO ] Time to serialize gal into /tmp/CTLFireability7361669812445674004.gal : 4 ms
[2022-05-16 02:16:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14004475943972816222.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7361669812445674004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14004475943972816222.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((((((((((EF(AX(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(TrainState_5_1_1==1...11709
=> equivalent forward existential formula: [FwdG(Init,!((((((((((E(TRUE U !(EX(!(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||...11766
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,29.2778,736076,1,0,18,5.03741e+06,29,10,13070,1.47263e+06,18
FORMULA BART-PT-005-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 10 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:17:18] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 02:17:18] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:17:18] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-16 02:17:18] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:17:18] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-16 02:17:18] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 660/660 places, 1010/1010 transitions.
[2022-05-16 02:17:18] [INFO ] Flatten gal took : 20 ms
[2022-05-16 02:17:18] [INFO ] Flatten gal took : 22 ms
[2022-05-16 02:17:19] [INFO ] Input system was already deterministic with 1010 transitions.
[2022-05-16 02:17:19] [INFO ] Flatten gal took : 22 ms
[2022-05-16 02:17:19] [INFO ] Flatten gal took : 22 ms
[2022-05-16 02:17:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9422438066939842288.gal : 2 ms
[2022-05-16 02:17:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14534268617078654631.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9422438066939842288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14534268617078654631.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((EX(E((((((((((((((((((((TrainState_2_1_32==1)||(TrainState_3_4_28==1))||((TrainState_2_3_13==1)||(TrainState_3_4_16==1)))||(((TrainSt...48325
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(E((((((((((((((((((((TrainState_2_1_32==1)||(TrainState_3_4_28==1))||((TrainState_2_3_...209722
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:181)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:186)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:17:49] [INFO ] Flatten gal took : 43 ms
[2022-05-16 02:17:49] [INFO ] Applying decomposition
[2022-05-16 02:17:49] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10821263946096346265.txt' '-o' '/tmp/graph10821263946096346265.bin' '-w' '/tmp/graph10821263946096346265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10821263946096346265.bin' '-l' '-1' '-v' '-w' '/tmp/graph10821263946096346265.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:17:49] [INFO ] Decomposing Gal with order
[2022-05-16 02:17:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:17:49] [INFO ] Removed a total of 60 redundant transitions.
[2022-05-16 02:17:49] [INFO ] Flatten gal took : 61 ms
[2022-05-16 02:17:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-16 02:17:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13025474285776880004.gal : 6 ms
[2022-05-16 02:17:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1452288415760021534.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13025474285776880004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1452288415760021534.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.25732,11312,226,75,7786,3873,953,10251,232,3057,0


Converting to forward existential form...Done !
original formula: AG((EX(E((((((((((((((((((((i1.i0.i0.u11.TrainState_2_1_32==1)||(i5.i0.i5.u181.TrainState_3_4_28==1))||((i1.i1.i0.u58.TrainState_2_3_13==...72939
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(E((((((((((((((((((((i1.i0.i0.u11.TrainState_2_1_32==1)||(i5.i0.i5.u181.TrainState_3_4...317231
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,6.74473,256088,1,0,380004,303320,15038,1.492e+06,1887,742868,130297
FORMULA BART-PT-005-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 3 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:17:56] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-16 02:17:56] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:17:56] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-16 02:17:57] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:17:57] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-16 02:17:57] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 660/660 places, 1010/1010 transitions.
[2022-05-16 02:17:57] [INFO ] Flatten gal took : 23 ms
[2022-05-16 02:17:57] [INFO ] Flatten gal took : 28 ms
[2022-05-16 02:17:57] [INFO ] Input system was already deterministic with 1010 transitions.
[2022-05-16 02:17:57] [INFO ] Flatten gal took : 27 ms
[2022-05-16 02:17:57] [INFO ] Flatten gal took : 27 ms
[2022-05-16 02:17:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5201770636685472288.gal : 3 ms
[2022-05-16 02:17:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6134409759880735199.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5201770636685472288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6134409759880735199.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(AG(((AX(!((((((((TrainState_1_4_13==1)||(TrainState_4_2_4==1))||((TrainState_3_3_9==1)||(TrainState_4_4_14==1)))||(((TrainState_1_3_7==...39957
=> equivalent forward existential formula: [((Init * !(EG(!((!((((((((((EX(!(E(TRUE U !((((((((((TrainState_1_0_0==1)||(TrainState_3_0_0==1))||((TrainState...69682
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:18:27] [INFO ] Flatten gal took : 43 ms
[2022-05-16 02:18:27] [INFO ] Applying decomposition
[2022-05-16 02:18:27] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15664381232701340427.txt' '-o' '/tmp/graph15664381232701340427.bin' '-w' '/tmp/graph15664381232701340427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15664381232701340427.bin' '-l' '-1' '-v' '-w' '/tmp/graph15664381232701340427.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:18:28] [INFO ] Decomposing Gal with order
[2022-05-16 02:18:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:18:28] [INFO ] Removed a total of 112 redundant transitions.
[2022-05-16 02:18:28] [INFO ] Flatten gal took : 64 ms
[2022-05-16 02:18:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 02:18:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13026399543604335292.gal : 5 ms
[2022-05-16 02:18:28] [INFO ] Time to serialize properties into /tmp/CTLFireability384720335695777169.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13026399543604335292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability384720335695777169.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.209899,11156,319,75,5634,2969,1287,6944,247,2246,0


Converting to forward existential form...Done !
original formula: A(AG(((AX(!((((((((i1.i0.i2.u79.TrainState_1_4_13==1)||(i5.i0.i0.u10.TrainState_4_2_4==1))||((i2.i0.i1.u37.TrainState_3_3_9==1)||(i5.i0.i...58191
=> equivalent forward existential formula: [((Init * !(EG(!((!((((((((((EX(!(E(TRUE U !((((((((((i1.i0.i0.u26.TrainState_1_0_0==1)||(i2.i0.i0.u14.TrainStat...101402
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,7.78169,308008,1,0,501129,188666,12070,2.04667e+06,1587,594768,291158
FORMULA BART-PT-005-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 320 place count 660 transition count 690
Reduce places removed 320 places and 0 transitions.
Iterating post reduction 1 with 320 rules applied. Total rules applied 640 place count 340 transition count 690
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 640 place count 340 transition count 670
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 710 place count 290 transition count 640
Iterating global reduction 2 with 30 rules applied. Total rules applied 740 place count 290 transition count 640
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 745 place count 290 transition count 635
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 765 place count 270 transition count 615
Iterating global reduction 3 with 20 rules applied. Total rules applied 785 place count 270 transition count 615
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 800 place count 255 transition count 600
Iterating global reduction 3 with 15 rules applied. Total rules applied 815 place count 255 transition count 600
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 830 place count 240 transition count 585
Iterating global reduction 3 with 15 rules applied. Total rules applied 845 place count 240 transition count 585
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 855 place count 230 transition count 575
Iterating global reduction 3 with 10 rules applied. Total rules applied 865 place count 230 transition count 575
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 875 place count 220 transition count 565
Iterating global reduction 3 with 10 rules applied. Total rules applied 885 place count 220 transition count 565
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 890 place count 215 transition count 560
Iterating global reduction 3 with 5 rules applied. Total rules applied 895 place count 215 transition count 560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 955 place count 185 transition count 530
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 965 place count 185 transition count 520
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 975 place count 180 transition count 515
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 985 place count 180 transition count 505
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 995 place count 175 transition count 500
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1005 place count 175 transition count 490
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1015 place count 170 transition count 485
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1025 place count 170 transition count 475
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1035 place count 165 transition count 470
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1045 place count 165 transition count 460
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1055 place count 160 transition count 455
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1065 place count 160 transition count 445
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1075 place count 155 transition count 440
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1085 place count 155 transition count 430
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1095 place count 150 transition count 425
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1105 place count 150 transition count 415
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1115 place count 145 transition count 410
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1125 place count 145 transition count 400
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1135 place count 140 transition count 395
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1145 place count 140 transition count 385
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 1155 place count 135 transition count 380
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1165 place count 135 transition count 370
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1175 place count 130 transition count 365
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1185 place count 130 transition count 355
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 1195 place count 125 transition count 350
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 1205 place count 125 transition count 340
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 1215 place count 120 transition count 335
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 1225 place count 120 transition count 325
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 1235 place count 115 transition count 320
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 1245 place count 115 transition count 310
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 18 with 10 rules applied. Total rules applied 1255 place count 110 transition count 305
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 1265 place count 110 transition count 295
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 19 with 10 rules applied. Total rules applied 1275 place count 105 transition count 290
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 1285 place count 105 transition count 280
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 20 with 10 rules applied. Total rules applied 1295 place count 100 transition count 275
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 10 rules applied. Total rules applied 1305 place count 100 transition count 265
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 21 with 10 rules applied. Total rules applied 1315 place count 95 transition count 260
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 21 with 10 rules applied. Total rules applied 1325 place count 95 transition count 250
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 22 with 10 rules applied. Total rules applied 1335 place count 90 transition count 245
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 22 with 10 rules applied. Total rules applied 1345 place count 90 transition count 235
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 23 with 10 rules applied. Total rules applied 1355 place count 85 transition count 230
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 23 with 10 rules applied. Total rules applied 1365 place count 85 transition count 220
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 24 with 10 rules applied. Total rules applied 1375 place count 80 transition count 215
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 24 with 10 rules applied. Total rules applied 1385 place count 80 transition count 205
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 25 with 10 rules applied. Total rules applied 1395 place count 75 transition count 200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 25 with 10 rules applied. Total rules applied 1405 place count 75 transition count 190
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 26 with 10 rules applied. Total rules applied 1415 place count 70 transition count 185
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 26 with 10 rules applied. Total rules applied 1425 place count 70 transition count 175
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 27 with 10 rules applied. Total rules applied 1435 place count 65 transition count 170
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 1445 place count 65 transition count 160
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 28 with 10 rules applied. Total rules applied 1455 place count 60 transition count 155
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 28 with 10 rules applied. Total rules applied 1465 place count 60 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 29 with 10 rules applied. Total rules applied 1475 place count 55 transition count 140
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 29 with 10 rules applied. Total rules applied 1485 place count 55 transition count 130
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 30 with 10 rules applied. Total rules applied 1495 place count 50 transition count 125
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 30 with 10 rules applied. Total rules applied 1505 place count 50 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 31 with 10 rules applied. Total rules applied 1515 place count 45 transition count 110
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 31 with 10 rules applied. Total rules applied 1525 place count 45 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 32 with 10 rules applied. Total rules applied 1535 place count 40 transition count 95
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 32 with 10 rules applied. Total rules applied 1545 place count 40 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 33 with 10 rules applied. Total rules applied 1555 place count 35 transition count 80
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 33 with 10 rules applied. Total rules applied 1565 place count 35 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 34 with 10 rules applied. Total rules applied 1575 place count 30 transition count 65
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 34 with 10 rules applied. Total rules applied 1585 place count 30 transition count 55
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 35 with 10 rules applied. Total rules applied 1595 place count 25 transition count 50
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 35 with 10 rules applied. Total rules applied 1605 place count 25 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 36 with 10 rules applied. Total rules applied 1615 place count 20 transition count 35
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 36 with 15 rules applied. Total rules applied 1630 place count 20 transition count 20
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 37 with 10 rules applied. Total rules applied 1640 place count 15 transition count 15
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 38 with 5 Pre rules applied. Total rules applied 1640 place count 15 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 38 with 10 rules applied. Total rules applied 1650 place count 10 transition count 10
Applied a total of 1650 rules in 131 ms. Remains 10 /660 variables (removed 650) and now considering 10/1010 (removed 1000) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-16 02:18:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 02:18:36] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-16 02:18:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 02:18:36] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-16 02:18:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-16 02:18:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 02:18:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 10/660 places, 10/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/660 places, 10/1010 transitions.
[2022-05-16 02:18:36] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:18:36] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:18:36] [INFO ] Input system was already deterministic with 10 transitions.
[2022-05-16 02:18:36] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:18:36] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:18:36] [INFO ] Time to serialize gal into /tmp/CTLFireability6048281220151615972.gal : 0 ms
[2022-05-16 02:18:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3707410370223443280.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6048281220151615972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3707410370223443280.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(EF((EF(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(TrainState_5_1_1==1))) * EG(...408
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U (E(TRUE U ((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(Tr...464
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/10
(forward)formula 0,1,0.006953,5136,1,0,6,200,30,1,232,97,13
FORMULA BART-PT-005-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 2 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:18:36] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-16 02:18:36] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:18:36] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-16 02:18:36] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
// Phase 1: matrix 1010 rows 660 cols
[2022-05-16 02:18:36] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 02:18:37] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 660/660 places, 1010/1010 transitions.
[2022-05-16 02:18:37] [INFO ] Flatten gal took : 18 ms
[2022-05-16 02:18:37] [INFO ] Flatten gal took : 19 ms
[2022-05-16 02:18:37] [INFO ] Input system was already deterministic with 1010 transitions.
[2022-05-16 02:18:37] [INFO ] Flatten gal took : 19 ms
[2022-05-16 02:18:37] [INFO ] Flatten gal took : 18 ms
[2022-05-16 02:18:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15064477995991119668.gal : 2 ms
[2022-05-16 02:18:37] [INFO ] Time to serialize properties into /tmp/CTLFireability13048582838545811586.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15064477995991119668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13048582838545811586.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AF(AX(!(A((((((((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(((TrainState_5_1_1==1...48385
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(!(!((E(!(EX(((((((((((TrainState_4_1_38==1)||(TrainState_1_1_15==1))||((TrainState_1_1_31==...161568
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:19:07] [INFO ] Flatten gal took : 49 ms
[2022-05-16 02:19:07] [INFO ] Applying decomposition
[2022-05-16 02:19:07] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15653524648648070753.txt' '-o' '/tmp/graph15653524648648070753.bin' '-w' '/tmp/graph15653524648648070753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15653524648648070753.bin' '-l' '-1' '-v' '-w' '/tmp/graph15653524648648070753.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:19:07] [INFO ] Decomposing Gal with order
[2022-05-16 02:19:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:19:07] [INFO ] Removed a total of 121 redundant transitions.
[2022-05-16 02:19:07] [INFO ] Flatten gal took : 81 ms
[2022-05-16 02:19:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 02:19:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11441417680307735131.gal : 6 ms
[2022-05-16 02:19:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2506560429691308266.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11441417680307735131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2506560429691308266.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.257193,11072,362,75,7975,2982,1178,9294,239,2172,0


Converting to forward existential form...Done !
original formula: (AF(AX(!(A((((((((((i6.i1.i0.u3.TrainState_1_1_1==1)||(i0.i0.i0.u12.TrainState_2_1_1==1))||((i3.i0.i0.u0.TrainState_3_1_1==1)||(i1.u1.Tra...70737
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(!(!((E(!(EX(((((((((((i1.u14.TrainState_4_1_38==1)||(i6.i1.i0.u60.TrainState_1_1_15==1))||(...235946
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,2.0215,58708,1,0,88314,36627,11732,242652,1392,51933,173025
FORMULA BART-PT-005-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 453 place count 367 transition count 717
Iterating global reduction 0 with 133 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 606 place count 347 transition count 697
Iterating global reduction 0 with 20 rules applied. Total rules applied 626 place count 347 transition count 697
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 641 place count 332 transition count 682
Iterating global reduction 0 with 15 rules applied. Total rules applied 656 place count 332 transition count 682
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 671 place count 317 transition count 667
Iterating global reduction 0 with 15 rules applied. Total rules applied 686 place count 317 transition count 667
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 701 place count 302 transition count 652
Iterating global reduction 0 with 15 rules applied. Total rules applied 716 place count 302 transition count 652
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 731 place count 287 transition count 637
Iterating global reduction 0 with 15 rules applied. Total rules applied 746 place count 287 transition count 637
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 761 place count 272 transition count 622
Iterating global reduction 0 with 15 rules applied. Total rules applied 776 place count 272 transition count 622
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 786 place count 262 transition count 612
Iterating global reduction 0 with 10 rules applied. Total rules applied 796 place count 262 transition count 612
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 806 place count 252 transition count 602
Iterating global reduction 0 with 10 rules applied. Total rules applied 816 place count 252 transition count 602
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 821 place count 247 transition count 597
Iterating global reduction 0 with 5 rules applied. Total rules applied 826 place count 247 transition count 597
Applied a total of 826 rules in 39 ms. Remains 247 /660 variables (removed 413) and now considering 597/1010 (removed 413) transitions.
// Phase 1: matrix 597 rows 247 cols
[2022-05-16 02:19:10] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 02:19:10] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 597 rows 247 cols
[2022-05-16 02:19:10] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-16 02:19:10] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 597 rows 247 cols
[2022-05-16 02:19:10] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 02:19:10] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 247/660 places, 597/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 247/660 places, 597/1010 transitions.
[2022-05-16 02:19:10] [INFO ] Flatten gal took : 8 ms
[2022-05-16 02:19:10] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:19:10] [INFO ] Input system was already deterministic with 597 transitions.
[2022-05-16 02:19:10] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:19:10] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:19:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6567854464924779878.gal : 1 ms
[2022-05-16 02:19:10] [INFO ] Time to serialize properties into /tmp/CTLFireability2243470875656010321.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6567854464924779878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2243470875656010321.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.94122e+08,0.662573,27552,2,7638,5,162440,6,0,1588,64324,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(((AG((TrainState_3_2_9==1)) + (TrainState_2_2_34==1)) + (TrainState_2_0_0==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(((!(E(TRUE U !((TrainState_3_2_9==1)))) + (TrainState_2_2_34==1)) + (Train...186
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,4.23614,147460,1,0,10,910596,17,2,6360,109610,8
FORMULA BART-PT-005-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 1000 edges and 660 vertex of which 652 / 660 are part of one of the 5 SCC in 7 ms
Free SCC test removed 647 places
Ensure Unique test removed 992 transitions
Reduce isomorphic transitions removed 992 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 11 transition count 15
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 8 place count 9 transition count 13
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 12 place count 7 transition count 11
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 7 transition count 7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 6 transition count 7
Applied a total of 17 rules in 19 ms. Remains 6 /660 variables (removed 654) and now considering 7/1010 (removed 1003) transitions.
// Phase 1: matrix 7 rows 6 cols
[2022-05-16 02:19:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 02:19:14] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-16 02:19:14] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 02:19:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-16 02:19:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-16 02:19:15] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-16 02:19:15] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 6/660 places, 7/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/660 places, 7/1010 transitions.
[2022-05-16 02:19:15] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:15] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:15] [INFO ] Input system was already deterministic with 7 transitions.
[2022-05-16 02:19:15] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:15] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8730223624369727337.gal : 0 ms
[2022-05-16 02:19:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6693281125228766629.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8730223624369727337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6693281125228766629.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,8,0.003484,4356,2,13,5,45,5,0,32,27,0


Converting to forward existential form...Done !
original formula: E(AF((TrainState_1_3_15==1)) U ((TrainState_4_1_15==1) + AG((TrainState_3_1_26==1))))
=> equivalent forward existential formula: ([(FwdU(Init,!(EG(!((TrainState_1_3_15==1))))) * (TrainState_4_1_15==1))] != FALSE + [(FwdU(Init,!(EG(!((TrainSt...226
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.006499,5056,1,0,10,128,28,3,128,93,13
FORMULA BART-PT-005-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 32 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
// Phase 1: matrix 595 rows 245 cols
[2022-05-16 02:19:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 02:19:15] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 595 rows 245 cols
[2022-05-16 02:19:15] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 02:19:15] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 595 rows 245 cols
[2022-05-16 02:19:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 02:19:15] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 245/660 places, 595/1010 transitions.
[2022-05-16 02:19:15] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:19:15] [INFO ] Flatten gal took : 8 ms
[2022-05-16 02:19:15] [INFO ] Input system was already deterministic with 595 transitions.
[2022-05-16 02:19:15] [INFO ] Flatten gal took : 8 ms
[2022-05-16 02:19:15] [INFO ] Flatten gal took : 8 ms
[2022-05-16 02:19:15] [INFO ] Time to serialize gal into /tmp/CTLFireability546255892019294988.gal : 2 ms
[2022-05-16 02:19:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5010436725789366971.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability546255892019294988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5010436725789366971.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(EG(AG(AF((TrainState_2_1_23==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(E(TRUE U !(!(EG(!((TrainState_2_1_23==0))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,4.26341,155340,1,0,7,889447,28,1,6548,151955,9
FORMULA BART-PT-005-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 451 place count 368 transition count 718
Iterating global reduction 0 with 133 rules applied. Total rules applied 584 place count 368 transition count 718
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 604 place count 348 transition count 698
Iterating global reduction 0 with 20 rules applied. Total rules applied 624 place count 348 transition count 698
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 639 place count 333 transition count 683
Iterating global reduction 0 with 15 rules applied. Total rules applied 654 place count 333 transition count 683
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 669 place count 318 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 684 place count 318 transition count 668
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 699 place count 303 transition count 653
Iterating global reduction 0 with 15 rules applied. Total rules applied 714 place count 303 transition count 653
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 729 place count 288 transition count 638
Iterating global reduction 0 with 15 rules applied. Total rules applied 744 place count 288 transition count 638
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 759 place count 273 transition count 623
Iterating global reduction 0 with 15 rules applied. Total rules applied 774 place count 273 transition count 623
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 784 place count 263 transition count 613
Iterating global reduction 0 with 10 rules applied. Total rules applied 794 place count 263 transition count 613
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 804 place count 253 transition count 603
Iterating global reduction 0 with 10 rules applied. Total rules applied 814 place count 253 transition count 603
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 819 place count 248 transition count 598
Iterating global reduction 0 with 5 rules applied. Total rules applied 824 place count 248 transition count 598
Applied a total of 824 rules in 34 ms. Remains 248 /660 variables (removed 412) and now considering 598/1010 (removed 412) transitions.
// Phase 1: matrix 598 rows 248 cols
[2022-05-16 02:19:19] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-16 02:19:19] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 598 rows 248 cols
[2022-05-16 02:19:19] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 02:19:20] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 598 rows 248 cols
[2022-05-16 02:19:20] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-16 02:19:20] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 248/660 places, 598/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 248/660 places, 598/1010 transitions.
[2022-05-16 02:19:20] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:19:20] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:19:20] [INFO ] Input system was already deterministic with 598 transitions.
[2022-05-16 02:19:20] [INFO ] Flatten gal took : 10 ms
[2022-05-16 02:19:20] [INFO ] Flatten gal took : 10 ms
[2022-05-16 02:19:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12104780523477836907.gal : 1 ms
[2022-05-16 02:19:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11490856557154978352.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12104780523477836907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11490856557154978352.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.9977e+08,0.490033,28460,2,7666,5,168477,6,0,1593,65880,0


Converting to forward existential form...Done !
original formula: A((AF(AG((TrainState_1_2_18==1))) + EF(EX((TrainState_1_3_21==1)))) U AX(AF((TrainState_5_1_13==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(EG(!((TrainState_5_1_13==1))))))))))) * !(E(!(!(EX(!(!(EG(!((TrainState_5_1_13==1)))))...316
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,5.15032,172720,1,0,9,1.10093e+06,27,0,6634,192624,15
FORMULA BART-PT-005-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 921 edges and 660 vertex of which 379 / 660 are part of one of the 3 SCC in 3 ms
Free SCC test removed 376 places
Ensure Unique test removed 580 transitions
Reduce isomorphic transitions removed 580 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 283 transition count 298
Reduce places removed 132 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 135 rules applied. Total rules applied 268 place count 151 transition count 295
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 271 place count 148 transition count 295
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 271 place count 148 transition count 286
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 289 place count 139 transition count 286
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 301 place count 127 transition count 274
Iterating global reduction 3 with 12 rules applied. Total rules applied 313 place count 127 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 315 place count 127 transition count 272
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 322 place count 120 transition count 265
Iterating global reduction 4 with 7 rules applied. Total rules applied 329 place count 120 transition count 265
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 334 place count 115 transition count 260
Iterating global reduction 4 with 5 rules applied. Total rules applied 339 place count 115 transition count 260
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 344 place count 110 transition count 255
Iterating global reduction 4 with 5 rules applied. Total rules applied 349 place count 110 transition count 255
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 352 place count 107 transition count 252
Iterating global reduction 4 with 3 rules applied. Total rules applied 355 place count 107 transition count 252
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 358 place count 104 transition count 249
Iterating global reduction 4 with 3 rules applied. Total rules applied 361 place count 104 transition count 249
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 362 place count 103 transition count 248
Iterating global reduction 4 with 1 rules applied. Total rules applied 363 place count 103 transition count 248
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 401 place count 84 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 405 place count 84 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 407 place count 83 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 409 place count 83 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 411 place count 82 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 413 place count 82 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 415 place count 81 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 417 place count 81 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 419 place count 80 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 421 place count 80 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 423 place count 79 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 425 place count 79 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 427 place count 78 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 429 place count 78 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 431 place count 77 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 433 place count 77 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 435 place count 76 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 437 place count 76 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 439 place count 75 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 441 place count 75 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 443 place count 74 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 445 place count 74 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 447 place count 73 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 449 place count 73 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 451 place count 72 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 453 place count 72 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 455 place count 71 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 457 place count 71 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 459 place count 70 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 461 place count 70 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 463 place count 69 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 465 place count 69 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 467 place count 68 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 469 place count 68 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 471 place count 67 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 473 place count 67 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 475 place count 66 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 477 place count 66 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 479 place count 65 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 481 place count 65 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 483 place count 64 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 485 place count 64 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 487 place count 63 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 488 place count 63 transition count 163
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 26 with 66 rules applied. Total rules applied 554 place count 63 transition count 97
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 26 with 15 rules applied. Total rules applied 569 place count 63 transition count 82
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 27 with 16 rules applied. Total rules applied 585 place count 48 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 586 place count 47 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 29 with 1 Pre rules applied. Total rules applied 586 place count 47 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 588 place count 46 transition count 80
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 29 with 7 rules applied. Total rules applied 595 place count 46 transition count 73
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 29 with 7 rules applied. Total rules applied 602 place count 46 transition count 66
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 30 with 7 rules applied. Total rules applied 609 place count 39 transition count 66
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 31 with 2 rules applied. Total rules applied 611 place count 39 transition count 64
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 31 with 1 rules applied. Total rules applied 612 place count 39 transition count 63
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 32 with 2 rules applied. Total rules applied 614 place count 38 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 615 place count 37 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 34 with 1 rules applied. Total rules applied 616 place count 37 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 34 with 1 rules applied. Total rules applied 617 place count 37 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 618 place count 36 transition count 60
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 36 with 3 rules applied. Total rules applied 621 place count 36 transition count 60
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 622 place count 35 transition count 59
Iterating global reduction 36 with 1 rules applied. Total rules applied 623 place count 35 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 624 place count 35 transition count 58
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 37 with 2 rules applied. Total rules applied 626 place count 35 transition count 56
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 37 with 1 rules applied. Total rules applied 627 place count 35 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 38 with 1 rules applied. Total rules applied 628 place count 34 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 39 with 1 rules applied. Total rules applied 629 place count 34 transition count 54
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 39 with 1 rules applied. Total rules applied 630 place count 34 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 40 with 1 rules applied. Total rules applied 631 place count 33 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 41 with 1 rules applied. Total rules applied 632 place count 33 transition count 52
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 41 with 1 rules applied. Total rules applied 633 place count 33 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 42 with 1 rules applied. Total rules applied 634 place count 32 transition count 51
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 43 with 1 rules applied. Total rules applied 635 place count 32 transition count 50
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 43 with 1 rules applied. Total rules applied 636 place count 32 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 44 with 1 rules applied. Total rules applied 637 place count 31 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 45 with 1 rules applied. Total rules applied 638 place count 31 transition count 48
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 45 with 1 rules applied. Total rules applied 639 place count 31 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 46 with 1 rules applied. Total rules applied 640 place count 30 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 47 with 1 rules applied. Total rules applied 641 place count 30 transition count 46
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 47 with 1 rules applied. Total rules applied 642 place count 30 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 643 place count 29 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 49 with 1 rules applied. Total rules applied 644 place count 29 transition count 44
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 49 with 1 rules applied. Total rules applied 645 place count 29 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 50 with 1 rules applied. Total rules applied 646 place count 28 transition count 43
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 51 with 1 rules applied. Total rules applied 647 place count 28 transition count 42
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 51 with 1 rules applied. Total rules applied 648 place count 28 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 52 with 1 rules applied. Total rules applied 649 place count 27 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 53 with 1 rules applied. Total rules applied 650 place count 27 transition count 40
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 53 with 1 rules applied. Total rules applied 651 place count 27 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 54 with 1 rules applied. Total rules applied 652 place count 26 transition count 39
Applied a total of 652 rules in 100 ms. Remains 26 /660 variables (removed 634) and now considering 39/1010 (removed 971) transitions.
// Phase 1: matrix 39 rows 26 cols
[2022-05-16 02:19:25] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 02:19:25] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 39 rows 26 cols
[2022-05-16 02:19:25] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 02:19:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-16 02:19:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 39 rows 26 cols
[2022-05-16 02:19:25] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 02:19:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/660 places, 39/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/660 places, 39/1010 transitions.
[2022-05-16 02:19:25] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:19:25] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:19:25] [INFO ] Input system was already deterministic with 39 transitions.
[2022-05-16 02:19:25] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:19:25] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:19:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6492315600639539896.gal : 1 ms
[2022-05-16 02:19:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9802388258553956070.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6492315600639539896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9802388258553956070.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,512,0.00611,4636,2,49,5,283,5,0,144,203,0


Converting to forward existential form...Done !
original formula: (!(A(((TrainState_2_0_0!=1) + EF(!(EG((TrainState_2_2_27==1))))) U (EF((TrainState_3_2_23==1)) * AF(E((TrainState_3_2_23==1) U (TrainStat...282
=> equivalent forward existential formula: ((([((FwdU(Init,!((E(TRUE U (TrainState_3_2_23==1)) * !(EG(!(E((TrainState_3_2_23==1) U (TrainState_1_2_38==1)))...800
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 36/0/3
Using saturation style SCC detection
(forward)formula 0,1,0.021779,5332,1,0,43,2837,38,37,675,3394,50
FORMULA BART-PT-005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 1001 edges and 660 vertex of which 652 / 660 are part of one of the 5 SCC in 1 ms
Free SCC test removed 647 places
Ensure Unique test removed 992 transitions
Reduce isomorphic transitions removed 992 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 7 transition count 12
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 13 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 6 transition count 8
Applied a total of 15 rules in 4 ms. Remains 6 /660 variables (removed 654) and now considering 8/1010 (removed 1002) transitions.
// Phase 1: matrix 8 rows 6 cols
[2022-05-16 02:19:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:19:25] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-16 02:19:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:19:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-16 02:19:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-16 02:19:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:19:25] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 6/660 places, 8/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/660 places, 8/1010 transitions.
[2022-05-16 02:19:25] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:25] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:25] [INFO ] Input system was already deterministic with 8 transitions.
[2022-05-16 02:19:25] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:25] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:25] [INFO ] Time to serialize gal into /tmp/CTLFireability15479985309773322267.gal : 1 ms
[2022-05-16 02:19:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14070395990472661270.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15479985309773322267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14070395990472661270.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,8,0.002031,4372,2,11,5,44,5,0,33,27,0


Converting to forward existential form...Done !
original formula: EG((EF(AG((TrainState_5_1_37==1))) * EG(((TrainState_5_3_15==0) + AG((TrainState_3_2_7==1))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U !(E(TRUE U !((TrainState_5_1_37==1))))) * EG(((TrainState_5_3_15==0) + !(E(TRUE U !((TrainS...186
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.003643,5072,1,0,9,115,27,0,142,63,12
FORMULA BART-PT-005-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 454 place count 366 transition count 716
Iterating global reduction 0 with 134 rules applied. Total rules applied 588 place count 366 transition count 716
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 607 place count 347 transition count 697
Iterating global reduction 0 with 19 rules applied. Total rules applied 626 place count 347 transition count 697
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 640 place count 333 transition count 683
Iterating global reduction 0 with 14 rules applied. Total rules applied 654 place count 333 transition count 683
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 668 place count 319 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 682 place count 319 transition count 669
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 696 place count 305 transition count 655
Iterating global reduction 0 with 14 rules applied. Total rules applied 710 place count 305 transition count 655
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 724 place count 291 transition count 641
Iterating global reduction 0 with 14 rules applied. Total rules applied 738 place count 291 transition count 641
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 752 place count 277 transition count 627
Iterating global reduction 0 with 14 rules applied. Total rules applied 766 place count 277 transition count 627
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 776 place count 267 transition count 617
Iterating global reduction 0 with 10 rules applied. Total rules applied 786 place count 267 transition count 617
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 796 place count 257 transition count 607
Iterating global reduction 0 with 10 rules applied. Total rules applied 806 place count 257 transition count 607
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 811 place count 252 transition count 602
Iterating global reduction 0 with 5 rules applied. Total rules applied 816 place count 252 transition count 602
Applied a total of 816 rules in 36 ms. Remains 252 /660 variables (removed 408) and now considering 602/1010 (removed 408) transitions.
// Phase 1: matrix 602 rows 252 cols
[2022-05-16 02:19:26] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 02:19:26] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 602 rows 252 cols
[2022-05-16 02:19:26] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 02:19:26] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 252 cols
[2022-05-16 02:19:26] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 02:19:26] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/660 places, 602/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/660 places, 602/1010 transitions.
[2022-05-16 02:19:26] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:19:26] [INFO ] Flatten gal took : 8 ms
[2022-05-16 02:19:26] [INFO ] Input system was already deterministic with 602 transitions.
[2022-05-16 02:19:26] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:19:26] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:19:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3698834698958712729.gal : 1 ms
[2022-05-16 02:19:26] [INFO ] Time to serialize properties into /tmp/CTLFireability10050007780175219520.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3698834698958712729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10050007780175219520.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.22829e+08,0.727038,31880,2,7766,5,193785,6,0,1613,78176,0


Converting to forward existential form...Done !
original formula: E(AG((AF((TrainState_2_0_0==1)) + !(EX(((TrainState_1_1_24==1)||(TrainState_4_4_15==1)))))) U EG((TrainState_4_0_0==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(E(TRUE U !((!(EG(!((TrainState_2_0_0==1)))) + !(EX(((TrainState_1_1_24==1)||(TrainState_4_4_15...200
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 565/0/37
(forward)formula 0,1,6.89913,188044,1,0,13,1.21431e+06,36,5,7260,273602,17
FORMULA BART-PT-005-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 1002 edges and 660 vertex of which 654 / 660 are part of one of the 5 SCC in 1 ms
Free SCC test removed 649 places
Ensure Unique test removed 995 transitions
Reduce isomorphic transitions removed 995 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 8 transition count 11
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 9 place count 6 transition count 9
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 13 place count 4 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 4 transition count 5
Applied a total of 15 rules in 7 ms. Remains 4 /660 variables (removed 656) and now considering 5/1010 (removed 1005) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:19:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:19:33] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:19:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:19:33] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-16 02:19:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:19:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:19:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 4/660 places, 5/1010 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/660 places, 5/1010 transitions.
[2022-05-16 02:19:33] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:33] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:19:33] [INFO ] Input system was already deterministic with 5 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
FORMULA BART-PT-005-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2022-05-16 02:19:33] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:19:33] [INFO ] Flatten gal took : 16 ms
Total runtime 245172 ms.

BK_STOP 1652667573593

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-005, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689500602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-005.tgz
mv BART-PT-005 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.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 ;