About the Execution of ITS-Tools for RefineWMG-PT-010011
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2661.787 | 1479483.00 | 1497693.00 | 896.60 | FFTFFTFFFTTFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416100634.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 RefineWMG-PT-010011, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416100634
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 10K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 24K 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 RefineWMG-PT-010011-CTLFireability-00
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-01
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-02
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-03
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-04
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-05
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-06
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-07
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-08
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-09
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-10
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-11
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-12
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-13
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-14
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621261748156
Running Version 0
[2021-05-17 14:29:09] [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-17 14:29:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:29:09] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-17 14:29:09] [INFO ] Transformed 54 places.
[2021-05-17 14:29:09] [INFO ] Transformed 43 transitions.
[2021-05-17 14:29:09] [INFO ] Parsed PT model containing 54 places and 43 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:10] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-17 14:29:10] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:10] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:10] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:10] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:29:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
[2021-05-17 14:29:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-17 14:29:10] [INFO ] Flatten gal took : 25 ms
FORMULA RefineWMG-PT-010011-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:29:10] [INFO ] Flatten gal took : 9 ms
[2021-05-17 14:29:10] [INFO ] Input system was already deterministic with 43 transitions.
Incomplete random walk after 100001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=558 ) properties (out of 113) seen :90
Running SMT prover for 23 properties.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:10] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2021-05-17 14:29:10] [INFO ] SMT Verify possible in real domain returnedunsat :23 sat :0 real:0
Successfully simplified 23 atomic propositions for a total of 14 simplifications.
[2021-05-17 14:29:10] [INFO ] Initial state test concluded for 1 properties.
FORMULA RefineWMG-PT-010011-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Graph (trivial) has 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 2 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 36 place count 18 transition count 17
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 43 place count 18 transition count 10
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 10 transition count 9
Applied a total of 52 rules in 13 ms. Remains 10 /54 variables (removed 44) and now considering 9/43 (removed 34) transitions.
[2021-05-17 14:29:10] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:29:10] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:29:10] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
FORMULA RefineWMG-PT-010011-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (trivial) has 12 edges and 54 vertex of which 8 / 54 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 36
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 38 transition count 32
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 16 place count 38 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 36 transition count 30
Applied a total of 20 rules in 4 ms. Remains 36 /54 variables (removed 18) and now considering 30/43 (removed 13) transitions.
[2021-05-17 14:29:10] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:29:10] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:29:10] [INFO ] Input system was already deterministic with 30 transitions.
[2021-05-17 14:29:10] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:29:10] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:29:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9292564554466626130.gal : 1 ms
[2021-05-17 14:29:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15368449123186351009.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/CTLFireability9292564554466626130.gal, -t, CGAL, -ctl, /tmp/CTLFireability15368449123186351009.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/CTLFireability9292564554466626130.gal -t CGAL -ctl /tmp/CTLFireability15368449123186351009.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,6.12001e+17,0.18992,12332,2,1238,5,44507,5,0,175,54439,0
Converting to forward existential form...Done !
original formula: !(AG(((AF(((((((p>=1)&&(p48>=1))&&(p49>=1))||(p15>=1))||(p47>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1)))) + !(EF(((p20>=1)||(((p23>=1)&&(p24>=1))&&(p26>=1)))))) + !(AG((p15>=1))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(!(!(E(TRUE U !((p15>=1))))))) * !(!(EG(!(((((((p>=1)&&(p48>=1))&&(p49>=1))||(p15>=1))||(p47>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1)))))))),TRUE) * ((p20>=1)||(((p23>=1)&&(p24>=1))&&(p26>=1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.261529,12716,1,0,9,44507,24,0,1154,54439,10
FORMULA RefineWMG-PT-010011-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2021-05-17 14:29:11] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:29:11] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:29:11] [INFO ] Input system was already deterministic with 43 transitions.
[2021-05-17 14:29:11] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:29:11] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:29:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5718354801444114796.gal : 2 ms
[2021-05-17 14:29:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3528580969023024863.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/CTLFireability5718354801444114796.gal, -t, CGAL, -ctl, /tmp/CTLFireability3528580969023024863.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/CTLFireability5718354801444114796.gal -t CGAL -ctl /tmp/CTLFireability3528580969023024863.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.32033e+26,0.337829,19120,2,1995,5,80417,6,0,262,99438,0
Converting to forward existential form...Done !
original formula: AG(EF((AG(((((((((((p14>=1)||(((p>=1)&&(p48>=1))&&(p49>=1)))||(p32>=1))||(p4>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))||(p20>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p9>=1))||(p12>=1))) + ((!(EG(((((((((p30>=1)||(p47>=1))||(p19>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))||(p40>=1))||(p42>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1)))||(p44>=1)))) * (((((((((!(E(((((((((((((p33>=1)&&(p34>=1))&&(p36>=1))||(((p43>=1)&&(p44>=1))&&(p46>=1)))||(p47>=1))||(p32>=1))||(p17>=1))||(p35>=1))||(p22>=1))||(p40>=1))||(p25>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1))) U ((p45>=1)||(p15>=1)))) + (p30>=1)) + (p2>=1)) + (p4>=1)) + (p37>=1)) + (p42>=1)) + (p10>=1)) + (((p>=1)&&(p48>=1))&&(p49>=1))) + (((p43>=1)&&(p44>=1))&&(p46>=1))) + (((p23>=1)&&(p24>=1))&&(p26>=1)))) * (((((((p45<1)&&(p49<1))&&(p37<1))&&(p39<1))&&(((p8<1)||(p9<1))||(p11<1)))&&(((p13<1)||(p14<1))||(p16<1)))||(((((p34<1)&&(p50<1))&&(p2<1))&&(p35<1))&&((pprime<2)||(psecond<2))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(E(TRUE U !(((((((((((p14>=1)||(((p>=1)&&(p48>=1))&&(p49>=1)))||(p32>=1))||(p4>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))||(p20>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p9>=1))||(p12>=1))))) + ((!(EG(((((((((p30>=1)||(p47>=1))||(p19>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))||(p40>=1))||(p42>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1)))||(p44>=1)))) * (((((((((!(E(((((((((((((p33>=1)&&(p34>=1))&&(p36>=1))||(((p43>=1)&&(p44>=1))&&(p46>=1)))||(p47>=1))||(p32>=1))||(p17>=1))||(p35>=1))||(p22>=1))||(p40>=1))||(p25>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1))) U ((p45>=1)||(p15>=1)))) + (p30>=1)) + (p2>=1)) + (p4>=1)) + (p37>=1)) + (p42>=1)) + (p10>=1)) + (((p>=1)&&(p48>=1))&&(p49>=1))) + (((p43>=1)&&(p44>=1))&&(p46>=1))) + (((p23>=1)&&(p24>=1))&&(p26>=1)))) * (((((((p45<1)&&(p49<1))&&(p37<1))&&(p39<1))&&(((p8<1)||(p9<1))||(p11<1)))&&(((p13<1)||(p14<1))||(p16<1)))||(((((p34<1)&&(p50<1))&&(p2<1))&&(p35<1))&&((pprime<2)||(psecond<2)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 20/0/23
(forward)formula 0,0,0.702005,26120,1,0,32,138529,42,13,1895,114875,23
FORMULA RefineWMG-PT-010011-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 16 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 51 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 7 transition count 6
Applied a total of 55 rules in 4 ms. Remains 7 /54 variables (removed 47) and now considering 6/43 (removed 37) transitions.
[2021-05-17 14:29:11] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:29:11] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:29:11] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
FORMULA RefineWMG-PT-010011-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-17 14:29:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-17 14:29:11] [INFO ] Flatten gal took : 5 ms
FORMULA RefineWMG-PT-010011-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:29:11] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:29:12] [INFO ] Applying decomposition
[2021-05-17 14:29:12] [INFO ] Flatten gal took : 3 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/graph11541046892625478669.txt, -o, /tmp/graph11541046892625478669.bin, -w, /tmp/graph11541046892625478669.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/graph11541046892625478669.bin, -l, -1, -v, -w, /tmp/graph11541046892625478669.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 14:29:12] [INFO ] Decomposing Gal with order
[2021-05-17 14:29:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 14:29:12] [INFO ] Flatten gal took : 29 ms
[2021-05-17 14:29:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 14:29:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10384381393169825749.gal : 3 ms
[2021-05-17 14:29:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17333032026494141529.ctl : 7 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/CTLFireability10384381393169825749.gal, -t, CGAL, -ctl, /tmp/CTLFireability17333032026494141529.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/CTLFireability10384381393169825749.gal -t CGAL -ctl /tmp/CTLFireability17333032026494141529.ctl
No direction supplied, using forward translation only.
Parsed 8 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.32033e+26,39.0857,252156,150,30,245323,18921,103,1.34517e+06,41,202996,0
Converting to forward existential form...Done !
original formula: EF(!(EX(E((((((((i0.u0.p>=1)&&(i10.u24.p48>=1))&&(i10.u25.p49>=1))||(i4.u11.p20>=1))||(i8.u20.p40>=1))||(i2.u6.p9>=1))||(i9.u22.p42>=1)) U (((((((((i0.u0.p1>=5)||(i0.u1.pterce>=3))||(i7.u16.p30>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(i6.u17.p32>=1))||(i10.u24.p47>=1))||(i6.u18.p35>=1))||(i8.u20.p39>=1))||(i9.u22.p42>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E((((((((i0.u0.p>=1)&&(i10.u24.p48>=1))&&(i10.u25.p49>=1))||(i4.u11.p20>=1))||(i8.u20.p40>=1))||(i2.u6.p9>=1))||(i9.u22.p42>=1)) U (((((((((i0.u0.p1>=5)||(i0.u1.pterce>=3))||(i7.u16.p30>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(i6.u17.p32>=1))||(i10.u24.p47>=1))||(i6.u18.p35>=1))||(i8.u20.p39>=1))||(i9.u22.p42>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,39.1064,252156,1,0,245323,18921,371,1.34517e+06,168,202996,2432
FORMULA RefineWMG-PT-010011-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(E(EG(E(AX((((i7.u16.p30>=1)||(((i1.u2.p3>=1)&&(i1.u3.p4>=1))&&(i2.u4.p6>=1)))||(((i4.u10.p18>=1)&&(i4.u11.p19>=1))&&(i4.u9.p21>=1)))) U ((((((((((((i6.u17.p33>=1)&&(i6.u18.p34>=1))&&(i7.u14.p36>=1))||(i3.u8.p14>=1))||(i10.u25.p49>=1))||(((i8.u19.p38>=1)&&(i8.u20.p39>=1))&&(i9.u21.p41>=1)))||(i9.u22.p42>=1))||(i2.u6.p9>=1))||(i7.u15.p27>=1))||(i0.u0.p1>=5))||(i4.u11.p20>=1))||(i8.u19.p37>=1)))) U (((i2.u5.p8>=1)&&(i2.u6.p9>=1))&&(i2.u4.p11>=1))))
=> equivalent forward existential formula: [(FwdU(Init,EG(E(!(EX(!((((i7.u16.p30>=1)||(((i1.u2.p3>=1)&&(i1.u3.p4>=1))&&(i2.u4.p6>=1)))||(((i4.u10.p18>=1)&&(i4.u11.p19>=1))&&(i4.u9.p21>=1)))))) U ((((((((((((i6.u17.p33>=1)&&(i6.u18.p34>=1))&&(i7.u14.p36>=1))||(i3.u8.p14>=1))||(i10.u25.p49>=1))||(((i8.u19.p38>=1)&&(i8.u20.p39>=1))&&(i9.u21.p41>=1)))||(i9.u22.p42>=1))||(i2.u6.p9>=1))||(i7.u15.p27>=1))||(i0.u0.p1>=5))||(i4.u11.p20>=1))||(i8.u19.p37>=1))))) * (((i2.u5.p8>=1)&&(i2.u6.p9>=1))&&(i2.u4.p11>=1)))] = FALSE
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
[2021-05-17 14:49:12] [INFO ] Flatten gal took : 12 ms
[2021-05-17 14:49:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11294107071657559353.gal : 3 ms
[2021-05-17 14:49:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3735638766894647299.ctl : 6 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/CTLFireability11294107071657559353.gal, -t, CGAL, -ctl, /tmp/CTLFireability3735638766894647299.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/CTLFireability11294107071657559353.gal -t CGAL -ctl /tmp/CTLFireability3735638766894647299.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 7 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.32033e+26,0.383885,19092,2,1995,5,80417,6,0,262,99438,0
Converting to forward existential form...Done !
original formula: !(E(EG(E(AX((((p30>=1)||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(((p18>=1)&&(p19>=1))&&(p21>=1)))) U ((((((((((((p33>=1)&&(p34>=1))&&(p36>=1))||(p14>=1))||(p49>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p42>=1))||(p9>=1))||(p27>=1))||(p1>=5))||(p20>=1))||(p37>=1)))) U (((p8>=1)&&(p9>=1))&&(p11>=1))))
=> equivalent forward existential formula: [(FwdU(Init,EG(E(!(EX(!((((p30>=1)||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(((p18>=1)&&(p19>=1))&&(p21>=1)))))) U ((((((((((((p33>=1)&&(p34>=1))&&(p36>=1))||(p14>=1))||(p49>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p42>=1))||(p9>=1))||(p27>=1))||(p1>=5))||(p20>=1))||(p37>=1))))) * (((p8>=1)&&(p9>=1))&&(p11>=1)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,272.339,2436944,1,0,1127,1.07032e+07,10,1118,1247,2.21788e+07,1288
FORMULA RefineWMG-PT-010011-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (AG((((AG(((((((((p29>=1)||(p14>=1))||((pprime>=2)&&(psecond>=2)))||(((p43>=1)&&(p44>=1))&&(p46>=1)))||(p32>=1))||(p4>=1))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p27>=1))) * (((p14>=1)||(p47>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))) + AF((((((((p1>=5)||(p15>=1))||(p47>=1))||(p4>=1))||(p20>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(p10>=1)))) * (((((((((pterce>=3)||(p45>=1))||(((p8>=1)&&(p9>=1))&&(p11>=1)))||(p15>=1))||(((p>=1)&&(p48>=1))&&(p49>=1)))||(p4>=1))||(p22>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1)))||(((p13>=1)&&(p14>=1))&&(p16>=1))))) * A(!((EX(((((p15>=1)||(p32>=1))||(p22>=1))||(p44>=1))) * AF(((((pprime>=2)&&(psecond>=2))||(p5>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1)))))) U AX((((((!(E((((((((((p29>=1)||(((p>=1)&&(p48>=1))&&(p49>=1)))||((pprime>=2)&&(psecond>=2)))||(p32>=1))||(p17>=1))||(p19>=1))||(p24>=1))||(p42>=1))||(p12>=1)) U (((((((pprime>=2)&&(psecond>=2))||(p47>=1))||(p34>=1))||(p37>=1))||(p27>=1))||(p12>=1)))) + (((p>=1)&&(p48>=1))&&(p49>=1))) + (p35>=1)) + (p24>=1)) + (p42>=1)) + (p27>=1)))))
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * !((!(E(TRUE U !(((((((((p29>=1)||(p14>=1))||((pprime>=2)&&(psecond>=2)))||(((p43>=1)&&(p44>=1))&&(p46>=1)))||(p32>=1))||(p4>=1))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p27>=1))))) * (((p14>=1)||(p47>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))))),!((((((((p1>=5)||(p15>=1))||(p47>=1))||(p4>=1))||(p20>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(p10>=1))))] = FALSE * [(FwdU(Init,TRUE) * !((((((((((pterce>=3)||(p45>=1))||(((p8>=1)&&(p9>=1))&&(p11>=1)))||(p15>=1))||(((p>=1)&&(p48>=1))&&(p49>=1)))||(p4>=1))||(p22>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1)))||(((p13>=1)&&(p14>=1))&&(p16>=1)))))] = FALSE) * ([(FwdU((((((EY((FwdU(Init,!(!(EX(!((((((!(E((((((((((p29>=1)||(((p>=1)&&(p48>=1))&&(p49>=1)))||((pprime>=2)&&(psecond>=2)))||(p32>=1))||(p17>=1))||(p19>=1))||(p24>=1))||(p42>=1))||(p12>=1)) U (((((((pprime>=2)&&(psecond>=2))||(p47>=1))||(p34>=1))||(p37>=1))||(p27>=1))||(p12>=1)))) + (((p>=1)&&(p48>=1))&&(p49>=1))) + (p35>=1)) + (p24>=1)) + (p42>=1)) + (p27>=1))))))) * !(!((EX(((((p15>=1)||(p32>=1))||(p22>=1))||(p44>=1))) * !(EG(!(((((pprime>=2)&&(psecond>=2))||(p5>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1))))))))))) * !((p27>=1))) * !((p42>=1))) * !((p24>=1))) * !((p35>=1))) * !((((p>=1)&&(p48>=1))&&(p49>=1)))),(((((((((p29>=1)||(((p>=1)&&(p48>=1))&&(p49>=1)))||((pprime>=2)&&(psecond>=2)))||(p32>=1))||(p17>=1))||(p19>=1))||(p24>=1))||(p42>=1))||(p12>=1))) * (((((((pprime>=2)&&(psecond>=2))||(p47>=1))||(p34>=1))||(p37>=1))||(p27>=1))||(p12>=1)))] = FALSE * [FwdG(Init,!(!(EX(!((((((!(E((((((((((p29>=1)||(((p>=1)&&(p48>=1))&&(p49>=1)))||((pprime>=2)&&(psecond>=2)))||(p32>=1))||(p17>=1))||(p19>=1))||(p24>=1))||(p42>=1))||(p12>=1)) U (((((((pprime>=2)&&(psecond>=2))||(p47>=1))||(p34>=1))||(p37>=1))||(p27>=1))||(p12>=1)))) + (((p>=1)&&(p48>=1))&&(p49>=1))) + (p35>=1)) + (p24>=1)) + (p42>=1)) + (p27>=1)))))))] = FALSE))
Hit Full ! (commute/partial/dont) 20/0/23
(forward)formula 1,0,272.756,2436944,1,0,1127,1.07032e+07,53,1118,1543,2.21788e+07,1307
FORMULA RefineWMG-PT-010011-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EX(EF((EX((((((((p1>=5)||((pprime>=2)&&(psecond>=2)))||(((p43>=1)&&(p44>=1))&&(p46>=1)))||(p47>=1))||(p22>=1))||(p40>=1))||(p5>=1))) + (EF((((((((((p32>=1)||(p34>=1))||(p17>=1))||(p49>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(p22>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1)))||(p42>=1))||(p44>=1))) * (((p39>=1)||(((p8>=1)&&(p9>=1))&&(p11>=1)))||(((p3>=1)&&(p4>=1))&&(p6>=1)))))))
=> equivalent forward existential formula: ([(EY(FwdU(EY(Init),TRUE)) * (((((((p1>=5)||((pprime>=2)&&(psecond>=2)))||(((p43>=1)&&(p44>=1))&&(p46>=1)))||(p47>=1))||(p22>=1))||(p40>=1))||(p5>=1)))] != FALSE + [(FwdU((FwdU(EY(Init),TRUE) * (((p39>=1)||(((p8>=1)&&(p9>=1))&&(p11>=1)))||(((p3>=1)&&(p4>=1))&&(p6>=1)))),TRUE) * (((((((((p32>=1)||(p34>=1))||(p17>=1))||(p49>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(p22>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1)))||(p42>=1))||(p44>=1)))] != FALSE)
(forward)formula 2,1,273.048,2436944,1,0,1127,1.07032e+07,58,1118,1615,2.21788e+07,1311
FORMULA RefineWMG-PT-010011-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: E(((EG(A((((((p45>=1)||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p24>=1))||(p27>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1))) U EX(TRUE))) * EX(((((AF(((((((((((p1>=5)||(((p>=1)&&(p48>=1))&&(p49>=1)))||(p2>=1))||(p19>=1))||(p4>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p39>=1))||(p9>=1))||(p42>=1))||(p25>=1))) * ((((p>=1)&&(p48>=1))&&(p49>=1))||(p15>=1))) * (p43>=1)) * (p44>=1)) * (p46>=1)))) * ((E(((((((p45<1)&&(p47<1))&&(p34<1))&&(p2<1))&&(p19<1))||(((((((((((p33<1)||(p34<1))||(p36<1))&&(pterce<3))&&(p49<1))&&(p5<1))&&(p24<1))&&(p9<1))&&(p42<1))&&(p25<1))&&(p27<1))) U ((((p35<1)&&(p20<1))&&(p37<1)) + EF((((((((((((p8>=1)&&(p9>=1))&&(p11>=1))||(p30>=1))||((pprime>=2)&&(psecond>=2)))||(p47>=1))||(p22>=1))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p7>=1))||(p24>=1))||(p10>=1))))) + !(EX(((((((((((p43>=1)&&(p44>=1))&&(p46>=1))||(p47>=1))||(p49>=1))||(p7>=1))||(p42>=1))||(p10>=1))||(p27>=1))&&((((((((((pprime>=2)&&(psecond>=2))||(p32>=1))||(p49>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))||(p35>=1))||(p20>=1))||(p7>=1))||(p42>=1))||(p10>=1)))))) + (EX(E(((p7>=1)||(p27>=1)) U ((((p45>=1)||(p19>=1))||(p35>=1))||(p37>=1)))) * (E(AG((((((((p45>=1)||(p32>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(p5>=1))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p25>=1))||(p10>=1))) U EG((((((p29>=1)||(p15>=1))||(p49>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p10>=1)))) + (((p30<1)&&(p12<1))&&((pprime<2)||(psecond<2))))))) U !(AG(((AX((p9>=1)) + AX((((p1>=5)||(p47>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1))))) + E(((((((p14<1)&&(p45<1))&&(((p8<1)||(p9<1))||(p11<1)))&&(p30<1))&&(p49<1))&&(((p38<1)||(p39<1))||(p41<1))) U AG((((((p14>=1)||(p2>=1))||(p20>=1))||(p35>=1))||(p40>=1))))))))
=> equivalent forward existential formula: [(EY(((FwdU(FwdU(Init,((EG(!((E(!(EX(TRUE)) U (!((((((p45>=1)||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p24>=1))||(p27>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1)))) * !(EX(TRUE)))) + EG(!(EX(TRUE)))))) * EX(((((!(EG(!(((((((((((p1>=5)||(((p>=1)&&(p48>=1))&&(p49>=1)))||(p2>=1))||(p19>=1))||(p4>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p39>=1))||(p9>=1))||(p42>=1))||(p25>=1))))) * ((((p>=1)&&(p48>=1))&&(p49>=1))||(p15>=1))) * (p43>=1)) * (p44>=1)) * (p46>=1)))) * ((E(((((((p45<1)&&(p47<1))&&(p34<1))&&(p2<1))&&(p19<1))||(((((((((((p33<1)||(p34<1))||(p36<1))&&(pterce<3))&&(p49<1))&&(p5<1))&&(p24<1))&&(p9<1))&&(p42<1))&&(p25<1))&&(p27<1))) U ((((p35<1)&&(p20<1))&&(p37<1)) + E(TRUE U (((((((((((p8>=1)&&(p9>=1))&&(p11>=1))||(p30>=1))||((pprime>=2)&&(psecond>=2)))||(p47>=1))||(p22>=1))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p7>=1))||(p24>=1))||(p10>=1))))) + !(EX(((((((((((p43>=1)&&(p44>=1))&&(p46>=1))||(p47>=1))||(p49>=1))||(p7>=1))||(p42>=1))||(p10>=1))||(p27>=1))&&((((((((((pprime>=2)&&(psecond>=2))||(p32>=1))||(p49>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))||(p35>=1))||(p20>=1))||(p7>=1))||(p42>=1))||(p10>=1)))))) + (EX(E(((p7>=1)||(p27>=1)) U ((((p45>=1)||(p19>=1))||(p35>=1))||(p37>=1)))) * (E(!(E(TRUE U !((((((((p45>=1)||(p32>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(p5>=1))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p25>=1))||(p10>=1))))) U EG((((((p29>=1)||(p15>=1))||(p49>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p10>=1)))) + (((p30<1)&&(p12<1))&&((pprime<2)||(psecond<2)))))))),TRUE) * !(E(((((((p14<1)&&(p45<1))&&(((p8<1)||(p9<1))||(p11<1)))&&(p30<1))&&(p49<1))&&(((p38<1)||(p39<1))||(p41<1))) U !(E(TRUE U !((((((p14>=1)||(p2>=1))||(p20>=1))||(p35>=1))||(p40>=1)))))))) * !(!(EX(!((p9>=1))))))) * !((((p1>=5)||(p47>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))))] != FALSE
Hit Full ! (commute/partial/dont) 13/0/30
Hit Full ! (commute/partial/dont) 39/0/4
(forward)formula 3,1,273.764,2436944,1,0,1127,1.07032e+07,126,1118,1929,2.21788e+07,1356
FORMULA RefineWMG-PT-010011-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EG(((AG(A((((((((((p14>=1)||(p17>=1))||(p49>=1))||(p22>=1))||(p37>=1))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p39>=1))||(p42>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1))) U (p9>=1))) * (((((p1>=5)||(p15>=1))||(p7>=1))||(p39>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1)))) * ((((p27>=1) + AX((((((p1>=5)||((pprime>=2)&&(psecond>=2)))||(p15>=1))||(p2>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1))))) + (!(EG((((p15>=1)||(p47>=1))||(p39>=1)))) * ((((((p47>=1)||(((p8>=1)&&(p9>=1))&&(p11>=1)))||(((p>=1)&&(p48>=1))&&(p49>=1)))||(((p43>=1)&&(p44>=1))&&(p46>=1)))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(((p13>=1)&&(p14>=1))&&(p16>=1))))) + (AX((((((p14>=1)||(p30>=1))||(pterce>=3))||(p17>=1))||(p24>=1))) * EX(((((p38>=1)&&(p39>=1))&&(p41>=1))||(p44>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(!((E(!((p9>=1)) U (!((((((((((p14>=1)||(p17>=1))||(p49>=1))||(p22>=1))||(p37>=1))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p39>=1))||(p42>=1))||(((p13>=1)&&(p14>=1))&&(p16>=1)))) * !((p9>=1)))) + EG(!((p9>=1)))))))) * (((((p1>=5)||(p15>=1))||(p7>=1))||(p39>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1)))) * ((((p27>=1) + !(EX(!((((((p1>=5)||((pprime>=2)&&(psecond>=2)))||(p15>=1))||(p2>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1))))))) + (!(EG((((p15>=1)||(p47>=1))||(p39>=1)))) * ((((((p47>=1)||(((p8>=1)&&(p9>=1))&&(p11>=1)))||(((p>=1)&&(p48>=1))&&(p49>=1)))||(((p43>=1)&&(p44>=1))&&(p46>=1)))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(((p13>=1)&&(p14>=1))&&(p16>=1))))) + (!(EX(!((((((p14>=1)||(p30>=1))||(pterce>=3))||(p17>=1))||(p24>=1))))) * EX(((((p38>=1)&&(p39>=1))&&(p41>=1))||(p44>=1)))))))] != FALSE
Hit Full ! (commute/partial/dont) 40/0/3
(forward)formula 4,0,274.211,2436944,1,0,1127,1.07032e+07,154,1118,2034,2.21788e+07,1372
FORMULA RefineWMG-PT-010011-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (!(E(((!(EG(((p19>=1)||(((p13>=1)&&(p14>=1))&&(p16>=1))))) * (p7<1)) * E((((pterce>=3)||(p17>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1))) U (p4>=1))) U (AG((((((((p8>=1)&&(p9>=1))&&(p11>=1))||(p15>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))||(p5>=1))||(p40>=1))) + EG(((p42<1)&&((((((((((((((p1>=5)||(((p33>=1)&&(p34>=1))&&(p36>=1)))||(p34>=1))||(p2>=1))||(p20>=1))||(p5>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p40>=1))||(p9>=1))||(p19>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p24>=1))||(p39>=1))))))) * AG(EX(AF((p44>=1)))))
=> equivalent forward existential formula: (([(FwdU(Init,((!(EG(((p19>=1)||(((p13>=1)&&(p14>=1))&&(p16>=1))))) * (p7<1)) * E((((pterce>=3)||(p17>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1))) U (p4>=1)))) * !(E(TRUE U !((((((((p8>=1)&&(p9>=1))&&(p11>=1))||(p15>=1))||(((p23>=1)&&(p24>=1))&&(p26>=1)))||(p5>=1))||(p40>=1))))))] = FALSE * [FwdG(FwdU(Init,((!(EG(((p19>=1)||(((p13>=1)&&(p14>=1))&&(p16>=1))))) * (p7<1)) * E((((pterce>=3)||(p17>=1))||(((p18>=1)&&(p19>=1))&&(p21>=1))) U (p4>=1)))),((p42<1)&&((((((((((((((p1>=5)||(((p33>=1)&&(p34>=1))&&(p36>=1)))||(p34>=1))||(p2>=1))||(p20>=1))||(p5>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p40>=1))||(p9>=1))||(p19>=1))||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(((p38>=1)&&(p39>=1))&&(p41>=1)))||(p24>=1))||(p39>=1))))] = FALSE) * [(FwdU(Init,TRUE) * !(EX(!(EG(!((p44>=1)))))))] = FALSE)
Hit Full ! (commute/partial/dont) 36/0/7
Hit Full ! (commute/partial/dont) 19/1/24
(forward)formula 5,0,274.47,2436944,1,0,1127,1.07032e+07,188,1118,2186,2.21788e+07,1389
FORMULA RefineWMG-PT-010011-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: A(AF((((AX(((((p8>=1)&&(p9>=1))&&(p11>=1))&&((((p47>=1)||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p12>=1)))) + (p49>=1)) + (AG((((((((p1>=5)||(p45>=1))||(p20>=1))||(p22>=1))||(p7>=1))||(p10>=1))||(p27>=1))) * AF((((pterce>=3)||(p50>=1))||(p42>=1))))) + (((p23>=1)&&(p24>=1))&&(p26>=1)))) U EX(A(AF(((((((((p14>=1)||(pterce>=3))||(p30>=1))||(p34>=1))||(p49>=1))||(p4>=1))||((pprime>=2)&&(psecond>=2)))||(((p28>=1)&&(p29>=1))&&(p31>=1)))) U EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!((E(!(EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))))) U (!(!(EG(!(((((((((p14>=1)||(pterce>=3))||(p30>=1))||(p34>=1))||(p49>=1))||(p4>=1))||((pprime>=2)&&(psecond>=2)))||(((p28>=1)&&(p29>=1))&&(p31>=1))))))) * !(EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))))))) + EG(!(EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))))))))))))) * !(E(!(EX(!((E(!(EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))))) U (!(!(EG(!(((((((((p14>=1)||(pterce>=3))||(p30>=1))||(p34>=1))||(p49>=1))||(p4>=1))||((pprime>=2)&&(psecond>=2)))||(((p28>=1)&&(p29>=1))&&(p31>=1))))))) * !(EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))))))) + EG(!(EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1))))))))))) U (!(!(EG(!((((!(EX(!(((((p8>=1)&&(p9>=1))&&(p11>=1))&&((((p47>=1)||(((p3>=1)&&(p4>=1))&&(p6>=1)))||(((p28>=1)&&(p29>=1))&&(p31>=1)))||(p12>=1)))))) + (p49>=1)) + (!(E(TRUE U !((((((((p1>=5)||(p45>=1))||(p20>=1))||(p22>=1))||(p7>=1))||(p10>=1))||(p27>=1))))) * !(EG(!((((pterce>=3)||(p50>=1))||(p42>=1))))))) + (((p23>=1)&&(p24>=1))&&(p26>=1))))))) * !(EX(!((E(!(EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))))) U (!(!(EG(!(((((((((p14>=1)||(pterce>=3))||(p30>=1))||(p34>=1))||(p49>=1))||(p4>=1))||((pprime>=2)&&(psecond>=2)))||(((p28>=1)&&(p29>=1))&&(p31>=1))))))) * !(EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))))))) + EG(!(EG(E((((((((p45>=1)||(p47>=1))||(p32>=1))||(p50>=1))||(p5>=1))||(p9>=1))||(p12>=1)) U ((((((((p45>=1)||(p47>=1))||(p4>=1))||(p20>=1))||(p42>=1))||(p10>=1))||(p27>=1))||(((p38>=1)&&(p39>=1))&&(p41>=1)))))))))))))))] != FALSE
Hit Full ! (commute/partial/dont) 26/0/17
(forward)formula 6,1,274.581,2436944,1,0,1127,1.07032e+07,200,1118,2275,2.21788e+07,1393
FORMULA RefineWMG-PT-010011-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
BK_STOP 1621263227639
--------------------
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="RefineWMG-PT-010011"
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 RefineWMG-PT-010011, 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 r178-tajo-162089416100634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010011.tgz
mv RefineWMG-PT-010011 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;