fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037990000396
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for AutoFlight-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16234.344 3345517.00 2974044.00 108953.30 ??????T?????T?F? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990000396.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 AutoFlight-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 48K May 5 16:51 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 AutoFlight-PT-02b-CTLFireability-00
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-01
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-02
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-03
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-04
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-05
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-06
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-07
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-08
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-09
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-10
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-11
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-12
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-13
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-14
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620747807243

Running Version 0
[2021-05-11 15:43:29] [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]
[2021-05-11 15:43:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 15:43:29] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-11 15:43:29] [INFO ] Transformed 206 places.
[2021-05-11 15:43:29] [INFO ] Transformed 204 transitions.
[2021-05-11 15:43:29] [INFO ] Found NUPN structural information;
[2021-05-11 15:43:29] [INFO ] Parsed PT model containing 206 places and 204 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 205 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 204/204 transitions.
Applied a total of 0 rules in 13 ms. Remains 206 /206 variables (removed 0) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 206 cols
[2021-05-11 15:43:29] [INFO ] Computed 16 place invariants in 20 ms
[2021-05-11 15:43:29] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 204 rows 206 cols
[2021-05-11 15:43:29] [INFO ] Computed 16 place invariants in 7 ms
[2021-05-11 15:43:29] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
// Phase 1: matrix 204 rows 206 cols
[2021-05-11 15:43:29] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-11 15:43:29] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 204/204 transitions.
[2021-05-11 15:43:29] [INFO ] Flatten gal took : 50 ms
[2021-05-11 15:43:29] [INFO ] Flatten gal took : 19 ms
[2021-05-11 15:43:30] [INFO ] Input system was already deterministic with 204 transitions.
Incomplete random walk after 100000 steps, including 882 resets, run finished after 346 ms. (steps per millisecond=289 ) properties (out of 108) seen :105
Running SMT prover for 3 properties.
// Phase 1: matrix 204 rows 206 cols
[2021-05-11 15:43:30] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-11 15:43:30] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-11 15:43:30] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-11 15:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:43:30] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-11 15:43:30] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 3 ms to minimize.
[2021-05-11 15:43:30] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2021-05-11 15:43:30] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2021-05-11 15:43:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2021-05-11 15:43:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:43:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-11 15:43:30] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-11 15:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:43:30] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-11 15:43:30] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 2 ms to minimize.
[2021-05-11 15:43:31] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2021-05-11 15:43:31] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2021-05-11 15:43:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 171 ms
[2021-05-11 15:43:31] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-11 15:43:31] [INFO ] Added : 202 causal constraints over 41 iterations in 545 ms. Result :sat
[2021-05-11 15:43:31] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-11 15:43:31] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-11 15:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:43:31] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-11 15:43:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:43:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-11 15:43:31] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-11 15:43:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:43:31] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-11 15:43:31] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2021-05-11 15:43:31] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2021-05-11 15:43:31] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2021-05-11 15:43:32] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2021-05-11 15:43:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 203 ms
[2021-05-11 15:43:32] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-11 15:43:32] [INFO ] Added : 194 causal constraints over 39 iterations in 490 ms. Result :sat
[2021-05-11 15:43:32] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 205 transition count 151
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 63 rules applied. Total rules applied 115 place count 153 transition count 140
Reduce places removed 4 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 127 place count 149 transition count 132
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 136 place count 141 transition count 131
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 136 place count 141 transition count 105
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 188 place count 115 transition count 105
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 201 place count 102 transition count 92
Iterating global reduction 4 with 13 rules applied. Total rules applied 214 place count 102 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 214 place count 102 transition count 90
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 218 place count 100 transition count 90
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 248 place count 85 transition count 75
Applied a total of 248 rules in 50 ms. Remains 85 /206 variables (removed 121) and now considering 75/204 (removed 129) transitions.
[2021-05-11 15:43:32] [INFO ] Flatten gal took : 4 ms
[2021-05-11 15:43:32] [INFO ] Flatten gal took : 10 ms
[2021-05-11 15:43:32] [INFO ] Input system was already deterministic with 75 transitions.
[2021-05-11 15:43:32] [INFO ] Flatten gal took : 5 ms
[2021-05-11 15:43:32] [INFO ] Flatten gal took : 4 ms
[2021-05-11 15:43:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13971169192047950162.gal : 2 ms
[2021-05-11 15:43:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1725181299038672225.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13971169192047950162.gal, -t, CGAL, -ctl, /tmp/CTLFireability1725181299038672225.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13971169192047950162.gal -t CGAL -ctl /tmp/CTLFireability1725181299038672225.ctl --gen-order FOLLOW
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.46023e+07,0.119193,8732,2,3853,5,18203,6,0,413,21855,0


Converting to forward existential form...Done !
original formula: EF(!(E((E((((((p51==1)||(p71==1))||(p180==1))||(p11==1))||((p143==1)&&(p202==1))) U ((((((((p123==1)&&(p193==1))||((p82==1)&&(p140==1)))||(p182==1))||(p203==1))||((p194==1)&&(p202==1)))||(p74==1))||(p28==1))) + !(A(((((((((p19==1)||(p3==1))||(p85==1))||(p73==1))||(p56==1))||(p152==1))||(p28==1))||(p108==1)) U ((((p85==1)&&(p157==1))||(p44==1))||(p46==1))))) U !(AF(((p150==1)&&(p26==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((E((((((p51==1)||(p71==1))||(p180==1))||(p11==1))||((p143==1)&&(p202==1))) U ((((((((p123==1)&&(p193==1))||((p82==1)&&(p140==1)))||(p182==1))||(p203==1))||((p194==1)&&(p202==1)))||(p74==1))||(p28==1))) + !(!((E(!(((((p85==1)&&(p157==1))||(p44==1))||(p46==1))) U (!(((((((((p19==1)||(p3==1))||(p85==1))||(p73==1))||(p56==1))||(p152==1))||(p28==1))||(p108==1))) * !(((((p85==1)&&(p157==1))||(p44==1))||(p46==1))))) + EG(!(((((p85==1)&&(p157==1))||(p44==1))||(p46==1)))))))) U !(!(EG(!(((p150==1)&&(p26==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t10, t13, t21, t33, t35, t37, t38, t39, t40, t46, t47, t55, t56, t61, t70, t72, t73, t74, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/54/21/75
Detected timeout of ITS tools.
[2021-05-11 15:44:02] [INFO ] Flatten gal took : 5 ms
[2021-05-11 15:44:02] [INFO ] Applying decomposition
[2021-05-11 15:44:02] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16614236912966946423.txt, -o, /tmp/graph16614236912966946423.bin, -w, /tmp/graph16614236912966946423.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16614236912966946423.bin, -l, -1, -v, -w, /tmp/graph16614236912966946423.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 15:44:02] [INFO ] Decomposing Gal with order
[2021-05-11 15:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 15:44:02] [INFO ] Removed a total of 14 redundant transitions.
[2021-05-11 15:44:02] [INFO ] Flatten gal took : 47 ms
[2021-05-11 15:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-11 15:44:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15464178795982668545.gal : 16 ms
[2021-05-11 15:44:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17674247679963177062.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15464178795982668545.gal, -t, CGAL, -ctl, /tmp/CTLFireability17674247679963177062.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15464178795982668545.gal -t CGAL -ctl /tmp/CTLFireability17674247679963177062.ctl
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.46023e+07,0.033029,5628,358,27,2382,192,280,2794,55,465,0


Converting to forward existential form...Done !
original formula: EF(!(E((E((((((i7.u6.p51==1)||(i5.u7.p71==1))||(i6.u26.p180==1))||(i0.u1.p11==1))||((i4.u14.p143==1)&&(i9.u30.p202==1))) U ((((((((i8.u13.p123==1)&&(i8.u28.p193==1))||((i2.u10.p82==1)&&(i0.u17.p140==1)))||(i6.u24.p182==1))||(i9.u30.p203==1))||((i9.u29.p194==1)&&(i9.u30.p202==1)))||(i2.u9.p74==1))||(i3.u3.p28==1))) + !(A(((((((((i0.u2.p19==1)||(i9.u0.p3==1))||(i2.u10.p85==1))||(i2.u8.p73==1))||(i7.u6.p56==1))||(i4.u23.p152==1))||(i3.u3.p28==1))||(i8.u12.p108==1)) U ((((i2.u10.p85==1)&&(i2.u20.p157==1))||(i1.u4.p44==1))||(i1.u5.p46==1))))) U !(AF(((i4.u18.p150==1)&&(i3.u3.p26==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((E((((((i7.u6.p51==1)||(i5.u7.p71==1))||(i6.u26.p180==1))||(i0.u1.p11==1))||((i4.u14.p143==1)&&(i9.u30.p202==1))) U ((((((((i8.u13.p123==1)&&(i8.u28.p193==1))||((i2.u10.p82==1)&&(i0.u17.p140==1)))||(i6.u24.p182==1))||(i9.u30.p203==1))||((i9.u29.p194==1)&&(i9.u30.p202==1)))||(i2.u9.p74==1))||(i3.u3.p28==1))) + !(!((E(!(((((i2.u10.p85==1)&&(i2.u20.p157==1))||(i1.u4.p44==1))||(i1.u5.p46==1))) U (!(((((((((i0.u2.p19==1)||(i9.u0.p3==1))||(i2.u10.p85==1))||(i2.u8.p73==1))||(i7.u6.p56==1))||(i4.u23.p152==1))||(i3.u3.p28==1))||(i8.u12.p108==1))) * !(((((i2.u10.p85==1)&&(i2.u20.p157==1))||(i1.u4.p44==1))||(i1.u5.p46==1))))) + EG(!(((((i2.u10.p85==1)&&(i2.u20.p157==1))||(i1.u4.p44==1))||(i1.u5.p46==1)))))))) U !(!(EG(!(((i4.u18.p150==1)&&(i3.u3.p26==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t55, t56, t61, t70, t72, t73, t74, i0.u2.t33, i1.t1, i2.t13, i2.u8.t37, i3.t47, i3.u3.t0, i4.t38, i4.u23.t39, i6.u26.t40, i7.u6.t35, i8.u12.t10, i9.u30.t4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/54/20/74
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,2.26114,98676,1,0,217102,254,1553,257266,249,638,267527
FORMULA AutoFlight-PT-02b-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 171
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 38 rules applied. Total rules applied 70 place count 173 transition count 165
Reduce places removed 1 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 13 rules applied. Total rules applied 83 place count 172 transition count 153
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 96 place count 160 transition count 152
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 96 place count 160 transition count 133
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 134 place count 141 transition count 133
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 143 place count 132 transition count 124
Iterating global reduction 4 with 9 rules applied. Total rules applied 152 place count 132 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 152 place count 132 transition count 123
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 131 transition count 123
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 194 place count 111 transition count 103
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 111 transition count 103
Applied a total of 195 rules in 31 ms. Remains 111 /206 variables (removed 95) and now considering 103/204 (removed 101) transitions.
[2021-05-11 15:44:05] [INFO ] Flatten gal took : 5 ms
[2021-05-11 15:44:05] [INFO ] Flatten gal took : 5 ms
[2021-05-11 15:44:05] [INFO ] Input system was already deterministic with 103 transitions.
[2021-05-11 15:44:05] [INFO ] Flatten gal took : 9 ms
[2021-05-11 15:44:05] [INFO ] Flatten gal took : 5 ms
[2021-05-11 15:44:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14130286839479994531.gal : 2 ms
[2021-05-11 15:44:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3890908432104545819.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14130286839479994531.gal, -t, CGAL, -ctl, /tmp/CTLFireability3890908432104545819.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14130286839479994531.gal -t CGAL -ctl /tmp/CTLFireability3890908432104545819.ctl --gen-order FOLLOW
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.86647e+09,0.49493,22840,2,11537,5,72089,6,0,545,102204,0


Converting to forward existential form...Done !
original formula: A((((EF((((((((((((((p178==1)||(p150==1))||(p45==1))||(p47==1))||(p64==1))||(p101==1))||(p199==1))||(p117==1))||(p86==1))||(p203==1))||(p108==1))||(p205==1))||(p15==1))) * EF(AG(((((((p1==1)||((p165==1)&&(p202==1)))||(p3==1))||(p119==1))||(p70==1))||(p31==1))))) * EG((((((((((((((p129==1)||(p148==1))||(p203==1))||(p136==1))||(p58==1))||(p108==1))||(p70==1))||(p73==1))||(p168==1))||((p27==1)&&(p163==1)))||(p111==1))||(p94==1))||(p15==1)))) * (((p47==1)||((p85==1)&&(p133==1)))||(((((((p65==0)&&(p49==0))&&(p36==0))&&(p84==0))&&(p197==0))&&(p25==0))&&((p76==0)||(p162==0))))) U A(((EF((((p114==1)||(p73==1))||(p88==1))) * (p75==0)) * (p46==0)) U ((((p114==1)||(p167==1))||(p22==1))||(p29==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((((p114==1)||(p167==1))||(p22==1))||(p29==1))) U (!(((E(TRUE U (((p114==1)||(p73==1))||(p88==1))) * (p75==0)) * (p46==0))) * !(((((p114==1)||(p167==1))||(p22==1))||(p29==1))))) + EG(!(((((p114==1)||(p167==1))||(p22==1))||(p29==1)))))))))) * !(E(!(!((E(!(((((p114==1)||(p167==1))||(p22==1))||(p29==1))) U (!(((E(TRUE U (((p114==1)||(p73==1))||(p88==1))) * (p75==0)) * (p46==0))) * !(((((p114==1)||(p167==1))||(p22==1))||(p29==1))))) + EG(!(((((p114==1)||(p167==1))||(p22==1))||(p29==1))))))) U (!((((E(TRUE U (((((((((((((p178==1)||(p150==1))||(p45==1))||(p47==1))||(p64==1))||(p101==1))||(p199==1))||(p117==1))||(p86==1))||(p203==1))||(p108==1))||(p205==1))||(p15==1))) * E(TRUE U !(E(TRUE U !(((((((p1==1)||((p165==1)&&(p202==1)))||(p3==1))||(p119==1))||(p70==1))||(p31==1))))))) * EG((((((((((((((p129==1)||(p148==1))||(p203==1))||(p136==1))||(p58==1))||(p108==1))||(p70==1))||(p73==1))||(p168==1))||((p27==1)&&(p163==1)))||(p111==1))||(p94==1))||(p15==1)))) * (((p47==1)||((p85==1)&&(p133==1)))||(((((((p65==0)&&(p49==0))&&(p36==0))&&(p84==0))&&(p197==0))&&(p25==0))&&((p76==0)||(p162==0)))))) * !(!((E(!(((((p114==1)||(p167==1))||(p22==1))||(p29==1))) U (!(((E(TRUE U (((p114==1)||(p73==1))||(p88==1))) * (p75==0)) * (p46==0))) * !(((((p114==1)||(p167==1))||(p22==1))||(p29==1))))) + EG(!(((((p114==1)||(p167==1))||(p22==1))||(p29==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t9, t13, t15, t19, t21, t25, t28, t36, t46, t59, t60, t62, t67, t69, t76, t79, t85, t86, t87, t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/26/103
Detected timeout of ITS tools.
[2021-05-11 15:44:35] [INFO ] Flatten gal took : 6 ms
[2021-05-11 15:44:35] [INFO ] Applying decomposition
[2021-05-11 15:44:35] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15827954960943206158.txt, -o, /tmp/graph15827954960943206158.bin, -w, /tmp/graph15827954960943206158.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15827954960943206158.bin, -l, -1, -v, -w, /tmp/graph15827954960943206158.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 15:44:35] [INFO ] Decomposing Gal with order
[2021-05-11 15:44:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 15:44:35] [INFO ] Removed a total of 17 redundant transitions.
[2021-05-11 15:44:35] [INFO ] Flatten gal took : 11 ms
[2021-05-11 15:44:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-11 15:44:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11977613855379267860.gal : 2 ms
[2021-05-11 15:44:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8060918012806324059.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11977613855379267860.gal, -t, CGAL, -ctl, /tmp/CTLFireability8060918012806324059.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11977613855379267860.gal -t CGAL -ctl /tmp/CTLFireability8060918012806324059.ctl
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.86647e+09,0.074257,7544,888,33,6035,157,325,8331,56,290,0


Converting to forward existential form...Done !
original formula: A((((EF((((((((((((((i10.i0.u36.p178==1)||(i9.u28.p150==1))||(i2.u5.p45==1))||(i2.u6.p47==1))||(i4.u9.p64==1))||(i6.u15.p101==1))||(i11.u40.p199==1))||(i7.i1.u18.p117==1))||(i5.u12.p86==1))||(i10.i1.u41.p203==1))||(i7.i0.u16.p108==1))||(i10.i1.u42.p205==1))||(i0.u2.p15==1))) * EF(AG(((((((i11.u0.p1==1)||((i12.u32.p165==1)&&(i10.i1.u42.p202==1)))||(i11.u0.p3==1))||(i7.i0.u19.p119==1))||(i4.u9.p70==1))||(i1.u3.p31==1))))) * EG((((((((((((((i9.u21.p129==1)||(i9.u27.p148==1))||(i10.i1.u41.p203==1))||(i8.u24.p136==1))||(i3.u8.p58==1))||(i7.i0.u16.p108==1))||(i4.u9.p70==1))||(i5.u13.p73==1))||(i10.i0.u37.p168==1))||((i1.u3.p27==1)&&(i4.u31.p163==1)))||(i7.i0.u16.p111==1))||(i6.u14.p94==1))||(i0.u2.p15==1)))) * (((i2.u6.p47==1)||((i5.u12.p85==1)&&(i8.u23.p133==1)))||(((((((i4.u9.p65==0)&&(i2.u7.p49==0))&&(i2.u5.p36==0))&&(i5.u10.p84==0))&&(i11.u39.p197==0))&&(i1.u3.p25==0))&&((i5.u11.p76==0)||(i4.u31.p162==0))))) U A(((EF((((i7.i1.u17.p114==1)||(i5.u13.p73==1))||(i5.u13.p88==1))) * (i5.u10.p75==0)) * (i2.u6.p46==0)) U ((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1))) U (!(((E(TRUE U (((i7.i1.u17.p114==1)||(i5.u13.p73==1))||(i5.u13.p88==1))) * (i5.u10.p75==0)) * (i2.u6.p46==0))) * !(((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1))))) + EG(!(((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1)))))))))) * !(E(!(!((E(!(((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1))) U (!(((E(TRUE U (((i7.i1.u17.p114==1)||(i5.u13.p73==1))||(i5.u13.p88==1))) * (i5.u10.p75==0)) * (i2.u6.p46==0))) * !(((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1))))) + EG(!(((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1))))))) U (!((((E(TRUE U (((((((((((((i10.i0.u36.p178==1)||(i9.u28.p150==1))||(i2.u5.p45==1))||(i2.u6.p47==1))||(i4.u9.p64==1))||(i6.u15.p101==1))||(i11.u40.p199==1))||(i7.i1.u18.p117==1))||(i5.u12.p86==1))||(i10.i1.u41.p203==1))||(i7.i0.u16.p108==1))||(i10.i1.u42.p205==1))||(i0.u2.p15==1))) * E(TRUE U !(E(TRUE U !(((((((i11.u0.p1==1)||((i12.u32.p165==1)&&(i10.i1.u42.p202==1)))||(i11.u0.p3==1))||(i7.i0.u19.p119==1))||(i4.u9.p70==1))||(i1.u3.p31==1))))))) * EG((((((((((((((i9.u21.p129==1)||(i9.u27.p148==1))||(i10.i1.u41.p203==1))||(i8.u24.p136==1))||(i3.u8.p58==1))||(i7.i0.u16.p108==1))||(i4.u9.p70==1))||(i5.u13.p73==1))||(i10.i0.u37.p168==1))||((i1.u3.p27==1)&&(i4.u31.p163==1)))||(i7.i0.u16.p111==1))||(i6.u14.p94==1))||(i0.u2.p15==1)))) * (((i2.u6.p47==1)||((i5.u12.p85==1)&&(i8.u23.p133==1)))||(((((((i4.u9.p65==0)&&(i2.u7.p49==0))&&(i2.u5.p36==0))&&(i5.u10.p84==0))&&(i11.u39.p197==0))&&(i1.u3.p25==0))&&((i5.u11.p76==0)||(i4.u31.p162==0)))))) * !(!((E(!(((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1))) U (!(((E(TRUE U (((i7.i1.u17.p114==1)||(i5.u13.p73==1))||(i5.u13.p88==1))) * (i5.u10.p75==0)) * (i2.u6.p46==0))) * !(((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1))))) + EG(!(((((i7.i1.u17.p114==1)||(i12.u33.p167==1))||(i0.u1.p22==1))||(i1.u4.p29==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t79, t85, t86, t100, t101, i0.t46, i0.u2.t87, i1.t0, i2.t36, i2.u5.t1, i2.u5.t59, i3.u8.t60, i4.u9.t2, i5.t28, i5.u10.t3, i5.u10.t62, i6.u14.t4, i7.i0.t25, i7.i0.u19.t21, i9.t67, i9.u21.t19, i10.i0.u36.t13, i10.i1.t9, i11.u39.t69, i12.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/26/103
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 205 transition count 130
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 87 rules applied. Total rules applied 160 place count 132 transition count 116
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 165 place count 128 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 166 place count 127 transition count 115
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 166 place count 127 transition count 87
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 222 place count 99 transition count 87
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 240 place count 81 transition count 69
Iterating global reduction 4 with 18 rules applied. Total rules applied 258 place count 81 transition count 69
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 258 place count 81 transition count 63
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 270 place count 75 transition count 63
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 306 place count 57 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 307 place count 56 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 55 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 308 place count 55 transition count 43
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 310 place count 54 transition count 43
Applied a total of 310 rules in 34 ms. Remains 54 /206 variables (removed 152) and now considering 43/204 (removed 161) transitions.
[2021-05-11 15:45:05] [INFO ] Flatten gal took : 5 ms
[2021-05-11 15:45:05] [INFO ] Flatten gal took : 3 ms
[2021-05-11 15:45:05] [INFO ] Input system was already deterministic with 43 transitions.
[2021-05-11 15:45:05] [INFO ] Flatten gal took : 2 ms
[2021-05-11 15:45:05] [INFO ] Flatten gal took : 14 ms
[2021-05-11 15:45:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8392314261075026524.gal : 0 ms
[2021-05-11 15:45:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10293692797137331604.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8392314261075026524.gal, -t, CGAL, -ctl, /tmp/CTLFireability10293692797137331604.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8392314261075026524.gal -t CGAL -ctl /tmp/CTLFireability10293692797137331604.ctl --gen-order FOLLOW
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,54624,0.014402,4976,2,343,5,2086,6,0,256,1702,0


Converting to forward existential form...Done !
original formula: !(AF(((((((p123==1)&&(p193==1))||((p82==1)&&(p140==1)))||(p169==1))||(p159==1))||(p78==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((((p123==1)&&(p193==1))||((p82==1)&&(p140==1)))||(p169==1))||(p159==1))||(p78==1))))] != FALSE
Hit Full ! (commute/partial/dont) 31/38/12
(forward)formula 0,1,0.061564,7208,1,0,10,14522,20,3,1304,8432,8
FORMULA AutoFlight-PT-02b-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 205 transition count 149
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 62 rules applied. Total rules applied 116 place count 151 transition count 141
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 149 transition count 137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 126 place count 145 transition count 137
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 126 place count 145 transition count 113
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 174 place count 121 transition count 113
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 188 place count 107 transition count 99
Iterating global reduction 4 with 14 rules applied. Total rules applied 202 place count 107 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 107 transition count 98
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 203 place count 107 transition count 95
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 209 place count 104 transition count 95
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 5 with 38 rules applied. Total rules applied 247 place count 85 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 249 place count 84 transition count 76
Applied a total of 249 rules in 47 ms. Remains 84 /206 variables (removed 122) and now considering 76/204 (removed 128) transitions.
[2021-05-11 15:45:05] [INFO ] Flatten gal took : 20 ms
[2021-05-11 15:45:05] [INFO ] Flatten gal took : 3 ms
[2021-05-11 15:45:05] [INFO ] Input system was already deterministic with 76 transitions.
[2021-05-11 15:45:05] [INFO ] Flatten gal took : 16 ms
[2021-05-11 15:45:05] [INFO ] Flatten gal took : 3 ms
[2021-05-11 15:45:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9793157741951974063.gal : 14 ms
[2021-05-11 15:45:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7247472917303713990.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9793157741951974063.gal, -t, CGAL, -ctl, /tmp/CTLFireability7247472917303713990.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9793157741951974063.gal -t CGAL -ctl /tmp/CTLFireability7247472917303713990.ctl --gen-order FOLLOW
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.09231e+07,0.07728,7512,2,3159,5,12856,6,0,412,15374,0


Converting to forward existential form...Done !
original formula: AG((AF(AG(((((((((((p65==1)||(p49==1))||(p1==1))||(p128==1))||(p98==1))||(p85==1))||(p87==1))||(p89==1))||(p58==1))||(p108==1)))) * (E(EF(((((((((((p65==1)||(p166==1))||(p53==1))||(p119==1))||((p16==1)&&(p141==1)))||(p52==1))||(p102==1))||(p73==1))||(p8==1))||(p104==1))) U (((((p167==1)||(p61==1))||(p85==1))||(p105==1))||(p174==1))) + (p42==0))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(!(E(TRUE U !(((((((((((p65==1)||(p49==1))||(p1==1))||(p128==1))||(p98==1))||(p85==1))||(p87==1))||(p89==1))||(p58==1))||(p108==1)))))))] = FALSE * [((FwdU(Init,TRUE) * !((p42==0))) * !(E(E(TRUE U ((((((((((p65==1)||(p166==1))||(p53==1))||(p119==1))||((p16==1)&&(p141==1)))||(p52==1))||(p102==1))||(p73==1))||(p8==1))||(p104==1))) U (((((p167==1)||(p61==1))||(p85==1))||(p105==1))||(p174==1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t10, t12, t13, t14, t21, t25, t26, t28, t37, t40, t56, t57, t68, t69, t70, t71, t72, t73, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/56/20/76
(forward)formula 0,0,5.10909,147584,1,0,263,802852,179,138,2473,1.01048e+06,254
FORMULA AutoFlight-PT-02b-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2021-05-11 15:45:10] [INFO ] Flatten gal took : 10 ms
[2021-05-11 15:45:10] [INFO ] Flatten gal took : 9 ms
[2021-05-11 15:45:11] [INFO ] Applying decomposition
[2021-05-11 15:45:11] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3521576085488302705.txt, -o, /tmp/graph3521576085488302705.bin, -w, /tmp/graph3521576085488302705.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3521576085488302705.bin, -l, -1, -v, -w, /tmp/graph3521576085488302705.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 15:45:11] [INFO ] Decomposing Gal with order
[2021-05-11 15:45:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 15:45:11] [INFO ] Removed a total of 26 redundant transitions.
[2021-05-11 15:45:11] [INFO ] Flatten gal took : 18 ms
[2021-05-11 15:45:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-11 15:45:11] [INFO ] Time to serialize gal into /tmp/CTLFireability13646572060045129626.gal : 4 ms
[2021-05-11 15:45:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14339493490474888799.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13646572060045129626.gal, -t, CGAL, -ctl, /tmp/CTLFireability14339493490474888799.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13646572060045129626.gal -t CGAL -ctl /tmp/CTLFireability14339493490474888799.ctl
No direction supplied, using forward translation only.
Parsed 13 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.61545e+13,0.718473,28508,3574,21,42849,200,481,87651,33,508,0


Converting to forward existential form...Done !
original formula: A(!(EX(EG(E(((((((i13.i0.u12.p31==1)&&(i6.i3.u71.p173==1))||(i13.i0.u9.p23==1))||(i13.i0.u10.p25==1))||(i12.u66.p158==1))||(i13.i0.u11.p30==1)) U ((((((((i3.i0.u28.p64==1)||(i8.i1.u48.p113==1))||((i12.u65.p154==1)&&(i10.i2.u86.p204==1)))||(i5.i2.u35.p73==1))||((i2.i1.u22.p55==1)&&(i0.i2.u21.p142==1)))||(i1.i0.u16.p45==1))||((i1.i1.u17.p46==1)&&(i11.i0.u55.p132==1)))||((i3.i0.u26.p66==1)&&(i13.i1.u69.p164==1))))))) U E((i1.i0.u15.p40==1) U ((((((((((i6.i2.u38.p96==1)||(i11.i0.u60.p144==1))||(i2.i0.u20.p51==1))||(i2.i0.u23.p52==1))||(i2.i0.u23.p57==1))||(i8.i1.u46.p110==1))||(i1.i2.u18.p47==1))||(i5.i0.u31.p78==1))||((i8.i1.u48.p112==1)&&(i9.i1.u80.p192==1)))||((i1.i1.u17.p43==1)&&(i0.i2.u58.p139==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E((i1.i0.u15.p40==1) U ((((((((((i6.i2.u38.p96==1)||(i11.i0.u60.p144==1))||(i2.i0.u20.p51==1))||(i2.i0.u23.p52==1))||(i2.i0.u23.p57==1))||(i8.i1.u46.p110==1))||(i1.i2.u18.p47==1))||(i5.i0.u31.p78==1))||((i8.i1.u48.p112==1)&&(i9.i1.u80.p192==1)))||((i1.i1.u17.p43==1)&&(i0.i2.u58.p139==1)))))))) * !(E(!(E((i1.i0.u15.p40==1) U ((((((((((i6.i2.u38.p96==1)||(i11.i0.u60.p144==1))||(i2.i0.u20.p51==1))||(i2.i0.u23.p52==1))||(i2.i0.u23.p57==1))||(i8.i1.u46.p110==1))||(i1.i2.u18.p47==1))||(i5.i0.u31.p78==1))||((i8.i1.u48.p112==1)&&(i9.i1.u80.p192==1)))||((i1.i1.u17.p43==1)&&(i0.i2.u58.p139==1))))) U (!(!(EX(EG(E(((((((i13.i0.u12.p31==1)&&(i6.i3.u71.p173==1))||(i13.i0.u9.p23==1))||(i13.i0.u10.p25==1))||(i12.u66.p158==1))||(i13.i0.u11.p30==1)) U ((((((((i3.i0.u28.p64==1)||(i8.i1.u48.p113==1))||((i12.u65.p154==1)&&(i10.i2.u86.p204==1)))||(i5.i2.u35.p73==1))||((i2.i1.u22.p55==1)&&(i0.i2.u21.p142==1)))||(i1.i0.u16.p45==1))||((i1.i1.u17.p46==1)&&(i11.i0.u55.p132==1)))||((i3.i0.u26.p66==1)&&(i13.i1.u69.p164==1)))))))) * !(E((i1.i0.u15.p40==1) U ((((((((((i6.i2.u38.p96==1)||(i11.i0.u60.p144==1))||(i2.i0.u20.p51==1))||(i2.i0.u23.p52==1))||(i2.i0.u23.p57==1))||(i8.i1.u46.p110==1))||(i1.i2.u18.p47==1))||(i5.i0.u31.p78==1))||((i8.i1.u48.p112==1)&&(i9.i1.u80.p192==1)))||((i1.i1.u17.p43==1)&&(i0.i2.u58.p139==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t196, t197, t198, t199, i0.i1.t169, i0.i1.u7.t0, i0.i1.u7.t1, i0.i1.u7.t2, i0.i1.u8.t162, i1.t150, i1.i0.t7, i1.i0.t9, i1.i0.u13.t6, i1.i0.u13.t8, i1.i2.u18.t142, i2.i0.t137, i2.i0.u20.t130, i2.i0.u23.t10, i2.i0.u23.t11, i2.i0.u23.t12, i3.i1.t127, i3.i1.u25.t120, i3.i1.u27.t13, i3.i1.u27.t14, i3.i1.u27.t15, i5.t117, i5.i0.t17, i5.i0.t19, i5.i0.u29.t16, i5.i0.u29.t18, i5.i2.u34.t109, i6.i1.t94, i6.i1.u37.t104, i7.t89, i7.i1.t91, i8.i0.t78, i8.i0.u45.t88, i9.t73, i9.i1.t75, i10.i1.t57, i10.i1.u64.t60, i10.i2.u85.t29, i11.i0.t69, i11.i0.u59.t72, i13.i0.t160, i13.i0.u9.t153, i13.i0.u11.t3, i13.i0.u11.t4, i13.i0.u11.t5, i14.u73.t50, i14.u73.t53, i15.i0.t38, i15.i0.u77.t41, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/151/53/204
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2021-05-11 16:05:44] [INFO ] Applying decomposition
[2021-05-11 16:05:44] [INFO ] Flatten gal took : 9 ms
[2021-05-11 16:05:44] [INFO ] Decomposing Gal with order
[2021-05-11 16:05:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 16:05:44] [INFO ] Removed a total of 6 redundant transitions.
[2021-05-11 16:05:44] [INFO ] Flatten gal took : 13 ms
[2021-05-11 16:05:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2021-05-11 16:05:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12009144984262374217.gal : 2 ms
[2021-05-11 16:05:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13073934161574512821.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12009144984262374217.gal, -t, CGAL, -ctl, /tmp/CTLFireability13073934161574512821.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12009144984262374217.gal -t CGAL -ctl /tmp/CTLFireability13073934161574512821.ctl
No direction supplied, using forward translation only.
Parsed 13 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.61545e+13,18.5146,592136,14705,556,712633,1552,350,5.91311e+06,184,10425,0


Converting to forward existential form...Done !
original formula: A(!(EX(EG(E(((((((i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p31==1)&&(i1.i0.i0.u26.p173==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p23==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p25==1))||(i1.i0.i0.i0.u25.p158==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p30==1)) U ((((((((i0.i0.i0.i0.i0.i0.u14.p64==1)||(i0.i0.u18.p113==1))||((i1.i0.i0.i0.u25.p154==1)&&(i1.u28.p204==1)))||(i0.i0.i0.i0.i0.u15.p73==1))||((i0.i0.i0.i0.i0.i0.i0.u13.p55==1)&&(i1.i0.i0.i0.u24.p142==1)))||(i0.i0.i0.i0.i0.i0.i0.i0.u12.p45==1))||((i0.i0.i0.i0.i0.i0.i0.i0.u12.p46==1)&&(i1.i0.i0.i0.u24.p132==1)))||((i0.i0.i0.i0.i0.i0.u14.p66==1)&&(i1.i0.i0.i0.u25.p164==1))))))) U E((i0.i0.i0.i0.i0.i0.i0.i0.u12.p40==1) U ((((((((((i0.i0.i0.i0.u16.p96==1)||(i1.i0.i0.i0.u24.p144==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p51==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p52==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p57==1))||(i0.i0.u18.p110==1))||(i0.i0.i0.i0.i0.i0.i0.i0.u12.p47==1))||(i0.i0.i0.i0.i0.u15.p78==1))||((i0.i0.u18.p112==1)&&(i1.i0.u27.p192==1)))||((i0.i0.i0.i0.i0.i0.i0.i0.u12.p43==1)&&(i1.i0.i0.i0.u24.p139==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E((i0.i0.i0.i0.i0.i0.i0.i0.u12.p40==1) U ((((((((((i0.i0.i0.i0.u16.p96==1)||(i1.i0.i0.i0.u24.p144==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p51==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p52==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p57==1))||(i0.i0.u18.p110==1))||(i0.i0.i0.i0.i0.i0.i0.i0.u12.p47==1))||(i0.i0.i0.i0.i0.u15.p78==1))||((i0.i0.u18.p112==1)&&(i1.i0.u27.p192==1)))||((i0.i0.i0.i0.i0.i0.i0.i0.u12.p43==1)&&(i1.i0.i0.i0.u24.p139==1)))))))) * !(E(!(E((i0.i0.i0.i0.i0.i0.i0.i0.u12.p40==1) U ((((((((((i0.i0.i0.i0.u16.p96==1)||(i1.i0.i0.i0.u24.p144==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p51==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p52==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p57==1))||(i0.i0.u18.p110==1))||(i0.i0.i0.i0.i0.i0.i0.i0.u12.p47==1))||(i0.i0.i0.i0.i0.u15.p78==1))||((i0.i0.u18.p112==1)&&(i1.i0.u27.p192==1)))||((i0.i0.i0.i0.i0.i0.i0.i0.u12.p43==1)&&(i1.i0.i0.i0.u24.p139==1))))) U (!(!(EX(EG(E(((((((i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p31==1)&&(i1.i0.i0.u26.p173==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p23==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p25==1))||(i1.i0.i0.i0.u25.p158==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p30==1)) U ((((((((i0.i0.i0.i0.i0.i0.u14.p64==1)||(i0.i0.u18.p113==1))||((i1.i0.i0.i0.u25.p154==1)&&(i1.u28.p204==1)))||(i0.i0.i0.i0.i0.u15.p73==1))||((i0.i0.i0.i0.i0.i0.i0.u13.p55==1)&&(i1.i0.i0.i0.u24.p142==1)))||(i0.i0.i0.i0.i0.i0.i0.i0.u12.p45==1))||((i0.i0.i0.i0.i0.i0.i0.i0.u12.p46==1)&&(i1.i0.i0.i0.u24.p132==1)))||((i0.i0.i0.i0.i0.i0.u14.p66==1)&&(i1.i0.i0.i0.u25.p164==1)))))))) * !(E((i0.i0.i0.i0.i0.i0.i0.i0.u12.p40==1) U ((((((((((i0.i0.i0.i0.u16.p96==1)||(i1.i0.i0.i0.u24.p144==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p51==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p52==1))||(i0.i0.i0.i0.i0.i0.i0.u13.p57==1))||(i0.i0.u18.p110==1))||(i0.i0.i0.i0.i0.i0.i0.i0.u12.p47==1))||(i0.i0.i0.i0.i0.u15.p78==1))||((i0.i0.u18.p112==1)&&(i1.i0.u27.p192==1)))||((i0.i0.i0.i0.i0.i0.i0.i0.u12.p43==1)&&(i1.i0.i0.i0.u24.p139==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t73, i0.u19.t75, i0.i0.u18.t78, i0.i0.u18.t88, i0.i0.i0.t89, i0.i0.i0.u17.t91, i0.i0.i0.i0.u16.t94, i0.i0.i0.i0.u16.t104, i0.i0.i0.i0.i0.u15.t16, i0.i0.i0.i0.i0.u15.t17, i0.i0.i0.i0.i0.u15.t18, i0.i0.i0.i0.i0.u15.t19, i0.i0.i0.i0.i0.u15.t109, i0.i0.i0.i0.i0.u15.t117, i0.i0.i0.i0.i0.i0.u14.t13, i0.i0.i0.i0.i0.i0.u14.t14, i0.i0.i0.i0.i0.i0.u14.t15, i0.i0.i0.i0.i0.i0.u14.t120, i0.i0.i0.i0.i0.i0.u14.t127, i0.i0.i0.i0.i0.i0.i0.u13.t10, i0.i0.i0.i0.i0.i0.i0.u13.t11, i0.i0.i0.i0.i0.i0.i0.u13.t12, i0.i0.i0.i0.i0.i0.i0.u13.t130, i0.i0.i0.i0.i0.i0.i0.u13.t137, i0.i0.i0.i0.i0.i0.i0.i0.u12.t6, i0.i0.i0.i0.i0.i0.i0.i0.u12.t7, i0.i0.i0.i0.i0.i0.i0.i0.u12.t8, i0.i0.i0.i0.i0.i0.i0.i0.u12.t9, i0.i0.i0.i0.i0.i0.i0.i0.u12.t142, i0.i0.i0.i0.i0.i0.i0.i0.u12.t150, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t0, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t1, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t2, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t162, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t169, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t3, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t4, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t5, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t153, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t160, i1.t196, i1.u28.t29, i1.i0.u27.t38, i1.i0.u27.t41, i1.i0.i0.u26.t50, i1.i0.i0.u26.t53, i1.i0.i0.i0.u24.t69, i1.i0.i0.i0.u24.t72, i1.i0.i0.i0.u25.t57, i1.i0.i0.i0.u25.t60, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/148/50/198
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2021-05-11 16:18:35] [INFO ] Flatten gal took : 9 ms
[2021-05-11 16:18:35] [INFO ] Input system was already deterministic with 204 transitions.
[2021-05-11 16:18:35] [INFO ] Transformed 206 places.
[2021-05-11 16:18:35] [INFO ] Transformed 204 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-11 16:18:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7577395109647448321.gal : 1 ms
[2021-05-11 16:18:35] [INFO ] Time to serialize properties into /tmp/CTLFireability9377729085231357275.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7577395109647448321.gal, -t, CGAL, -ctl, /tmp/CTLFireability9377729085231357275.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7577395109647448321.gal -t CGAL -ctl /tmp/CTLFireability9377729085231357275.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 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.61545e+13,7.45485,212840,2,85205,5,748477,6,0,1030,1.24246e+06,0


Converting to forward existential form...Done !
original formula: A(!(EX(EG(E(((((((p31==1)&&(p173==1))||(p23==1))||(p25==1))||(p158==1))||(p30==1)) U ((((((((p64==1)||(p113==1))||((p154==1)&&(p204==1)))||(p73==1))||((p55==1)&&(p142==1)))||(p45==1))||((p46==1)&&(p132==1)))||((p66==1)&&(p164==1))))))) U E((p40==1) U ((((((((((p96==1)||(p144==1))||(p51==1))||(p52==1))||(p57==1))||(p110==1))||(p47==1))||(p78==1))||((p112==1)&&(p192==1)))||((p43==1)&&(p139==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E((p40==1) U ((((((((((p96==1)||(p144==1))||(p51==1))||(p52==1))||(p57==1))||(p110==1))||(p47==1))||(p78==1))||((p112==1)&&(p192==1)))||((p43==1)&&(p139==1)))))))) * !(E(!(E((p40==1) U ((((((((((p96==1)||(p144==1))||(p51==1))||(p52==1))||(p57==1))||(p110==1))||(p47==1))||(p78==1))||((p112==1)&&(p192==1)))||((p43==1)&&(p139==1))))) U (!(!(EX(EG(E(((((((p31==1)&&(p173==1))||(p23==1))||(p25==1))||(p158==1))||(p30==1)) U ((((((((p64==1)||(p113==1))||((p154==1)&&(p204==1)))||(p73==1))||((p55==1)&&(p142==1)))||(p45==1))||((p46==1)&&(p132==1)))||((p66==1)&&(p164==1)))))))) * !(E((p40==1) U ((((((((((p96==1)||(p144==1))||(p51==1))||(p52==1))||(p57==1))||(p110==1))||(p47==1))||(p78==1))||((p112==1)&&(p192==1)))||((p43==1)&&(p139==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t29, t38, t41, t50, t53, t57, t60, t69, t72, t73, t75, t78, t88, t89, t91, t94, t104, t109, t117, t120, t127, t130, t137, t142, t150, t153, t160, t162, t169, t196, t197, t198, t199, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/151/53/204
Using saturation style SCC detection
Detected timeout of ITS tools.

BK_STOP 1620751152760

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="AutoFlight-PT-02b"
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 AutoFlight-PT-02b, 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 r007-tall-162037990000396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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