About the Execution of ITS-Tools for BART-PT-002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 621.411 | 33843.00 | 55073.00 | 442.30 | TFTFFTTFFTFTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593600754.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BART-PT-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593600754
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 191K Feb 26 04:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 715K Feb 26 04:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 206K Feb 26 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 693K Feb 26 03:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 280K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 156K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 479K Feb 26 04:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 04:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 273K Feb 26 04:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 930K Feb 26 04:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 534K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-002-CTLFireability-00
FORMULA_NAME BART-PT-002-CTLFireability-01
FORMULA_NAME BART-PT-002-CTLFireability-02
FORMULA_NAME BART-PT-002-CTLFireability-03
FORMULA_NAME BART-PT-002-CTLFireability-04
FORMULA_NAME BART-PT-002-CTLFireability-05
FORMULA_NAME BART-PT-002-CTLFireability-06
FORMULA_NAME BART-PT-002-CTLFireability-07
FORMULA_NAME BART-PT-002-CTLFireability-08
FORMULA_NAME BART-PT-002-CTLFireability-09
FORMULA_NAME BART-PT-002-CTLFireability-10
FORMULA_NAME BART-PT-002-CTLFireability-11
FORMULA_NAME BART-PT-002-CTLFireability-12
FORMULA_NAME BART-PT-002-CTLFireability-13
FORMULA_NAME BART-PT-002-CTLFireability-14
FORMULA_NAME BART-PT-002-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678526062815
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-002
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-11 09:14:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 09:14:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:14:25] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-11 09:14:25] [INFO ] Transformed 474 places.
[2023-03-11 09:14:25] [INFO ] Transformed 404 transitions.
[2023-03-11 09:14:25] [INFO ] Found NUPN structural information;
[2023-03-11 09:14:25] [INFO ] Parsed PT model containing 474 places and 404 transitions and 3240 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 264 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 40 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2023-03-11 09:14:25] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 09:14:26] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-11 09:14:26] [INFO ] Invariant cache hit.
[2023-03-11 09:14:26] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-11 09:14:26] [INFO ] Invariant cache hit.
[2023-03-11 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 906 ms. Remains : 264/264 places, 404/404 transitions.
Support contains 264 out of 264 places after structural reductions.
[2023-03-11 09:14:26] [INFO ] Flatten gal took : 56 ms
[2023-03-11 09:14:27] [INFO ] Flatten gal took : 60 ms
[2023-03-11 09:14:27] [INFO ] Input system was already deterministic with 404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 57) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 09:14:28] [INFO ] Invariant cache hit.
[2023-03-11 09:14:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 09:14:29] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA BART-PT-002-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 09:14:29] [INFO ] Flatten gal took : 53 ms
[2023-03-11 09:14:29] [INFO ] Flatten gal took : 56 ms
[2023-03-11 09:14:29] [INFO ] Input system was already deterministic with 404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 2 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2023-03-11 09:14:29] [INFO ] Invariant cache hit.
[2023-03-11 09:14:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 09:14:29] [INFO ] Invariant cache hit.
[2023-03-11 09:14:29] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-11 09:14:29] [INFO ] Invariant cache hit.
[2023-03-11 09:14:30] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 264/264 places, 404/404 transitions.
[2023-03-11 09:14:30] [INFO ] Flatten gal took : 13 ms
[2023-03-11 09:14:30] [INFO ] Flatten gal took : 15 ms
[2023-03-11 09:14:30] [INFO ] Input system was already deterministic with 404 transitions.
[2023-03-11 09:14:30] [INFO ] Flatten gal took : 13 ms
[2023-03-11 09:14:30] [INFO ] Flatten gal took : 13 ms
[2023-03-11 09:14:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1784814420481489003.gal : 9 ms
[2023-03-11 09:14:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4692573628791600496.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1784814420481489003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4692573628791600496.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17424,0.137311,8176,2,1046,5,21923,6,0,1463,18180,0
Converting to forward existential form...Done !
original formula: EX((EF((EG(((TrainState_1_1_1==0)&&(TrainState_2_1_1==0))) + AX((((((((((TrainState_1_1_17==0)&&(TrainState_1_4_17==0))&&((TrainState_1_1...24892
=> equivalent forward existential formula: ((([(FwdU(((FwdU((EY(Init) * E(TRUE U (EG(((TrainState_1_1_1==0)&&(TrainState_2_1_1==0))) + !(EX(!((((((((((Trai...165916
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 88/55126/316
Hit Full ! (commute/partial/dont) 88/55126/316
(forward)formula 0,1,4.4963,131272,1,0,40,1.0076e+06,50,22,11148,348923,41
FORMULA BART-PT-002-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 2 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2023-03-11 09:14:34] [INFO ] Invariant cache hit.
[2023-03-11 09:14:34] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-11 09:14:34] [INFO ] Invariant cache hit.
[2023-03-11 09:14:35] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-11 09:14:35] [INFO ] Invariant cache hit.
[2023-03-11 09:14:35] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 264/264 places, 404/404 transitions.
[2023-03-11 09:14:35] [INFO ] Flatten gal took : 14 ms
[2023-03-11 09:14:35] [INFO ] Flatten gal took : 37 ms
[2023-03-11 09:14:35] [INFO ] Input system was already deterministic with 404 transitions.
[2023-03-11 09:14:35] [INFO ] Flatten gal took : 15 ms
[2023-03-11 09:14:35] [INFO ] Flatten gal took : 24 ms
[2023-03-11 09:14:35] [INFO ] Time to serialize gal into /tmp/CTLFireability18240411944341749333.gal : 2 ms
[2023-03-11 09:14:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17489679035266213260.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18240411944341749333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17489679035266213260.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17424,0.123627,8284,2,1046,5,21923,6,0,1463,18180,0
Converting to forward existential form...Done !
original formula: (EG(E((AG((((((((((TrainState_2_3_30==1)||(TrainState_2_1_19==1))||((TrainState_1_2_22==1)||(TrainState_2_2_19==1)))||(((TrainState_2_2_3...37020
=> equivalent forward existential formula: ([FwdG(Init,E((!(E(TRUE U !((((((((((TrainState_2_3_30==1)||(TrainState_2_1_19==1))||((TrainState_1_2_22==1)||(T...54404
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,4.94243,176864,1,0,166,1.43062e+06,53,147,7998,506438,159
FORMULA BART-PT-002-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 2 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2023-03-11 09:14:40] [INFO ] Invariant cache hit.
[2023-03-11 09:14:40] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-11 09:14:40] [INFO ] Invariant cache hit.
[2023-03-11 09:14:40] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-11 09:14:40] [INFO ] Invariant cache hit.
[2023-03-11 09:14:41] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 264/264 places, 404/404 transitions.
[2023-03-11 09:14:41] [INFO ] Flatten gal took : 10 ms
[2023-03-11 09:14:41] [INFO ] Flatten gal took : 10 ms
[2023-03-11 09:14:41] [INFO ] Input system was already deterministic with 404 transitions.
[2023-03-11 09:14:41] [INFO ] Flatten gal took : 14 ms
[2023-03-11 09:14:41] [INFO ] Flatten gal took : 10 ms
[2023-03-11 09:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13640100056591750375.gal : 2 ms
[2023-03-11 09:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3570431868121887300.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13640100056591750375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3570431868121887300.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17424,0.140806,8296,2,1046,5,21923,6,0,1463,18180,0
Converting to forward existential form...Done !
original formula: AG((AF((E(((TrainState_1_0_0==1)||(TrainState_2_0_0==1)) U ((TrainState_1_1_1==1)||(TrainState_2_1_1==1))) + AX(((((((TrainState_1_2_5==1...8724
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!((E(!(!(E(TRUE U !(((((((((((TrainState_1_1_17==1)||(TrainState_1_4_17==1))||((Train...15974
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 330/0/74
(forward)formula 0,1,2.31397,64724,1,0,17,350650,34,7,7540,214957,21
FORMULA BART-PT-002-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 23 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2023-03-11 09:14:43] [INFO ] Invariant cache hit.
[2023-03-11 09:14:43] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-11 09:14:43] [INFO ] Invariant cache hit.
[2023-03-11 09:14:43] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-11 09:14:43] [INFO ] Invariant cache hit.
[2023-03-11 09:14:44] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 533 ms. Remains : 264/264 places, 404/404 transitions.
[2023-03-11 09:14:44] [INFO ] Flatten gal took : 9 ms
[2023-03-11 09:14:44] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:14:44] [INFO ] Input system was already deterministic with 404 transitions.
[2023-03-11 09:14:44] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:14:44] [INFO ] Flatten gal took : 9 ms
[2023-03-11 09:14:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11412076165466970721.gal : 2 ms
[2023-03-11 09:14:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3517777775742971497.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11412076165466970721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3517777775742971497.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17424,0.119838,8292,2,1046,5,21923,6,0,1463,18180,0
Converting to forward existential form...Done !
original formula: EX(!(E(((TrainState_1_0_0==1)||(TrainState_2_0_0==1)) U A(((TrainState_1_0_0==1)||(TrainState_2_0_0==1)) U ((((((((((TrainState_1_1_17==1...4095
=> equivalent forward existential formula: [(EY(Init) * !(E(((TrainState_1_0_0==1)||(TrainState_2_0_0==1)) U !((E(!(((((((((((TrainState_1_1_17==1)||(Train...12101
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 48/0/356
Hit Full ! (commute/partial/dont) 330/0/74
(forward)formula 0,0,1.73271,53236,1,0,12,346551,30,4,7292,109921,13
FORMULA BART-PT-002-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 52 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2023-03-11 09:14:45] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 09:14:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 09:14:45] [INFO ] Invariant cache hit.
[2023-03-11 09:14:46] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-11 09:14:46] [INFO ] Invariant cache hit.
[2023-03-11 09:14:46] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 98/264 places, 238/404 transitions.
[2023-03-11 09:14:46] [INFO ] Flatten gal took : 25 ms
[2023-03-11 09:14:46] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:46] [INFO ] Input system was already deterministic with 238 transitions.
[2023-03-11 09:14:46] [INFO ] Flatten gal took : 20 ms
[2023-03-11 09:14:46] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9235012677525649758.gal : 5 ms
[2023-03-11 09:14:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11192696098989938392.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9235012677525649758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11192696098989938392.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2401,0.029454,4412,2,384,5,4104,6,0,633,1950,0
Converting to forward existential form...Done !
original formula: AX(AF(EX(EX((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))&&((TrainState_1_0_0==1)||(TrainState_2_0_0==1)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(EX((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))&&((TrainState_1_0_0==1)||(TrainState_2_0_...175
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.15715,10008,1,0,29,35179,16,17,2440,23371,26
FORMULA BART-PT-002-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 88 edges and 264 vertex of which 12 / 264 are part of one of the 2 SCC in 3 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 2 rules applied. Total rules applied 3 place count 254 transition count 392
Reduce places removed 2 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 20 rules applied. Total rules applied 23 place count 252 transition count 374
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 41 place count 234 transition count 374
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 41 place count 234 transition count 370
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 49 place count 230 transition count 370
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 59 place count 220 transition count 360
Iterating global reduction 3 with 10 rules applied. Total rules applied 69 place count 220 transition count 360
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 75 place count 214 transition count 354
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 214 transition count 354
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 87 place count 208 transition count 348
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 208 transition count 348
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 202 transition count 342
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 202 transition count 342
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 198 transition count 338
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 198 transition count 338
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 117 place count 194 transition count 334
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 194 transition count 334
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 192 transition count 332
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 192 transition count 332
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 153 place count 178 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 178 transition count 316
Applied a total of 155 rules in 80 ms. Remains 178 /264 variables (removed 86) and now considering 316/404 (removed 88) transitions.
[2023-03-11 09:14:46] [INFO ] Flow matrix only has 315 transitions (discarded 1 similar events)
// Phase 1: matrix 315 rows 178 cols
[2023-03-11 09:14:46] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 09:14:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 09:14:46] [INFO ] Flow matrix only has 315 transitions (discarded 1 similar events)
[2023-03-11 09:14:46] [INFO ] Invariant cache hit.
[2023-03-11 09:14:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-11 09:14:46] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-11 09:14:46] [INFO ] Flow matrix only has 315 transitions (discarded 1 similar events)
[2023-03-11 09:14:46] [INFO ] Invariant cache hit.
[2023-03-11 09:14:46] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 178/264 places, 316/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 439 ms. Remains : 178/264 places, 316/404 transitions.
[2023-03-11 09:14:46] [INFO ] Flatten gal took : 5 ms
[2023-03-11 09:14:46] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:14:46] [INFO ] Input system was already deterministic with 316 transitions.
[2023-03-11 09:14:46] [INFO ] Flatten gal took : 6 ms
[2023-03-11 09:14:46] [INFO ] Flatten gal took : 6 ms
[2023-03-11 09:14:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5529823657822283290.gal : 1 ms
[2023-03-11 09:14:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3427881262210536277.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5529823657822283290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3427881262210536277.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7921,0.05322,4848,2,355,5,3704,6,0,1029,3040,0
Converting to forward existential form...Done !
original formula: EG((((((((((TrainState_2_3_30==0)&&(TrainState_2_1_19==0))&&((TrainState_1_2_22==0)&&(TrainState_2_2_19==0)))&&(((TrainState_2_2_30==0)&&...4586
=> equivalent forward existential formula: [FwdG(Init,(((((((((TrainState_2_3_30==0)&&(TrainState_2_1_19==0))&&((TrainState_1_2_22==0)&&(TrainState_2_2_19=...4629
Hit Full ! (commute/partial/dont) 2/54776/314
(forward)formula 0,1,0.317419,9996,1,0,5,32175,19,0,5724,3999,8
FORMULA BART-PT-002-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 1 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2023-03-11 09:14:47] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 09:14:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 09:14:47] [INFO ] Invariant cache hit.
[2023-03-11 09:14:47] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-11 09:14:47] [INFO ] Invariant cache hit.
[2023-03-11 09:14:47] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 264/264 places, 404/404 transitions.
[2023-03-11 09:14:47] [INFO ] Flatten gal took : 9 ms
[2023-03-11 09:14:47] [INFO ] Flatten gal took : 11 ms
[2023-03-11 09:14:47] [INFO ] Input system was already deterministic with 404 transitions.
[2023-03-11 09:14:47] [INFO ] Flatten gal took : 11 ms
[2023-03-11 09:14:47] [INFO ] Flatten gal took : 10 ms
[2023-03-11 09:14:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9868333174789477757.gal : 2 ms
[2023-03-11 09:14:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8472275560029811513.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9868333174789477757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8472275560029811513.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17424,0.139619,8296,2,1046,5,21923,6,0,1463,18180,0
Converting to forward existential form...Done !
original formula: AG((!(E(AG((((((((TrainState_1_2_5==1)||(TrainState_1_4_12==1))||((TrainState_2_4_12==1)||(TrainState_1_3_7==1)))||(((TrainState_2_2_5==1...26884
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(!((E(!(EX(EG(((((((TrainState_1_2_5==1)||(TrainState_1_4_12==1))||((TrainState_2_4...34946
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 68/45236/336
Using saturation style SCC detection
(forward)formula 0,0,6.27451,162876,1,0,154,1.33894e+06,55,101,9527,439684,115
FORMULA BART-PT-002-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 400 edges and 264 vertex of which 261 / 264 are part of one of the 2 SCC in 1 ms
Free SCC test removed 259 places
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3 transition count 5
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 6 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 2 transition count 3
Applied a total of 7 rules in 11 ms. Remains 2 /264 variables (removed 262) and now considering 3/404 (removed 401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-11 09:14:54] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 09:14:54] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 09:14:54] [INFO ] Invariant cache hit.
[2023-03-11 09:14:54] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-11 09:14:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:14:54] [INFO ] Invariant cache hit.
[2023-03-11 09:14:54] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 2/264 places, 3/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 100 ms. Remains : 2/264 places, 3/404 transitions.
[2023-03-11 09:14:54] [INFO ] Flatten gal took : 0 ms
[2023-03-11 09:14:54] [INFO ] Flatten gal took : 1 ms
[2023-03-11 09:14:54] [INFO ] Input system was already deterministic with 3 transitions.
[2023-03-11 09:14:54] [INFO ] Flatten gal took : 0 ms
[2023-03-11 09:14:54] [INFO ] Flatten gal took : 0 ms
[2023-03-11 09:14:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10291011272095682663.gal : 0 ms
[2023-03-11 09:14:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11006266874352395982.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10291011272095682663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11006266874352395982.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.001811,3280,2,4,5,12,5,0,12,6,0
Converting to forward existential form...Done !
original formula: AF(AG((TrainState_2_1_31==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((TrainState_2_1_31==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.002402,3596,1,0,5,19,17,1,46,11,10
FORMULA BART-PT-002-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 207 transition count 347
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 207 transition count 347
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 160 place count 161 transition count 301
Iterating global reduction 0 with 46 rules applied. Total rules applied 206 place count 161 transition count 301
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 212 place count 155 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 218 place count 155 transition count 295
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 222 place count 151 transition count 291
Iterating global reduction 0 with 4 rules applied. Total rules applied 226 place count 151 transition count 291
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 230 place count 147 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 234 place count 147 transition count 287
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 238 place count 143 transition count 283
Iterating global reduction 0 with 4 rules applied. Total rules applied 242 place count 143 transition count 283
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 246 place count 139 transition count 279
Iterating global reduction 0 with 4 rules applied. Total rules applied 250 place count 139 transition count 279
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 253 place count 136 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 257 place count 135 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 258 place count 135 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 259 place count 134 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 260 place count 134 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 261 place count 133 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 262 place count 133 transition count 273
Applied a total of 262 rules in 40 ms. Remains 133 /264 variables (removed 131) and now considering 273/404 (removed 131) transitions.
// Phase 1: matrix 273 rows 133 cols
[2023-03-11 09:14:54] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-11 09:14:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 09:14:54] [INFO ] Invariant cache hit.
[2023-03-11 09:14:54] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-11 09:14:54] [INFO ] Invariant cache hit.
[2023-03-11 09:14:54] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/264 places, 273/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 133/264 places, 273/404 transitions.
[2023-03-11 09:14:54] [INFO ] Flatten gal took : 6 ms
[2023-03-11 09:14:54] [INFO ] Flatten gal took : 6 ms
[2023-03-11 09:14:54] [INFO ] Input system was already deterministic with 273 transitions.
[2023-03-11 09:14:54] [INFO ] Flatten gal took : 5 ms
[2023-03-11 09:14:54] [INFO ] Flatten gal took : 5 ms
[2023-03-11 09:14:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4811738993502198626.gal : 1 ms
[2023-03-11 09:14:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8871578307112034263.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4811738993502198626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8871578307112034263.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4410,0.049418,5208,2,526,5,7678,6,0,808,5110,0
Converting to forward existential form...Done !
original formula: (AX(((((((TrainState_2_1_9==0) + EF((TrainState_1_1_8==0))) * (TrainState_2_0_0==0)) * ((TrainState_1_1_34==0)&&(TrainState_2_3_12==1))) ...538
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(((((((TrainState_2_1_9==0) + E(TRUE U (TrainState_1_1_8==0))) * (TrainState_2_0_0==0)) * ...604
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 271/0/2
(forward)formula 0,1,0.251193,11808,1,0,27,50227,45,16,3437,15058,24
FORMULA BART-PT-002-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 402 edges and 264 vertex of which 262 / 264 are part of one of the 2 SCC in 12 ms
Free SCC test removed 260 places
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 399 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 2 transition count 3
Applied a total of 4 rules in 14 ms. Remains 2 /264 variables (removed 262) and now considering 3/404 (removed 401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-11 09:14:54] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 09:14:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 09:14:54] [INFO ] Invariant cache hit.
[2023-03-11 09:14:55] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-11 09:14:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:14:55] [INFO ] Invariant cache hit.
[2023-03-11 09:14:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 2/264 places, 3/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 2/264 places, 3/404 transitions.
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 0 ms
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 1 ms
[2023-03-11 09:14:55] [INFO ] Input system was already deterministic with 3 transitions.
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 1 ms
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 0 ms
[2023-03-11 09:14:55] [INFO ] Time to serialize gal into /tmp/CTLFireability936515941124138306.gal : 3 ms
[2023-03-11 09:14:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14847098158902412556.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability936515941124138306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14847098158902412556.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.002098,3280,2,4,5,12,5,0,12,6,0
Converting to forward existential form...Done !
original formula: AF(AG((TrainState_1_2_14==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((TrainState_1_2_14==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.002664,3596,1,0,5,19,17,1,46,11,10
FORMULA BART-PT-002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 37 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2023-03-11 09:14:55] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 09:14:55] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 09:14:55] [INFO ] Invariant cache hit.
[2023-03-11 09:14:55] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-11 09:14:55] [INFO ] Invariant cache hit.
[2023-03-11 09:14:55] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 98/264 places, 238/404 transitions.
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 5 ms
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 5 ms
[2023-03-11 09:14:55] [INFO ] Input system was already deterministic with 238 transitions.
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:55] [INFO ] Time to serialize gal into /tmp/CTLFireability11898032343298517653.gal : 1 ms
[2023-03-11 09:14:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4056618528627883843.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11898032343298517653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4056618528627883843.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2401,0.028407,4416,2,384,5,4104,6,0,633,1950,0
Converting to forward existential form...Done !
original formula: AG(EX((TrainState_1_1_9==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((TrainState_1_1_9==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.0976,7108,1,0,6,22421,10,0,2338,4222,4
FORMULA BART-PT-002-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 356 edges and 264 vertex of which 114 / 264 are part of one of the 1 SCC in 0 ms
Free SCC test removed 113 places
Ensure Unique test removed 177 transitions
Reduce isomorphic transitions removed 177 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 151 transition count 155
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 149 place count 79 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 76 transition count 151
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 152 place count 76 transition count 146
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 162 place count 71 transition count 146
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 170 place count 63 transition count 138
Iterating global reduction 3 with 8 rules applied. Total rules applied 178 place count 63 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 181 place count 63 transition count 135
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 185 place count 59 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 189 place count 59 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 192 place count 56 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 195 place count 56 transition count 128
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 53 transition count 125
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 53 transition count 125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 51 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 51 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 207 place count 49 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 49 transition count 121
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 210 place count 48 transition count 120
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 48 transition count 120
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 223 place count 42 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 225 place count 42 transition count 112
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 5 with 2 rules applied. Total rules applied 227 place count 41 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 229 place count 41 transition count 109
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 231 place count 40 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 233 place count 40 transition count 106
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 235 place count 39 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 237 place count 39 transition count 103
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 8 with 45 rules applied. Total rules applied 282 place count 39 transition count 58
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 8 with 14 rules applied. Total rules applied 296 place count 39 transition count 44
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 15 rules applied. Total rules applied 311 place count 25 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 312 place count 24 transition count 43
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 319 place count 24 transition count 36
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 11 with 7 rules applied. Total rules applied 326 place count 24 transition count 29
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 333 place count 17 transition count 29
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 337 place count 17 transition count 25
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 13 with 3 rules applied. Total rules applied 340 place count 17 transition count 22
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 4 rules applied. Total rules applied 344 place count 14 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 345 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 347 place count 13 transition count 19
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 16 with 1 rules applied. Total rules applied 348 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 17 with 2 rules applied. Total rules applied 350 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 351 place count 11 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 352 place count 11 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 1 rules applied. Total rules applied 353 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 354 place count 10 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 355 place count 10 transition count 15
Applied a total of 355 rules in 18 ms. Remains 10 /264 variables (removed 254) and now considering 15/404 (removed 389) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-03-11 09:14:55] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 09:14:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 09:14:55] [INFO ] Invariant cache hit.
[2023-03-11 09:14:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-11 09:14:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:14:55] [INFO ] Invariant cache hit.
[2023-03-11 09:14:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 10/264 places, 15/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 10/264 places, 15/404 transitions.
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 1 ms
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 1 ms
[2023-03-11 09:14:55] [INFO ] Input system was already deterministic with 15 transitions.
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 1 ms
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 1 ms
[2023-03-11 09:14:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9811216907174579749.gal : 0 ms
[2023-03-11 09:14:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1839811438782781913.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9811216907174579749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1839811438782781913.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24,0.004223,3364,2,19,5,86,6,0,57,54,0
Converting to forward existential form...Done !
original formula: EG(E(EG((TrainState_2_0_0==1)) U (((TrainState_1_4_15==1) + AG((TrainState_1_2_27==1))) + (AF((TrainState_1_4_23==1)) * (TrainState_2_1_1...164
=> equivalent forward existential formula: [FwdG(Init,E(EG((TrainState_2_0_0==1)) U (((TrainState_1_4_15==1) + !(E(TRUE U !((TrainState_1_2_27==1))))) + (!...225
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.00921,3944,1,0,25,538,41,17,246,490,32
FORMULA BART-PT-002-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 240 place count 140 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 254 place count 134 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 260 place count 134 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 266 place count 128 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 278 place count 122 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 290 place count 116 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 302 place count 110 transition count 250
Iterating global reduction 0 with 6 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 312 place count 106 transition count 246
Iterating global reduction 0 with 4 rules applied. Total rules applied 316 place count 106 transition count 246
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 320 place count 102 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 324 place count 102 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 326 place count 100 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 328 place count 100 transition count 240
Applied a total of 328 rules in 24 ms. Remains 100 /264 variables (removed 164) and now considering 240/404 (removed 164) transitions.
// Phase 1: matrix 240 rows 100 cols
[2023-03-11 09:14:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 09:14:55] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 09:14:55] [INFO ] Invariant cache hit.
[2023-03-11 09:14:55] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-11 09:14:55] [INFO ] Invariant cache hit.
[2023-03-11 09:14:55] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/264 places, 240/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 100/264 places, 240/404 transitions.
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:55] [INFO ] Input system was already deterministic with 240 transitions.
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:55] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9490041590032940082.gal : 12 ms
[2023-03-11 09:14:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11324793973905420533.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9490041590032940082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11324793973905420533.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2499,0.028149,4432,2,392,5,4191,6,0,643,1997,0
Converting to forward existential form...Done !
original formula: EG((EX(((TrainState_2_0_0==0)||(TrainState_1_1_32==1))) + AF((TrainState_1_3_31==0))))
=> equivalent forward existential formula: [FwdG(Init,(EX(((TrainState_2_0_0==0)||(TrainState_1_1_32==1))) + !(EG(!((TrainState_1_3_31==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.103359,7652,1,0,8,22064,22,3,2676,6211,11
FORMULA BART-PT-002-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 177 place count 150 transition count 290
Iterating global reduction 0 with 51 rules applied. Total rules applied 228 place count 150 transition count 290
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 235 place count 143 transition count 283
Iterating global reduction 0 with 7 rules applied. Total rules applied 242 place count 143 transition count 283
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 248 place count 137 transition count 277
Iterating global reduction 0 with 6 rules applied. Total rules applied 254 place count 137 transition count 277
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 260 place count 131 transition count 271
Iterating global reduction 0 with 6 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 272 place count 125 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 278 place count 125 transition count 265
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 284 place count 119 transition count 259
Iterating global reduction 0 with 6 rules applied. Total rules applied 290 place count 119 transition count 259
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 296 place count 113 transition count 253
Iterating global reduction 0 with 6 rules applied. Total rules applied 302 place count 113 transition count 253
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 306 place count 109 transition count 249
Iterating global reduction 0 with 4 rules applied. Total rules applied 310 place count 109 transition count 249
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 313 place count 106 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 316 place count 106 transition count 246
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 318 place count 104 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 320 place count 104 transition count 244
Applied a total of 320 rules in 15 ms. Remains 104 /264 variables (removed 160) and now considering 244/404 (removed 160) transitions.
// Phase 1: matrix 244 rows 104 cols
[2023-03-11 09:14:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 09:14:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 09:14:56] [INFO ] Invariant cache hit.
[2023-03-11 09:14:56] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-11 09:14:56] [INFO ] Invariant cache hit.
[2023-03-11 09:14:56] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/264 places, 244/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 104/264 places, 244/404 transitions.
[2023-03-11 09:14:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:56] [INFO ] Input system was already deterministic with 244 transitions.
[2023-03-11 09:14:56] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:14:56] [INFO ] Flatten gal took : 3 ms
[2023-03-11 09:14:56] [INFO ] Time to serialize gal into /tmp/CTLFireability7793029468703071676.gal : 1 ms
[2023-03-11 09:14:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15971944400738633690.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7793029468703071676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15971944400738633690.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2704,0.033768,4448,2,406,5,4367,6,0,663,2106,0
Converting to forward existential form...Done !
original formula: AX(!(E(AF(!(AG((TrainState_2_1_24==1)))) U (((A((TrainState_2_1_25==1) U (TrainState_2_1_11==1)) + E((TrainState_2_2_16==1) U (TrainState...284
=> equivalent forward existential formula: [(EY(((FwdU(EY(Init),!(EG(!(!(!(E(TRUE U !((TrainState_2_1_24==1))))))))) * ((!((E(!((TrainState_2_1_11==1)) U (...490
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 242/0/2
Hit Full ! (commute/partial/dont) 240/0/4
Hit Full ! (commute/partial/dont) 242/0/2
(forward)formula 0,1,0.159903,9516,1,0,22,31295,60,7,3387,10779,26
FORMULA BART-PT-002-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2023-03-11 09:14:56] [INFO ] Flatten gal took : 11 ms
[2023-03-11 09:14:56] [INFO ] Flatten gal took : 10 ms
Total runtime 31223 ms.
BK_STOP 1678526096658
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-PT-002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BART-PT-002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593600754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-002.tgz
mv BART-PT-002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;