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.r102-smll-162075331000034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 11:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 19:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 19:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 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 64K 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 FlexibleBarrier-PT-08a-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621120441739

Running Version 0
[2021-05-15 23:14:04] [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-15 23:14:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 23:14:04] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2021-05-15 23:14:04] [INFO ] Transformed 99 places.
[2021-05-15 23:14:04] [INFO ] Transformed 236 transitions.
[2021-05-15 23:14:04] [INFO ] Found NUPN structural information;
[2021-05-15 23:14:04] [INFO ] Parsed PT model containing 99 places and 236 transitions in 166 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2021-05-15 23:14:04] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 23:14:04] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 23:14:04] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 23:14:04] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 50 transitions
Reduce redundant transitions removed 50 transitions.
Support contains 88 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 186/186 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 99 transition count 178
Applied a total of 8 rules in 22 ms. Remains 99 /99 variables (removed 0) and now considering 178/186 (removed 8) transitions.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:14:05] [INFO ] Computed 10 place invariants in 15 ms
[2021-05-15 23:14:05] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:14:05] [INFO ] Computed 10 place invariants in 10 ms
[2021-05-15 23:14:05] [INFO ] State equation strengthened by 97 read => feed constraints.
[2021-05-15 23:14:05] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:14:05] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-15 23:14:05] [INFO ] Dead Transitions using invariants and state equation in 280 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 178/186 transitions.
[2021-05-15 23:14:06] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 66 ms
FORMULA FlexibleBarrier-PT-08a-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 33 ms
[2021-05-15 23:14:06] [INFO ] Input system was already deterministic with 178 transitions.
Finished random walk after 775 steps, including 0 resets, run visited all 44 properties in 21 ms. (steps per millisecond=36 )
Graph (trivial) has 75 edges and 99 vertex of which 21 / 99 are part of one of the 7 SCC in 5 ms
Free SCC test removed 14 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 49 place count 61 transition count 125
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 70 place count 61 transition count 104
Applied a total of 70 rules in 52 ms. Remains 61 /99 variables (removed 38) and now considering 104/178 (removed 74) transitions.
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 9 ms
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 12 ms
[2021-05-15 23:14:06] [INFO ] Input system was already deterministic with 104 transitions.
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 9 ms
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 8 ms
[2021-05-15 23:14:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7380583422746860425.gal : 5 ms
[2021-05-15 23:14:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17430652895428476970.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/CTLFireability7380583422746860425.gal, -t, CGAL, -ctl, /tmp/CTLFireability17430652895428476970.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/CTLFireability7380583422746860425.gal -t CGAL -ctl /tmp/CTLFireability17430652895428476970.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,7.52954e+06,0.091653,6720,2,383,5,12254,6,0,339,8260,0


Converting to forward existential form...Done !
original formula: AF(AG(EF((((p59==1)||(p92==1))||((p65==1)&&(p98==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U (((p59==1)||(p92==1))||((p65==1)&&(p98==1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.136968,7160,1,0,7,12254,20,0,1628,8260,8
FORMULA FlexibleBarrier-PT-08a-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 30 edges and 99 vertex of which 3 / 99 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 87 transition count 166
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 87 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 85 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 85 transition count 164
Applied a total of 31 rules in 43 ms. Remains 85 /99 variables (removed 14) and now considering 164/178 (removed 14) transitions.
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 23 ms
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 20 ms
[2021-05-15 23:14:06] [INFO ] Input system was already deterministic with 164 transitions.
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 20 ms
[2021-05-15 23:14:06] [INFO ] Flatten gal took : 19 ms
[2021-05-15 23:14:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10826021389012352731.gal : 5 ms
[2021-05-15 23:14:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7000078255309614636.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/CTLFireability10826021389012352731.gal, -t, CGAL, -ctl, /tmp/CTLFireability7000078255309614636.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/CTLFireability10826021389012352731.gal -t CGAL -ctl /tmp/CTLFireability7000078255309614636.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.14998e+08,0.161554,8608,2,671,5,23734,6,0,501,12633,0


Converting to forward existential form...Done !
original formula: E(AF(((((((((A(((((((p80==1)||((p67==1)&&(p98==1)))||(p70==1))||(p73==1))||((p9==1)&&(p98==1)))||(((p35==1)&&(p60==1))&&(p97==1))) U (((((p57==1)&&(p98==1))||(p83==1))||(((p36==1)&&(p59==1))&&(p97==1)))||(p56==1))) * (p8==0)) * (((p34==1)||(p8==1))||((p2==1)&&(p98==1)))) * ((p90==0)||(p97==0))) * ((p7==0)||(p98==0))) * (((p36==0)||(p83==0))||(p97==0))) * (((p60==0)||(p71==0))||(p97==0))) * ((p4==0)||(p98==0))) * (((p23==0)||(p72==0))||(p97==0)))) U AG(((((((((p34==1)||(p13==1))||(p95==1))||(((p48==1)&&(p71==1))&&(p97==1)))||(((p24==1)&&(p59==1))&&(p97==1)))||((p43==1)&&(p98==1)))||(((p60==1)&&(p83==1))&&(p97==1))) + ((((p27==1)||(((p35==1)&&(p48==1))&&(p97==1)))||(((p24==1)&&(p47==1))&&(p97==1))) * ((EG(((((p47==1)&&(p72==1))&&(p97==1))||(p13==1))) + (((((((p82==0)&&(p68==0))&&((p90==0)||(p97==0)))&&((p79==0)||(p98==0)))&&((p35==0)||(p97==0)))&&(((p24==0)||(p59==0))||(p97==0)))&&(((p47==0)||(p72==0))||(p97==0)))) + ((((((p24==1)&&(p59==1))&&(p97==1))||(((p48==1)&&(p59==1))&&(p97==1)))||((p81==1)&&(p98==1)))&&((((p50==1)&&(p98==1))||(((p36==1)&&(p47==1))&&(p97==1)))||(((p23==1)&&(p36==1))&&(p97==1)))))))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((((((((!((E(!((((((p57==1)&&(p98==1))||(p83==1))||(((p36==1)&&(p59==1))&&(p97==1)))||(p56==1))) U (!(((((((p80==1)||((p67==1)&&(p98==1)))||(p70==1))||(p73==1))||((p9==1)&&(p98==1)))||(((p35==1)&&(p60==1))&&(p97==1)))) * !((((((p57==1)&&(p98==1))||(p83==1))||(((p36==1)&&(p59==1))&&(p97==1)))||(p56==1))))) + EG(!((((((p57==1)&&(p98==1))||(p83==1))||(((p36==1)&&(p59==1))&&(p97==1)))||(p56==1)))))) * (p8==0)) * (((p34==1)||(p8==1))||((p2==1)&&(p98==1)))) * ((p90==0)||(p97==0))) * ((p7==0)||(p98==0))) * (((p36==0)||(p83==0))||(p97==0))) * (((p60==0)||(p71==0))||(p97==0))) * ((p4==0)||(p98==0))) * (((p23==0)||(p72==0))||(p97==0))))))) * !(E(TRUE U !(((((((((p34==1)||(p13==1))||(p95==1))||(((p48==1)&&(p71==1))&&(p97==1)))||(((p24==1)&&(p59==1))&&(p97==1)))||((p43==1)&&(p98==1)))||(((p60==1)&&(p83==1))&&(p97==1))) + ((((p27==1)||(((p35==1)&&(p48==1))&&(p97==1)))||(((p24==1)&&(p47==1))&&(p97==1))) * ((EG(((((p47==1)&&(p72==1))&&(p97==1))||(p13==1))) + (((((((p82==0)&&(p68==0))&&((p90==0)||(p97==0)))&&((p79==0)||(p98==0)))&&((p35==0)||(p97==0)))&&(((p24==0)||(p59==0))||(p97==0)))&&(((p47==0)||(p72==0))||(p97==0)))) + ((((((p24==1)&&(p59==1))&&(p97==1))||(((p48==1)&&(p59==1))&&(p97==1)))||((p81==1)&&(p98==1)))&&((((p50==1)&&(p98==1))||(((p36==1)&&(p47==1))&&(p97==1)))||(((p23==1)&&(p36==1))&&(p97==1)))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.421229,13804,1,0,16,55924,26,5,2706,32783,13
FORMULA FlexibleBarrier-PT-08a-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 57 edges and 99 vertex of which 9 / 99 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 75 transition count 151
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 43 place count 75 transition count 145
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 75 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 73 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 73 transition count 143
Applied a total of 50 rules in 81 ms. Remains 73 /99 variables (removed 26) and now considering 143/178 (removed 35) transitions.
[2021-05-15 23:14:07] [INFO ] Flatten gal took : 17 ms
[2021-05-15 23:14:07] [INFO ] Flatten gal took : 17 ms
[2021-05-15 23:14:07] [INFO ] Input system was already deterministic with 143 transitions.
[2021-05-15 23:14:07] [INFO ] Flatten gal took : 17 ms
[2021-05-15 23:14:07] [INFO ] Flatten gal took : 16 ms
[2021-05-15 23:14:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5486284927927196921.gal : 3 ms
[2021-05-15 23:14:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3757221790733256036.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/CTLFireability5486284927927196921.gal, -t, CGAL, -ctl, /tmp/CTLFireability3757221790733256036.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/CTLFireability5486284927927196921.gal -t CGAL -ctl /tmp/CTLFireability3757221790733256036.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,3.1752e+07,0.177244,9108,2,859,5,23786,6,0,430,12958,0


Converting to forward existential form...Done !
original formula: EG((((((((((p96==0)&&(p51==0))&&(p34==0))&&(p82==0))&&(p20==0))&&(((p24==0)||(p95==0))||(p97==0)))&&((p50==0)||(p98==0)))&&((p88==0)||(p98==0)))&&(((p71==0)||(p84==0))||(p97==0))))
=> equivalent forward existential formula: [FwdG(Init,(((((((((p96==0)&&(p51==0))&&(p34==0))&&(p82==0))&&(p20==0))&&(((p24==0)||(p95==0))||(p97==0)))&&((p50==0)||(p98==0)))&&((p88==0)||(p98==0)))&&(((p71==0)||(p84==0))||(p97==0))))] != FALSE
Hit Full ! (commute/partial/dont) 17/452/126
(forward)formula 0,0,0.433269,10724,1,0,7,33698,19,1,2281,13303,9
FORMULA FlexibleBarrier-PT-08a-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-15 23:14:08] [INFO ] Flatten gal took : 21 ms
[2021-05-15 23:14:08] [INFO ] Flatten gal took : 25 ms
[2021-05-15 23:14:08] [INFO ] Applying decomposition
[2021-05-15 23:14:08] [INFO ] Flatten gal took : 18 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/graph4869978860806906267.txt, -o, /tmp/graph4869978860806906267.bin, -w, /tmp/graph4869978860806906267.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/graph4869978860806906267.bin, -l, -1, -v, -w, /tmp/graph4869978860806906267.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 23:14:08] [INFO ] Decomposing Gal with order
[2021-05-15 23:14:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 23:14:08] [INFO ] Removed a total of 168 redundant transitions.
[2021-05-15 23:14:08] [INFO ] Flatten gal took : 139 ms
[2021-05-15 23:14:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 25 ms.
[2021-05-15 23:14:08] [INFO ] Time to serialize gal into /tmp/CTLFireability3265000079000792929.gal : 16 ms
[2021-05-15 23:14:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2892688387523946941.ctl : 14 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/CTLFireability3265000079000792929.gal, -t, CGAL, -ctl, /tmp/CTLFireability2892688387523946941.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/CTLFireability3265000079000792929.gal -t CGAL -ctl /tmp/CTLFireability2892688387523946941.ctl
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.29982e+08,0.068667,5400,62,26,1576,246,279,2031,55,474,0


Converting to forward existential form...Done !
original formula: ((EG(AF(((((((i0.u0.p2==0)||(i1.i1.u12.p98==0))&&(i0.u2.p11==0))&&(((i5.u17.p72==0)||(i7.u23.p95==0))||(i2.u5.p97==0)))&&(((i3.u8.p35==0)||(i2.u14.p60==0))||(i2.u5.p97==0))) + E((((((((((((i0.u1.p7==1)&&(i1.i1.u12.p98==1))||((i5.u15.p62==1)&&(i1.i1.u12.p98==1)))||(((i2.u14.p60==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||(i6.u20.p82==1))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||((i5.u16.p65==1)&&(i1.i1.u12.p98==1)))||(((i5.u17.p72==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||((i0.u1.p6==1)&&(i2.u5.p97==1)))||(i2.u14.p60==1))||(i7.u23.p94==1)) U (((i3.u8.p35==1)||(((i0.u2.p11==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))||(((i0.u2.p11==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1))))))) * !(E((((i1.i1.u13.p53==1)||(i6.u20.p84==1))||(i0.u2.p11==1)) U AG(EF(((((((i0.u2.p12==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))||(((i4.u11.p47==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(i2.u5.p23==1))||(((i3.u8.p36==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))))))) * (EF((i2.u5.p22==1)) + E((((i4.u11.p48==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)) U ((((((((((((((((i3.u7.p29==1)&&(i1.i1.u12.p98==1))||(i3.u7.p32==1))||((i0.u1.p7==1)&&(i1.i1.u12.p98==1)))||(((i2.u14.p60==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(i4.u10.p41==1))||((i0.u0.p4==1)&&(i1.i1.u12.p98==1)))||(i3.u7.p29==1))||(i1.i0.u3.p13==1))||(((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))||(i4.u9.p38==0))||(i1.i1.u12.p98==0)) + AG(((i0.u0.p1==1)||(((i0.u2.p12==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))))) + AX(EF(((((((((((i0.u0.p1==1)||(((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||((i2.u5.p23==1)&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i3.u8.p35==1))&&(i2.u5.p97==1)))||(i7.u21.p87==1))||((i5.u17.p71==1)&&(i2.u5.p97==1)))||((i3.u8.p35==1)&&(i2.u5.p97==1)))||(i7.u22.p89==1))||((i3.u7.p31==1)&&(i1.i1.u12.p98==1)))||(i7.u23.p94==1))))))))
=> equivalent forward existential formula: (([(Init * !(EG(!(EG(!(((((((i0.u0.p2==0)||(i1.i1.u12.p98==0))&&(i0.u2.p11==0))&&(((i5.u17.p72==0)||(i7.u23.p95==0))||(i2.u5.p97==0)))&&(((i3.u8.p35==0)||(i2.u14.p60==0))||(i2.u5.p97==0))) + E((((((((((((i0.u1.p7==1)&&(i1.i1.u12.p98==1))||((i5.u15.p62==1)&&(i1.i1.u12.p98==1)))||(((i2.u14.p60==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||(i6.u20.p82==1))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||((i5.u16.p65==1)&&(i1.i1.u12.p98==1)))||(((i5.u17.p72==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||((i0.u1.p6==1)&&(i2.u5.p97==1)))||(i2.u14.p60==1))||(i7.u23.p94==1)) U (((i3.u8.p35==1)||(((i0.u2.p11==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))||(((i0.u2.p11==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1)))))))))))] = FALSE * [(FwdU(Init,(((i1.i1.u13.p53==1)||(i6.u20.p84==1))||(i0.u2.p11==1))) * !(E(TRUE U !(E(TRUE U ((((((i0.u2.p12==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))||(((i4.u11.p47==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(i2.u5.p23==1))||(((i3.u8.p36==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1))))))))] = FALSE) * [((Init * !(E((((i4.u11.p48==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)) U ((((((((((((((((i3.u7.p29==1)&&(i1.i1.u12.p98==1))||(i3.u7.p32==1))||((i0.u1.p7==1)&&(i1.i1.u12.p98==1)))||(((i2.u14.p60==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(i4.u10.p41==1))||((i0.u0.p4==1)&&(i1.i1.u12.p98==1)))||(i3.u7.p29==1))||(i1.i0.u3.p13==1))||(((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))||(i4.u9.p38==0))||(i1.i1.u12.p98==0)) + !(E(TRUE U !(((i0.u0.p1==1)||(((i0.u2.p12==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))))))) + !(EX(!(E(TRUE U ((((((((((i0.u0.p1==1)||(((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||((i2.u5.p23==1)&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i3.u8.p35==1))&&(i2.u5.p97==1)))||(i7.u21.p87==1))||((i5.u17.p71==1)&&(i2.u5.p97==1)))||((i3.u8.p35==1)&&(i2.u5.p97==1)))||(i7.u22.p89==1))||((i3.u7.p31==1)&&(i1.i1.u12.p98==1)))||(i7.u23.p94==1)))))))))) * !(E(TRUE U (i2.u5.p22==1))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.112071,6428,1,0,1790,430,1056,2579,217,683,4060
FORMULA FlexibleBarrier-PT-08a-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF(((AG(!(EF((((((i0.u1.p7==1)&&(i1.i1.u12.p98==1))||(((i0.u2.p12==1)&&(i2.u5.p23==1))&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||((i4.u11.p47==1)&&(i2.u5.p97==1)))))) * E(((AG((((((i3.u8.p36==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1))||(((i3.u8.p35==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(i2.u14.p58==1))) * ((((((((((i5.u16.p65==1)||(((i2.u5.p24==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i2.u5.p23==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i3.u8.p35==1))&&(i2.u5.p97==1)))||(((i2.u14.p59==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||((i6.u18.p76==1)&&(i1.i1.u12.p98==1)))||(i0.u2.p12==1))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))) * ((((i2.u5.p24==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))||(i7.u23.p94==1))) U EF(((((i3.u8.p34==1)||(((i2.u5.p24==1)&&(i3.u8.p35==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i1.i0.u3.p15==1))))) * !(AX(EX((((i4.u11.p48==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1))))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (!(E(TRUE U !(!(E(TRUE U (((((i0.u1.p7==1)&&(i1.i1.u12.p98==1))||(((i0.u2.p12==1)&&(i2.u5.p23==1))&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||((i4.u11.p47==1)&&(i2.u5.p97==1)))))))) * E(((!(E(TRUE U !((((((i3.u8.p36==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1))||(((i3.u8.p35==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(i2.u14.p58==1))))) * ((((((((((i5.u16.p65==1)||(((i2.u5.p24==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i2.u5.p23==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i3.u8.p35==1))&&(i2.u5.p97==1)))||(((i2.u14.p59==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||((i6.u18.p76==1)&&(i1.i1.u12.p98==1)))||(i0.u2.p12==1))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))) * ((((i2.u5.p24==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))||(i7.u23.p94==1))) U E(TRUE U ((((i3.u8.p34==1)||(((i2.u5.p24==1)&&(i3.u8.p35==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i1.i0.u3.p15==1))))))) * !(EX((((i4.u11.p48==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))))] = FALSE
(forward)formula 1,1,0.142002,6428,1,0,2439,436,1200,3415,223,731,5335
FORMULA FlexibleBarrier-PT-08a-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(AG(EF(((((((((((i3.u8.p35==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1))||((i0.u1.p5==1)&&(i1.i1.u12.p98==1)))||(((i0.u2.p12==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i2.u14.p58==1))||(i1.i0.u3.p13==1))||(i7.u23.p94==1))||(i4.u11.p46==1))||((i3.u6.p28==1)&&(i1.i1.u12.p98==1)))))) * AX(((((((i7.u21.p85==0)&&(((i0.u2.p12==0)||(i6.u20.p83==0))||(i2.u5.p97==0)))&&(i1.i1.u13.p53==0))&&((i5.u17.p71==0)||(i2.u5.p97==0)))&&((i7.u22.p89==0)||(i1.i1.u12.p98==0)))&&(i3.u7.p29==0))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U ((((((((((i3.u8.p35==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1))||((i0.u1.p5==1)&&(i1.i1.u12.p98==1)))||(((i0.u2.p12==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i2.u14.p58==1))||(i1.i0.u3.p13==1))||(i7.u23.p94==1))||(i4.u11.p46==1))||((i3.u6.p28==1)&&(i1.i1.u12.p98==1))))))))] = FALSE * [(EY(Init) * !(((((((i7.u21.p85==0)&&(((i0.u2.p12==0)||(i6.u20.p83==0))||(i2.u5.p97==0)))&&(i1.i1.u13.p53==0))&&((i5.u17.p71==0)||(i2.u5.p97==0)))&&((i7.u22.p89==0)||(i1.i1.u12.p98==0)))&&(i3.u7.p29==0))))] = FALSE)
(forward)formula 2,0,0.167907,6428,1,0,3099,447,1367,4381,237,749,6913
FORMULA FlexibleBarrier-PT-08a-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG((i4.u10.p44==1)) + A(EX((((((i3.u8.p35==0)||(i6.u20.p84==0))||(i2.u5.p97==0))&&(i1.i1.u12.p56==0))&&((i1.i0.u3.p16==0)||(i1.i1.u12.p98==0)))) U ((((((((AX((((((((i3.u8.p35==1)||(i7.u21.p85==1))||(i1.i1.u12.p56==1))||(((i5.u17.p72==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||((i0.u2.p11==1)&&(i2.u5.p97==1)))||(i7.u22.p92==1))) + EF(AG((((((((i0.u1.p5==1)&&(i1.i1.u12.p98==1))||(((i0.u2.p12==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i3.u6.p27==1))||(((i0.u2.p11==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))))) + ((i5.u15.p62==1)&&(i1.i1.u12.p98==1))) + (((i0.u2.p12==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))) + (((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1))) + (i6.u19.p80==1)) + (((i3.u8.p35==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1))) + (((i3.u8.p35==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1))) + (i5.u15.p63==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!(((((((((!(EX(!((((((((i3.u8.p35==1)||(i7.u21.p85==1))||(i1.i1.u12.p56==1))||(((i5.u17.p72==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||((i0.u2.p11==1)&&(i2.u5.p97==1)))||(i7.u22.p92==1))))) + E(TRUE U !(E(TRUE U !((((((((i0.u1.p5==1)&&(i1.i1.u12.p98==1))||(((i0.u2.p12==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i3.u6.p27==1))||(((i0.u2.p11==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))))))) + ((i5.u15.p62==1)&&(i1.i1.u12.p98==1))) + (((i0.u2.p12==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))) + (((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1))) + (i6.u19.p80==1)) + (((i3.u8.p35==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1))) + (((i3.u8.p35==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1))) + (i5.u15.p63==1))) U (!(EX((((((i3.u8.p35==0)||(i6.u20.p84==0))||(i2.u5.p97==0))&&(i1.i1.u12.p56==0))&&((i1.i0.u3.p16==0)||(i1.i1.u12.p98==0))))) * !(((((((((!(EX(!((((((((i3.u8.p35==1)||(i7.u21.p85==1))||(i1.i1.u12.p56==1))||(((i5.u17.p72==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||((i0.u2.p11==1)&&(i2.u5.p97==1)))||(i7.u22.p92==1))))) + E(TRUE U !(E(TRUE U !((((((((i0.u1.p5==1)&&(i1.i1.u12.p98==1))||(((i0.u2.p12==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i3.u6.p27==1))||(((i0.u2.p11==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))))))) + ((i5.u15.p62==1)&&(i1.i1.u12.p98==1))) + (((i0.u2.p12==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))) + (((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1))) + (i6.u19.p80==1)) + (((i3.u8.p35==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1))) + (((i3.u8.p35==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1))) + (i5.u15.p63==1))))) + EG(!(((((((((!(EX(!((((((((i3.u8.p35==1)||(i7.u21.p85==1))||(i1.i1.u12.p56==1))||(((i5.u17.p72==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||((i0.u2.p11==1)&&(i2.u5.p97==1)))||(i7.u22.p92==1))))) + E(TRUE U !(E(TRUE U !((((((((i0.u1.p5==1)&&(i1.i1.u12.p98==1))||(((i0.u2.p12==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i3.u6.p27==1))||(((i0.u2.p11==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))))))) + ((i5.u15.p62==1)&&(i1.i1.u12.p98==1))) + (((i0.u2.p12==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1))) + (((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1))) + (i6.u19.p80==1)) + (((i3.u8.p35==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1))) + (((i3.u8.p35==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1))) + (i5.u15.p63==1)))))))),TRUE) * !((i4.u10.p44==1)))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 3,0,0.690657,20948,1,0,35461,618,1747,60341,280,1444,44544
FORMULA FlexibleBarrier-PT-08a-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((AX(E(((((((((i2.u14.p59==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1))||((i0.u2.p11==1)&&(i2.u5.p97==1)))||(i4.u11.p47==1))||(i4.u11.p46==1))&&(i4.u9.p37==1)) * AF((((((((((((i2.u14.p57==1)&&(i1.i1.u12.p98==1))||(((i2.u14.p60==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||(((i3.u8.p35==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(((i5.u17.p72==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i3.u8.p35==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i4.u10.p41==1))||(i2.u14.p58==1))||(((i2.u14.p60==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1))))) U (((((((((((i7.u22.p90==1)&&(i2.u5.p97==1))||((i7.u23.p95==1)&&(i2.u5.p97==1)))||(i7.u23.p96==1))||(((i2.u5.p24==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||((i6.u18.p74==1)&&(i1.i1.u12.p98==1)))||((i1.i0.u4.p18==1)&&(i2.u5.p97==1)))||(i3.u6.p25==1))||(((i2.u5.p23==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i6.u20.p84==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(i0.u2.p12==1)))) * (((((((((AX(!(AX((((((((i2.u14.p57==1)&&(i1.i1.u12.p98==1))||(((i5.u17.p72==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||(i2.u5.p22==1))||((i3.u6.p26==1)&&(i1.i1.u12.p98==1)))||((i1.i0.u3.p14==1)&&(i1.i1.u12.p98==1)))||(((i0.u2.p11==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))))) + (i7.u23.p96==1)) + (i1.i0.u4.p17==1)) + (i2.u14.p58==1)) + (i2.u14.p60==1)) + (i7.u23.p94==1)) + (((i4.u11.p48==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1))) + ((i6.u18.p74==1)&&(i1.i1.u12.p98==1))) + ((i6.u18.p76==1)&&(i1.i1.u12.p98==1))) + (((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(E(((((((((i2.u14.p59==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1))||((i0.u2.p11==1)&&(i2.u5.p97==1)))||(i4.u11.p47==1))||(i4.u11.p46==1))&&(i4.u9.p37==1)) * !(EG(!((((((((((((i2.u14.p57==1)&&(i1.i1.u12.p98==1))||(((i2.u14.p60==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||(((i3.u8.p35==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(((i5.u17.p72==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i3.u8.p35==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(i4.u10.p41==1))||(i2.u14.p58==1))||(((i2.u14.p60==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1))))))) U (((((((((((i7.u22.p90==1)&&(i2.u5.p97==1))||((i7.u23.p95==1)&&(i2.u5.p97==1)))||(i7.u23.p96==1))||(((i2.u5.p24==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||((i6.u18.p74==1)&&(i1.i1.u12.p98==1)))||((i1.i0.u4.p18==1)&&(i2.u5.p97==1)))||(i3.u6.p25==1))||(((i2.u5.p23==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i6.u20.p84==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(i0.u2.p12==1)))))) * (((((((((!(EX(!(!(!(EX(!((((((((i2.u14.p57==1)&&(i1.i1.u12.p98==1))||(((i5.u17.p72==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||(i2.u5.p22==1))||((i3.u6.p26==1)&&(i1.i1.u12.p98==1)))||((i1.i0.u3.p14==1)&&(i1.i1.u12.p98==1)))||(((i0.u2.p11==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))))))))) + (i7.u23.p96==1)) + (i1.i0.u4.p17==1)) + (i2.u14.p58==1)) + (i2.u14.p60==1)) + (i7.u23.p94==1)) + (((i4.u11.p48==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1))) + ((i6.u18.p74==1)&&(i1.i1.u12.p98==1))) + ((i6.u18.p76==1)&&(i1.i1.u12.p98==1))) + (((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))))] != FALSE
(forward)formula 4,1,9.54225,188060,1,0,287581,702,1889,622920,281,2326,256609
FORMULA FlexibleBarrier-PT-08a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EX(((((((i5.u17.p71==1)||(i0.u2.p10==1))||(((i2.u5.p23==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1)))||((i6.u18.p74==1)&&(i1.i1.u12.p98==1)))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))) U AF(((((((((i7.u21.p85==1)||(i4.u9.p39==1))||(((i4.u11.p48==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i4.u11.p48==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))))
=> equivalent forward existential formula: [(FwdU(Init,EX(((((((i5.u17.p71==1)||(i0.u2.p10==1))||(((i2.u5.p23==1)&&(i4.u11.p48==1))&&(i2.u5.p97==1)))||((i6.u18.p74==1)&&(i1.i1.u12.p98==1)))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1))))) * !(EG(!(((((((((i7.u21.p85==1)||(i4.u9.p39==1))||(((i4.u11.p48==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))||(((i2.u5.p24==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i4.u11.p48==1)&&(i2.u14.p59==1))&&(i2.u5.p97==1)))))))] != FALSE
(forward)formula 5,0,9.56537,188852,1,0,288829,704,1948,625008,281,2331,258297
FORMULA FlexibleBarrier-PT-08a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((((((((((((i3.u8.p34==1)||(i4.u9.p39==1))||(i1.i0.u3.p13==1))||(i1.i0.u3.p15==1))||(((i2.u5.p23==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(((i4.u11.p47==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i5.u17.p72==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||((i6.u19.p78==1)&&(i2.u5.p97==1))) + (AG((((i0.u2.p11==0)||(i2.u14.p60==0))||(i2.u5.p97==0))) * EX((((((((i4.u11.p48==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1))||(i2.u5.p22==1))||(i3.u7.p32==1))||(i0.u0.p1==1))||((i2.u14.p57==1)&&(i1.i1.u12.p98==1)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(((((((((((i3.u8.p34==1)||(i4.u9.p39==1))||(i1.i0.u3.p13==1))||(i1.i0.u3.p15==1))||(((i2.u5.p23==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(((i4.u11.p47==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i5.u17.p72==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||((i6.u19.p78==1)&&(i2.u5.p97==1))))),TRUE) * !((((i0.u2.p11==0)||(i2.u14.p60==0))||(i2.u5.p97==0))))] = FALSE * [((FwdU(Init,TRUE) * !(((((((((((i3.u8.p34==1)||(i4.u9.p39==1))||(i1.i0.u3.p13==1))||(i1.i0.u3.p15==1))||(((i2.u5.p23==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(((i0.u2.p11==1)&&(i2.u14.p60==1))&&(i2.u5.p97==1)))||(((i4.u11.p47==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i5.u17.p72==1)&&(i7.u23.p95==1))&&(i2.u5.p97==1)))||(((i3.u8.p36==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))||((i6.u19.p78==1)&&(i2.u5.p97==1))))) * !(EX((((((((i4.u11.p48==1)&&(i6.u20.p83==1))&&(i2.u5.p97==1))||(i2.u5.p22==1))||(i3.u7.p32==1))||(i0.u0.p1==1))||((i2.u14.p57==1)&&(i1.i1.u12.p98==1))))))] = FALSE)
(forward)formula 6,0,9.57794,189380,1,0,289587,704,1992,626215,281,2331,258910
FORMULA FlexibleBarrier-PT-08a-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(E(((((((((((((i2.u5.p22==1)||(i7.u23.p95==1))||(i3.u8.p36==1))||(i1.i1.u12.p56==1))||(i7.u23.p94==1))||(((i0.u2.p12==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(((i2.u14.p59==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||((i1.i0.u3.p14==1)&&(i1.i1.u12.p98==1)))||((i6.u19.p77==1)&&(i1.i1.u12.p98==1)))||(((i0.u2.p11==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u14.p59==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i4.u11.p47==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1))) U A(((((((((((i3.u8.p36==1)||(i6.u18.p73==1))||(i5.u15.p61==1))||(i1.i0.u3.p13==1))||((i3.u7.p29==1)&&(i1.i1.u12.p98==1)))||((i4.u10.p41==1)&&(i1.i1.u12.p98==1)))||(((i2.u14.p59==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||((i6.u18.p76==1)&&(i1.i1.u12.p98==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1))) U (((i4.u11.p47==1)||(((i3.u8.p35==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1))))))
=> equivalent forward existential formula: [((FwdU(EY(Init),((((((((((((i2.u5.p22==1)||(i7.u23.p95==1))||(i3.u8.p36==1))||(i1.i1.u12.p56==1))||(i7.u23.p94==1))||(((i0.u2.p12==1)&&(i4.u11.p47==1))&&(i2.u5.p97==1)))||(((i2.u14.p59==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||((i1.i0.u3.p14==1)&&(i1.i1.u12.p98==1)))||((i6.u19.p77==1)&&(i1.i1.u12.p98==1)))||(((i0.u2.p11==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u14.p59==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||(((i4.u11.p47==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))) * !(EG(!((((i4.u11.p47==1)||(((i3.u8.p35==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1))))))) * !(E(!((((i4.u11.p47==1)||(((i3.u8.p35==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1)))) U (!(((((((((((i3.u8.p36==1)||(i6.u18.p73==1))||(i5.u15.p61==1))||(i1.i0.u3.p13==1))||((i3.u7.p29==1)&&(i1.i1.u12.p98==1)))||((i4.u10.p41==1)&&(i1.i1.u12.p98==1)))||(((i2.u14.p59==1)&&(i6.u20.p84==1))&&(i2.u5.p97==1)))||((i6.u18.p76==1)&&(i1.i1.u12.p98==1)))||(((i2.u5.p23==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i0.u2.p12==1)&&(i5.u17.p71==1))&&(i2.u5.p97==1)))) * !((((i4.u11.p47==1)||(((i3.u8.p35==1)&&(i5.u17.p72==1))&&(i2.u5.p97==1)))||(((i2.u5.p23==1)&&(i3.u8.p36==1))&&(i2.u5.p97==1))))))))] != FALSE
(forward)formula 7,1,10.5598,207068,1,0,320543,704,2083,686778,281,2336,294330
FORMULA FlexibleBarrier-PT-08a-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(AG(!(EG(((((i5.u15.p62==1)&&(i1.i1.u12.p98==1))||((i2.u5.p21==1)&&(i1.i1.u12.p98==1)))||(((i0.u2.p11==1)&&(i2.u5.p24==1))&&(i2.u5.p97==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(((((i5.u15.p62==1)&&(i1.i1.u12.p98==1))||((i2.u5.p21==1)&&(i1.i1.u12.p98==1)))||(((i0.u2.p11==1)&&(i2.u5.p24==1))&&(i2.u5.p97==1)))))))))] != FALSE
(forward)formula 8,0,10.5653,207596,1,0,320707,704,2107,686984,281,2336,294701
FORMULA FlexibleBarrier-PT-08a-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1621120460339

--------------------
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="FlexibleBarrier-PT-08a"
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 FlexibleBarrier-PT-08a, 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 r102-smll-162075331000034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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