About the Execution of ITS-Tools for JoinFreeModules-PT-0003
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
227.508 | 4506.00 | 8667.00 | 151.00 | TFFFTTFFTTFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406900386.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-0003, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406900386
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 26 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 24 10:40 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 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 18K 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 JoinFreeModules-PT-0003-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1620840948973
Running Version 0
[2021-05-12 17:35:50] [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-12 17:35:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 17:35:50] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2021-05-12 17:35:50] [INFO ] Transformed 16 places.
[2021-05-12 17:35:50] [INFO ] Transformed 25 transitions.
[2021-05-12 17:35:50] [INFO ] Parsed PT model containing 16 places and 25 transitions in 68 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Reduce places removed 1 places and 0 transitions.
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 7 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2021-05-12 17:35:50] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-12 17:35:50] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2021-05-12 17:35:50] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-12 17:35:50] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2021-05-12 17:35:50] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-12 17:35:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 15 cols
[2021-05-12 17:35:50] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:35:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 25/25 transitions.
[2021-05-12 17:35:51] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 46 ms
FORMULA JoinFreeModules-PT-0003-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 7 ms
[2021-05-12 17:35:51] [INFO ] Input system was already deterministic with 25 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 79) seen :78
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 15 cols
[2021-05-12 17:35:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:35:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:35:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-12 17:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:51] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-12 17:35:51] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:35:51] [INFO ] Added : 14 causal constraints over 3 iterations in 56 ms. Result :sat
Applied a total of 0 rules in 7 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 3 ms
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 3 ms
[2021-05-12 17:35:51] [INFO ] Input system was already deterministic with 25 transitions.
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:35:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13042093162580709390.gal : 1 ms
[2021-05-12 17:35:51] [INFO ] Time to serialize properties into /tmp/CTLFireability5659988498203524827.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/CTLFireability13042093162580709390.gal, -t, CGAL, -ctl, /tmp/CTLFireability5659988498203524827.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/CTLFireability13042093162580709390.gal -t CGAL -ctl /tmp/CTLFireability5659988498203524827.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,35937,0.008601,4240,2,66,5,635,6,0,133,528,0
Converting to forward existential form...Done !
original formula: AG((!(EG(AF((((((((((p9>=3)||(p8>=2))||(p5>=5))||(p3>=2))||(p10>=5))||(p7>=2))||(p8>=2))||(((p3>=3)&&(p8>=3))&&(p13>=3)))||(p1>=3))))) * ((((((((((p4>=4)||(p5>=5))||(p4>=3))||(p10>=5))||(p11>=5))||(p12>=2))||(p14>=4))||(p13>=2))||(p1>=5))||(p13>=1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(EG(!((((((((((p9>=3)||(p8>=2))||(p5>=5))||(p3>=2))||(p10>=5))||(p7>=2))||(p8>=2))||(((p3>=3)&&(p8>=3))&&(p13>=3)))||(p1>=3))))))] = FALSE * [(FwdU(Init,TRUE) * !(((((((((((p4>=4)||(p5>=5))||(p4>=3))||(p10>=5))||(p11>=5))||(p12>=2))||(p14>=4))||(p13>=2))||(p1>=5))||(p13>=1))))] = FALSE)
(forward)formula 0,0,0.010783,4688,1,0,8,635,9,2,187,528,1
FORMULA JoinFreeModules-PT-0003-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:35:51] [INFO ] Input system was already deterministic with 25 transitions.
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 1 ms
[2021-05-12 17:35:51] [INFO ] Flatten gal took : 1 ms
[2021-05-12 17:35:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14711704454138201061.gal : 0 ms
[2021-05-12 17:35:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4178566786704028382.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/CTLFireability14711704454138201061.gal, -t, CGAL, -ctl, /tmp/CTLFireability4178566786704028382.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/CTLFireability14711704454138201061.gal -t CGAL -ctl /tmp/CTLFireability4178566786704028382.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,35937,0.005347,4340,2,66,5,635,6,0,133,528,0
Converting to forward existential form...Done !
original formula: EG(((((p6>=5)||(p3>=2))||(p15>=5))||(p13>=1)))
=> equivalent forward existential formula: [FwdG(Init,((((p6>=5)||(p3>=2))||(p15>=5))||(p13>=1)))] != FALSE
Hit Full ! (commute/partial/dont) 10/0/15
(forward)formula 0,1,0.038034,6100,1,0,7,8008,19,2,636,9360,8
FORMULA JoinFreeModules-PT-0003-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2021-05-12 17:35:52] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:35:52] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:35:52] [INFO ] Input system was already deterministic with 25 transitions.
[2021-05-12 17:35:52] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:35:52] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:35:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8148709561588389146.gal : 1 ms
[2021-05-12 17:35:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4337490025010689322.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/CTLFireability8148709561588389146.gal, -t, CGAL, -ctl, /tmp/CTLFireability4337490025010689322.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/CTLFireability8148709561588389146.gal -t CGAL -ctl /tmp/CTLFireability4337490025010689322.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,35937,0.005406,4408,2,66,5,635,6,0,133,528,0
Converting to forward existential form...Done !
original formula: EF((A(((p7>=2) + (((((((((((((p5>=5)||(p4>=3))||(p6>=3))||(p12>=2))||(p13>=1))||(p2>=2))||(p5>=5))||(p6>=3))||(p12>=2))||(p15>=5))||(p14>=3))&&(((((((p6>=3)||(p9>=4))||(p13>=2))||(p6>=5))||(p7>=2))||(p14>=3))||(p1>=3))) * AG((((((p5>=5)||(p4>=3))||(p8>=2))||(p12>=2))||(p1>=5))))) U ((((E(((((((((p5>=5)||(p6>=3))||(p8>=2))||(p9>=3))||(p15>=5))||(p12>=2))||(p1>=3))&&((p3>=1)||(p13>=2))) U ((((((((((p3>=2)||(p10>=5))||(p9>=4))||(p7>=2))||(p9>=3))||(p8>=1))||(p12>=2))||(p13>=2))||(p1>=5))&&(((((((p4>=3)||(p6>=5))||(p3>=1))||(p9>=4))||(p9>=3))||(p14>=4))||(p12>=2)))) + (p9>=4)) + (p8>=2)) + (p8>=1)) + (p14>=4))) * (p12>=2)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p12>=2)) * !(EG(!(((((E(((((((((p5>=5)||(p6>=3))||(p8>=2))||(p9>=3))||(p15>=5))||(p12>=2))||(p1>=3))&&((p3>=1)||(p13>=2))) U ((((((((((p3>=2)||(p10>=5))||(p9>=4))||(p7>=2))||(p9>=3))||(p8>=1))||(p12>=2))||(p13>=2))||(p1>=5))&&(((((((p4>=3)||(p6>=5))||(p3>=1))||(p9>=4))||(p9>=3))||(p14>=4))||(p12>=2)))) + (p9>=4)) + (p8>=2)) + (p8>=1)) + (p14>=4)))))) * !(E(!(((((E(((((((((p5>=5)||(p6>=3))||(p8>=2))||(p9>=3))||(p15>=5))||(p12>=2))||(p1>=3))&&((p3>=1)||(p13>=2))) U ((((((((((p3>=2)||(p10>=5))||(p9>=4))||(p7>=2))||(p9>=3))||(p8>=1))||(p12>=2))||(p13>=2))||(p1>=5))&&(((((((p4>=3)||(p6>=5))||(p3>=1))||(p9>=4))||(p9>=3))||(p14>=4))||(p12>=2)))) + (p9>=4)) + (p8>=2)) + (p8>=1)) + (p14>=4))) U (!(((p7>=2) + (((((((((((((p5>=5)||(p4>=3))||(p6>=3))||(p12>=2))||(p13>=1))||(p2>=2))||(p5>=5))||(p6>=3))||(p12>=2))||(p15>=5))||(p14>=3))&&(((((((p6>=3)||(p9>=4))||(p13>=2))||(p6>=5))||(p7>=2))||(p14>=3))||(p1>=3))) * !(E(TRUE U !((((((p5>=5)||(p4>=3))||(p8>=2))||(p12>=2))||(p1>=5)))))))) * !(((((E(((((((((p5>=5)||(p6>=3))||(p8>=2))||(p9>=3))||(p15>=5))||(p12>=2))||(p1>=3))&&((p3>=1)||(p13>=2))) U ((((((((((p3>=2)||(p10>=5))||(p9>=4))||(p7>=2))||(p9>=3))||(p8>=1))||(p12>=2))||(p13>=2))||(p1>=5))&&(((((((p4>=3)||(p6>=5))||(p3>=1))||(p9>=4))||(p9>=3))||(p14>=4))||(p12>=2)))) + (p9>=4)) + (p8>=2)) + (p8>=1)) + (p14>=4)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t10, t11, t18, t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/19/6/25
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.074036,6364,1,0,111,9113,91,69,800,11780,120
FORMULA JoinFreeModules-PT-0003-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2021-05-12 17:35:52] [INFO ] Flatten gal took : 4 ms
[2021-05-12 17:35:52] [INFO ] Flatten gal took : 3 ms
[2021-05-12 17:35:52] [INFO ] Applying decomposition
[2021-05-12 17:35:52] [INFO ] Flatten gal took : 4 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/graph4870165222163025039.txt, -o, /tmp/graph4870165222163025039.bin, -w, /tmp/graph4870165222163025039.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/graph4870165222163025039.bin, -l, -1, -v, -w, /tmp/graph4870165222163025039.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 17:35:52] [INFO ] Decomposing Gal with order
[2021-05-12 17:35:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 17:35:52] [INFO ] Flatten gal took : 22 ms
[2021-05-12 17:35:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 17:35:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7541989448046189673.gal : 1 ms
[2021-05-12 17:35:52] [INFO ] Time to serialize properties into /tmp/CTLFireability48369524861413587.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/CTLFireability7541989448046189673.gal, -t, CGAL, -ctl, /tmp/CTLFireability48369524861413587.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/CTLFireability7541989448046189673.gal -t CGAL -ctl /tmp/CTLFireability48369524861413587.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,35937,0.00714,4496,32,29,227,192,73,266,44,408,0
Converting to forward existential form...Done !
original formula: EF((AX((((((i0.u0.p5>=5)||(i1.u2.p6>=5))||(i1.u3.p7>=2))||(i2.u4.p12>=2))||(i2.u5.p14>=4))) * ((A((AX((((((((((i1.u2.p6>=5)||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i2.u5.p11>=5))||(i1.u3.p8>=1))||(i2.u5.p11>=3))||(i2.u5.p15>=5))||(i2.u4.p12>=2))||(i2.u4.p13>=1))) + ((((((((((i0.u0.p5>=5)||(i1.u2.p6>=5))||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u3.p8>=1))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u5.p14>=3))||(i2.u4.p13>=2))||(i0.u0.p1>=5))&&((i0.u0.p4>=3)||(i0.u1.p3>=1)))) U (((i1.u2.p6>=5)||(i1.u2.p9>=3))||(i2.u5.p14>=3))) + !(A((((((i0.u0.p4<3)&&(i0.u1.p3<1))&&(i1.u2.p9<4))&&(i1.u2.p9<3))&&(i2.u5.p14<4)) U EG((((((i1.u2.p9>=4)||(i1.u3.p7>=2))||(i2.u5.p11>=5))||(i1.u3.p8>=1))||(i0.u0.p1>=5)))))) + EF(((i0.u1.p2>=2)||(i2.u4.p13>=1))))))
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !(EX(!((((((i0.u0.p5>=5)||(i1.u2.p6>=5))||(i1.u3.p7>=2))||(i2.u4.p12>=2))||(i2.u5.p14>=4)))))) * !(EG(!((((i1.u2.p6>=5)||(i1.u2.p9>=3))||(i2.u5.p14>=3)))))) * !(E(!((((i1.u2.p6>=5)||(i1.u2.p9>=3))||(i2.u5.p14>=3))) U (!((!(EX(!((((((((((i1.u2.p6>=5)||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i2.u5.p11>=5))||(i1.u3.p8>=1))||(i2.u5.p11>=3))||(i2.u5.p15>=5))||(i2.u4.p12>=2))||(i2.u4.p13>=1))))) + ((((((((((i0.u0.p5>=5)||(i1.u2.p6>=5))||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u3.p8>=1))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u5.p14>=3))||(i2.u4.p13>=2))||(i0.u0.p1>=5))&&((i0.u0.p4>=3)||(i0.u1.p3>=1))))) * !((((i1.u2.p6>=5)||(i1.u2.p9>=3))||(i2.u5.p14>=3)))))))] != FALSE + ([((FwdU((FwdU(Init,TRUE) * !(EX(!((((((i0.u0.p5>=5)||(i1.u2.p6>=5))||(i1.u3.p7>=2))||(i2.u4.p12>=2))||(i2.u5.p14>=4)))))),!(EG((((((i1.u2.p9>=4)||(i1.u3.p7>=2))||(i2.u5.p11>=5))||(i1.u3.p8>=1))||(i0.u0.p1>=5))))) * !((((((i0.u0.p4<3)&&(i0.u1.p3<1))&&(i1.u2.p9<4))&&(i1.u2.p9<3))&&(i2.u5.p14<4)))) * !(EG((((((i1.u2.p9>=4)||(i1.u3.p7>=2))||(i2.u5.p11>=5))||(i1.u3.p8>=1))||(i0.u0.p1>=5)))))] != FALSE + [FwdG((FwdU(Init,TRUE) * !(EX(!((((((i0.u0.p5>=5)||(i1.u2.p6>=5))||(i1.u3.p7>=2))||(i2.u4.p12>=2))||(i2.u5.p14>=4)))))),!(EG((((((i1.u2.p9>=4)||(i1.u3.p7>=2))||(i2.u5.p11>=5))||(i1.u3.p8>=1))||(i0.u0.p1>=5)))))] != FALSE)) + [(FwdU((FwdU(Init,TRUE) * !(EX(!((((((i0.u0.p5>=5)||(i1.u2.p6>=5))||(i1.u3.p7>=2))||(i2.u4.p12>=2))||(i2.u5.p14>=4)))))),TRUE) * ((i0.u1.p2>=2)||(i2.u4.p13>=1)))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions i0.t3, i0.u1.t2, i1.t11, i1.u3.t10, i2.t19, i2.u4.t18, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/19/6/25
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,0.032835,5988,1,0,1656,684,399,3786,176,2182,1835
FORMULA JoinFreeModules-PT-0003-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EG(((((i1.u2.p9<4)&&(i1.u3.p8<2))&&(i1.u3.p8<1))&&(i2.u5.p14<3))) + EG((EX((A((((((((((i0.u0.p5>=5)||(i0.u1.p2>=2))||(i0.u0.p4>=3))||(i1.u2.p6>=5))||(i1.u2.p9>=4))||(i2.u5.p11>=3))||(i2.u5.p15>=5))||(i2.u4.p13>=2))||(i0.u0.p1>=3)) U (((i1.u2.p10>=5)||(i1.u3.p8>=2))||(i2.u5.p15>=5))) + !(AX((((((i1.u3.p7>=2)||(i1.u2.p9>=3))||(i1.u3.p8>=1))||(i2.u5.p14>=4))||(i2.u4.p12>=2)))))) * A(((AX(((((((((((i0.u1.p3>=1)||(i1.u2.p9>=4))||(i1.u3.p7>=2))||(i1.u2.p10>=5))||(i1.u3.p8>=2))||(i1.u3.p8>=1))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5))||(i2.u4.p13>=1))) * (((((((((i0.u0.p4>=4)||(i0.u1.p3>=2))||(i0.u1.p3>=1))||(i1.u2.p10>=5))||(i1.u3.p8>=2))||(i2.u4.p12>=2))||(i2.u5.p15>=5))||(i2.u4.p13>=1))||(i1.u2.p6>=5))) * AX((((i1.u2.p6>=5)||(i0.u1.p3>=2))||(i1.u2.p6>=3)))) U ((((((A((((i0.u1.p2>=2)||(i2.u4.p12>=2))||(i2.u4.p13>=1)) U (((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))) * (i0.u1.p3<2)) * (i0.u1.p3<1)) * (i1.u2.p6<3)) * (i2.u4.p13<1)) * (i0.u0.p1<3)) * EG((((i1.u2.p9>=4)||(i2.u5.p11>=5))||(i1.u2.p9>=3))))))))
=> equivalent forward existential formula: ([FwdG(Init,((((i1.u2.p9<4)&&(i1.u3.p8<2))&&(i1.u3.p8<1))&&(i2.u5.p14<3)))] != FALSE + [FwdG(Init,(EX((!((E(!((((i1.u2.p10>=5)||(i1.u3.p8>=2))||(i2.u5.p15>=5))) U (!((((((((((i0.u0.p5>=5)||(i0.u1.p2>=2))||(i0.u0.p4>=3))||(i1.u2.p6>=5))||(i1.u2.p9>=4))||(i2.u5.p11>=3))||(i2.u5.p15>=5))||(i2.u4.p13>=2))||(i0.u0.p1>=3))) * !((((i1.u2.p10>=5)||(i1.u3.p8>=2))||(i2.u5.p15>=5))))) + EG(!((((i1.u2.p10>=5)||(i1.u3.p8>=2))||(i2.u5.p15>=5)))))) + !(!(EX(!((((((i1.u3.p7>=2)||(i1.u2.p9>=3))||(i1.u3.p8>=1))||(i2.u5.p14>=4))||(i2.u4.p12>=2)))))))) * !((E(!(((((((!((E(!((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))) U (!((((i0.u1.p2>=2)||(i2.u4.p12>=2))||(i2.u4.p13>=1))) * !((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))))) + EG(!((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))))) * (i0.u1.p3<2)) * (i0.u1.p3<1)) * (i1.u2.p6<3)) * (i2.u4.p13<1)) * (i0.u0.p1<3)) * EG((((i1.u2.p9>=4)||(i2.u5.p11>=5))||(i1.u2.p9>=3))))) U (!(((!(EX(!(((((((((((i0.u1.p3>=1)||(i1.u2.p9>=4))||(i1.u3.p7>=2))||(i1.u2.p10>=5))||(i1.u3.p8>=2))||(i1.u3.p8>=1))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5))||(i2.u4.p13>=1))))) * (((((((((i0.u0.p4>=4)||(i0.u1.p3>=2))||(i0.u1.p3>=1))||(i1.u2.p10>=5))||(i1.u3.p8>=2))||(i2.u4.p12>=2))||(i2.u5.p15>=5))||(i2.u4.p13>=1))||(i1.u2.p6>=5))) * !(EX(!((((i1.u2.p6>=5)||(i0.u1.p3>=2))||(i1.u2.p6>=3))))))) * !(((((((!((E(!((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))) U (!((((i0.u1.p2>=2)||(i2.u4.p12>=2))||(i2.u4.p13>=1))) * !((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))))) + EG(!((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))))) * (i0.u1.p3<2)) * (i0.u1.p3<1)) * (i1.u2.p6<3)) * (i2.u4.p13<1)) * (i0.u0.p1<3)) * EG((((i1.u2.p9>=4)||(i2.u5.p11>=5))||(i1.u2.p9>=3))))))) + EG(!(((((((!((E(!((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))) U (!((((i0.u1.p2>=2)||(i2.u4.p12>=2))||(i2.u4.p13>=1))) * !((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))))) + EG(!((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))))) * (i0.u1.p3<2)) * (i0.u1.p3<1)) * (i1.u2.p6<3)) * (i2.u4.p13<1)) * (i0.u0.p1<3)) * EG((((i1.u2.p9>=4)||(i2.u5.p11>=5))||(i1.u2.p9>=3))))))))))] != FALSE)
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 1,0,0.09945,7572,1,0,4371,1148,591,9459,191,3817,4479
FORMULA JoinFreeModules-PT-0003-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EG((((((((i0.u1.p2>=2)||(i0.u0.p5>=5))||(i1.u2.p6>=5))||(i1.u3.p8>=1))||(i2.u5.p14>=3))||(((((((i0.u0.p5<5)&&(i0.u1.p2<2))&&(i1.u2.p6<3))&&(i1.u2.p9<4))&&(i1.u3.p8<1))&&(i2.u5.p14<4))&&(i2.u4.p13<1))) + ((EF(((((((((i0.u1.p2>=2)||(i0.u0.p4>=4))||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(i2.u4.p13>=1))) * (i0.u1.p3<1)) * ((EX(AG(((((i0.u0.p5>=5)||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i2.u4.p13>=2)))) + !(AG((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i2.u5.p14>=3))))) + EX((((((i1.u2.p6>=5)||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))))))) + (!(A(A(EG(((((((i0.u1.p3>=2)||(i0.u1.p3>=1))||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u3.p8>=1))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))) U (((((((((((((((((((((((((i1.u2.p6>=5)||(i0.u0.p4>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i2.u5.p14>=4))||(i2.u5.p14>=3))||(i0.u0.p1>=5))&&((((((i0.u0.p4>=4)||(i0.u1.p3>=2))||(i2.u5.p11>=5))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5)))||(i0.u1.p2>=2))||(i0.u0.p5>=5))||(i1.u2.p9>=4))||(i1.u2.p10>=5))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u5.p14>=3))||(i0.u0.p1>=3))||(i0.u1.p3>=1))||(i1.u2.p6>=3))||(i1.u2.p10>=5))||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i2.u5.p11>=3))||(i2.u5.p14>=3))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5))) U (((i1.u3.p7>=2)||(i2.u5.p11>=3))||(i0.u0.p1>=5)))) * AF(((((((((((i0.u1.p2>=2)||(i0.u0.p5>=5))||(i1.u2.p6>=5))||(i1.u2.p10>=5))||(i2.u5.p11>=5))||(i2.u5.p11>=3))||(i2.u5.p15>=5))||(i2.u5.p14>=3))||(i2.u4.p13>=1))||(i0.u0.p1>=3)))))
=> equivalent forward existential formula: ([(((Init * !(EG((((((((i0.u1.p2>=2)||(i0.u0.p5>=5))||(i1.u2.p6>=5))||(i1.u3.p8>=1))||(i2.u5.p14>=3))||(((((((i0.u0.p5<5)&&(i0.u1.p2<2))&&(i1.u2.p6<3))&&(i1.u2.p9<4))&&(i1.u3.p8<1))&&(i2.u5.p14<4))&&(i2.u4.p13<1))) + ((E(TRUE U ((((((((i0.u1.p2>=2)||(i0.u0.p4>=4))||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(i2.u4.p13>=1))) * (i0.u1.p3<1)) * ((EX(!(E(TRUE U !(((((i0.u0.p5>=5)||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i2.u4.p13>=2)))))) + !(!(E(TRUE U !((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i2.u5.p14>=3))))))) + EX((((((i1.u2.p6>=5)||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))))))))) * !(EG(!((((i1.u3.p7>=2)||(i2.u5.p11>=3))||(i0.u0.p1>=5)))))) * !(E(!((((i1.u3.p7>=2)||(i2.u5.p11>=3))||(i0.u0.p1>=5))) U (!(!((E(!((((((((((((((((((((((((((i1.u2.p6>=5)||(i0.u0.p4>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i2.u5.p14>=4))||(i2.u5.p14>=3))||(i0.u0.p1>=5))&&((((((i0.u0.p4>=4)||(i0.u1.p3>=2))||(i2.u5.p11>=5))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5)))||(i0.u1.p2>=2))||(i0.u0.p5>=5))||(i1.u2.p9>=4))||(i1.u2.p10>=5))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u5.p14>=3))||(i0.u0.p1>=3))||(i0.u1.p3>=1))||(i1.u2.p6>=3))||(i1.u2.p10>=5))||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i2.u5.p11>=3))||(i2.u5.p14>=3))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5))) U (!(EG(((((((i0.u1.p3>=2)||(i0.u1.p3>=1))||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u3.p8>=1))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))) * !((((((((((((((((((((((((((i1.u2.p6>=5)||(i0.u0.p4>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i2.u5.p14>=4))||(i2.u5.p14>=3))||(i0.u0.p1>=5))&&((((((i0.u0.p4>=4)||(i0.u1.p3>=2))||(i2.u5.p11>=5))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5)))||(i0.u1.p2>=2))||(i0.u0.p5>=5))||(i1.u2.p9>=4))||(i1.u2.p10>=5))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u5.p14>=3))||(i0.u0.p1>=3))||(i0.u1.p3>=1))||(i1.u2.p6>=3))||(i1.u2.p10>=5))||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i2.u5.p11>=3))||(i2.u5.p14>=3))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5))))) + EG(!((((((((((((((((((((((((((i1.u2.p6>=5)||(i0.u0.p4>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i2.u5.p14>=4))||(i2.u5.p14>=3))||(i0.u0.p1>=5))&&((((((i0.u0.p4>=4)||(i0.u1.p3>=2))||(i2.u5.p11>=5))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5)))||(i0.u1.p2>=2))||(i0.u0.p5>=5))||(i1.u2.p9>=4))||(i1.u2.p10>=5))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u5.p14>=3))||(i0.u0.p1>=3))||(i0.u1.p3>=1))||(i1.u2.p6>=3))||(i1.u2.p10>=5))||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i2.u5.p11>=3))||(i2.u5.p14>=3))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i0.u0.p1>=5))))))) * !((((i1.u3.p7>=2)||(i2.u5.p11>=3))||(i0.u0.p1>=5)))))))] = FALSE * [FwdG((Init * !(EG((((((((i0.u1.p2>=2)||(i0.u0.p5>=5))||(i1.u2.p6>=5))||(i1.u3.p8>=1))||(i2.u5.p14>=3))||(((((((i0.u0.p5<5)&&(i0.u1.p2<2))&&(i1.u2.p6<3))&&(i1.u2.p9<4))&&(i1.u3.p8<1))&&(i2.u5.p14<4))&&(i2.u4.p13<1))) + ((E(TRUE U ((((((((i0.u1.p2>=2)||(i0.u0.p4>=4))||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(i2.u4.p13>=1))) * (i0.u1.p3<1)) * ((EX(!(E(TRUE U !(((((i0.u0.p5>=5)||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i2.u4.p13>=2)))))) + !(!(E(TRUE U !((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i2.u5.p14>=3))))))) + EX((((((i1.u2.p6>=5)||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))))))))),!(((((((((((i0.u1.p2>=2)||(i0.u0.p5>=5))||(i1.u2.p6>=5))||(i1.u2.p10>=5))||(i2.u5.p11>=5))||(i2.u5.p11>=3))||(i2.u5.p15>=5))||(i2.u5.p14>=3))||(i2.u4.p13>=1))||(i0.u0.p1>=3))))] = FALSE)
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 2,1,0.16561,9420,1,0,7665,1428,792,15835,200,4652,8337
FORMULA JoinFreeModules-PT-0003-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX(((((((AF((EG((((i0.u0.p4>=3)||(i0.u1.p3>=2))||(i0.u0.p1>=5))) * ((((((((((((((((i0.u0.p4>=4)||(i0.u1.p3>=2))||(i1.u2.p6>=3))||(i1.u3.p8>=2))||(i2.u5.p14>=4))&&((((i0.u1.p3>=1)||(i2.u5.p11>=5))||(i0.u0.p1>=5))||(i0.u0.p1>=3)))||(i0.u1.p2>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=2))||(i1.u2.p10>=5))||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i2.u5.p11>=5))||(i2.u5.p11>=3))||(i2.u5.p14>=4))||(i2.u4.p13>=1)))) + (i0.u0.p5>=5)) + (i1.u2.p10>=5)) + (i1.u2.p9>=4)) + (i2.u5.p14>=4)) + (i2.u4.p13>=1)) + EX(EF((((((((i1.u2.p6>=3)||(i1.u3.p7>=2))||(i2.u5.p11>=5))||(i1.u3.p8>=2))||(i2.u4.p12>=2))||(i2.u5.p15>=5))||(i0.u0.p1>=3))))))
=> equivalent forward existential formula: [FwdG(((((((EY(Init) * !(EX(E(TRUE U (((((((i1.u2.p6>=3)||(i1.u3.p7>=2))||(i2.u5.p11>=5))||(i1.u3.p8>=2))||(i2.u4.p12>=2))||(i2.u5.p15>=5))||(i0.u0.p1>=3)))))) * !((i2.u4.p13>=1))) * !((i2.u5.p14>=4))) * !((i1.u2.p9>=4))) * !((i1.u2.p10>=5))) * !((i0.u0.p5>=5))),!((EG((((i0.u0.p4>=3)||(i0.u1.p3>=2))||(i0.u0.p1>=5))) * ((((((((((((((((i0.u0.p4>=4)||(i0.u1.p3>=2))||(i1.u2.p6>=3))||(i1.u3.p8>=2))||(i2.u5.p14>=4))&&((((i0.u1.p3>=1)||(i2.u5.p11>=5))||(i0.u0.p1>=5))||(i0.u0.p1>=3)))||(i0.u1.p2>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=2))||(i1.u2.p10>=5))||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i2.u5.p11>=5))||(i2.u5.p11>=3))||(i2.u5.p14>=4))||(i2.u4.p13>=1)))))] = FALSE
(forward)formula 3,1,0.171946,9420,1,0,7895,1463,855,16224,200,4760,8621
FORMULA JoinFreeModules-PT-0003-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX(((E((((((AG(((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u3.p8>=1))||(i2.u5.p14>=3))) * EG(((((i0.u0.p5>=5)||(i1.u3.p7>=2))||(i1.u2.p10>=5))||(i2.u5.p15>=5)))) + (i1.u2.p6>=5)) + (i2.u5.p11>=5)) + (i1.u2.p9>=3)) + (i2.u4.p13>=2)) U (i1.u3.p7>=2)) * (((((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i1.u2.p10>=5))||(i1.u2.p9>=3))||(i2.u5.p14>=4))||(i2.u4.p13>=1))||(i0.u0.p1>=3))) * (((EG((EX(((((((((((i0.u0.p4>=4)||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i2.u5.p11>=3))||(i2.u5.p14>=4))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u4.p13>=2))||(i0.u0.p1>=5))) + E(((((((i0.u0.p5>=5)||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u3.p8>=1))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))) U (((((i0.u0.p5>=5)||(i0.u1.p3>=2))||(i1.u2.p6>=5))||(i1.u2.p9>=4))||(i1.u2.p9>=3))))) + !(EX((((i1.u3.p7<2)&&(i2.u4.p12<2))&&(i2.u5.p15<5))))) + AF(((((((i0.u1.p2<2)&&(i0.u1.p3<2))&&(i1.u3.p7<2))&&(i2.u5.p14<4))&&(i2.u5.p15<5))||(i1.u3.p8<1)))) + (((i2.u5.p14>=4)||(i0.u0.p1>=5)) * (!(EF(((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i2.u5.p11>=5))||(i2.u5.p11>=3))||(i2.u5.p14>=3))||(i2.u4.p13>=2))||(i2.u4.p13>=1))||(i0.u0.p1>=3)))) + (((((((((i0.u0.p4<4)&&(i1.u2.p9<4))&&(i1.u2.p10<5))&&(i1.u3.p8<2))&&(i1.u2.p9<3))&&(i2.u5.p11<3))&&(i2.u4.p13<1))&&(i0.u0.p1<3))&&(((((((((((i2.u5.p15>=5)||(i0.u0.p4>=4))||(i1.u2.p6>=5))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i1.u2.p10>=5))||(i1.u3.p8>=1))||(i2.u5.p11>=3))||(i2.u4.p12>=2))||(i0.u0.p1>=5))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))))))))
=> equivalent forward existential formula: (([(EY(Init) * !(E((((((!(E(TRUE U !(((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u3.p8>=1))||(i2.u5.p14>=3))))) * EG(((((i0.u0.p5>=5)||(i1.u3.p7>=2))||(i1.u2.p10>=5))||(i2.u5.p15>=5)))) + (i1.u2.p6>=5)) + (i2.u5.p11>=5)) + (i1.u2.p9>=3)) + (i2.u4.p13>=2)) U (i1.u3.p7>=2))))] = FALSE * [(EY(Init) * !((((((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i1.u2.p10>=5))||(i1.u2.p9>=3))||(i2.u5.p14>=4))||(i2.u4.p13>=1))||(i0.u0.p1>=3))))] = FALSE) * ([((EY(Init) * !(((EG((EX(((((((((((i0.u0.p4>=4)||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i2.u5.p11>=3))||(i2.u5.p14>=4))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u4.p13>=2))||(i0.u0.p1>=5))) + E(((((((i0.u0.p5>=5)||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u3.p8>=1))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))) U (((((i0.u0.p5>=5)||(i0.u1.p3>=2))||(i1.u2.p6>=5))||(i1.u2.p9>=4))||(i1.u2.p9>=3))))) + !(EX((((i1.u3.p7<2)&&(i2.u4.p12<2))&&(i2.u5.p15<5))))) + !(EG(!(((((((i0.u1.p2<2)&&(i0.u1.p3<2))&&(i1.u3.p7<2))&&(i2.u5.p14<4))&&(i2.u5.p15<5))||(i1.u3.p8<1)))))))) * !(((i2.u5.p14>=4)||(i0.u0.p1>=5))))] = FALSE * [(FwdU(((EY(Init) * !(((EG((EX(((((((((((i0.u0.p4>=4)||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i2.u5.p11>=3))||(i2.u5.p14>=4))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u4.p13>=2))||(i0.u0.p1>=5))) + E(((((((i0.u0.p5>=5)||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u3.p8>=1))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))) U (((((i0.u0.p5>=5)||(i0.u1.p3>=2))||(i1.u2.p6>=5))||(i1.u2.p9>=4))||(i1.u2.p9>=3))))) + !(EX((((i1.u3.p7<2)&&(i2.u4.p12<2))&&(i2.u5.p15<5))))) + !(EG(!(((((((i0.u1.p2<2)&&(i0.u1.p3<2))&&(i1.u3.p7<2))&&(i2.u5.p14<4))&&(i2.u5.p15<5))||(i1.u3.p8<1)))))))) * !((((((((((i0.u0.p4<4)&&(i1.u2.p9<4))&&(i1.u2.p10<5))&&(i1.u3.p8<2))&&(i1.u2.p9<3))&&(i2.u5.p11<3))&&(i2.u4.p13<1))&&(i0.u0.p1<3))&&(((((((((((i2.u5.p15>=5)||(i0.u0.p4>=4))||(i1.u2.p6>=5))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i1.u2.p10>=5))||(i1.u3.p8>=1))||(i2.u5.p11>=3))||(i2.u4.p12>=2))||(i0.u0.p1>=5))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))))),TRUE) * ((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i2.u5.p11>=5))||(i2.u5.p11>=3))||(i2.u5.p14>=3))||(i2.u4.p13>=2))||(i2.u4.p13>=1))||(i0.u0.p1>=3)))] = FALSE))
(forward)formula 4,0,0.214514,10212,1,0,10125,1757,1041,21132,213,5650,10373
FORMULA JoinFreeModules-PT-0003-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EG((((((((((i0.u0.p4>=4)||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u2.p10>=5))||(i2.u5.p11>=5))||(i2.u5.p14>=4))||(i2.u4.p13>=1)) + (((((((((((((((i0.u0.p5<5)&&(i0.u0.p4<4))&&(i0.u0.p4<3))&&(i1.u2.p6<5))&&(i0.u1.p3<1))&&(i2.u5.p11<5))&&(i2.u5.p11<3))&&(i2.u5.p14<4))&&(i0.u0.p1<5))&&(i1.u2.p6<3))&&(i1.u2.p10<5))&&(i1.u2.p9<3))&&(i2.u4.p12<2))&&(i2.u4.p13<1)) * ((((((((((((AX((((((((i0.u1.p2>=2)||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=3))||(i1.u3.p8>=2))||(i2.u4.p12>=2))||(i2.u4.p13>=2))) + (i1.u2.p10>=5)) + (i0.u0.p4>=3)) + (i0.u1.p3>=2)) + (i1.u3.p7>=2)) + (i1.u2.p9>=3)) + (i1.u3.p8>=1)) + (i2.u5.p11>=3)) + (i2.u5.p14>=3)) + (i2.u4.p13>=1)) + (i0.u0.p1>=3)) + ((((i0.u1.p3<2)&&(i1.u2.p9<4))&&(i1.u3.p8<2))&&((((((((((i0.u0.p4>=3)||(i0.u1.p3>=2))||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i1.u3.p8>=1))||(i2.u5.p15>=5))||(i2.u5.p14>=4))||(i2.u4.p12>=2)))) + (EG((((((((i0.u0.p4>=3)||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i2.u5.p15>=5))||(i2.u4.p13>=2))||(i2.u5.p14>=3))||(i2.u4.p13>=1))) * (((((((((((((i0.u1.p2>=2)||(i1.u2.p10>=5))||(i2.u5.p11>=5))||(i2.u5.p14>=4))||(i0.u0.p1>=5))||(i0.u0.p5>=5))||(i0.u0.p4>=4))||(i0.u1.p3>=2))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(i2.u5.p14>=3))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))))) + (!(AF(((((((((i1.u2.p6>=5)||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i1.u2.p9>=3))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u5.p14>=3))||(i2.u4.p13>=2)))) * (AG((((((((((i0.u0.p4>=4)||(i0.u0.p4>=3))||(i1.u3.p8>=2))||(i1.u2.p9>=3))||(i1.u3.p8>=1))||(i2.u5.p14>=4))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u4.p13>=1))||(i0.u0.p1>=3))) + AF((((i0.u1.p2>=2)||(i1.u3.p8>=1))||(i2.u5.p14>=3)))))))
=> equivalent forward existential formula: [FwdG(Init,(((((((((i0.u0.p4>=4)||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u2.p10>=5))||(i2.u5.p11>=5))||(i2.u5.p14>=4))||(i2.u4.p13>=1)) + (((((((((((((((i0.u0.p5<5)&&(i0.u0.p4<4))&&(i0.u0.p4<3))&&(i1.u2.p6<5))&&(i0.u1.p3<1))&&(i2.u5.p11<5))&&(i2.u5.p11<3))&&(i2.u5.p14<4))&&(i0.u0.p1<5))&&(i1.u2.p6<3))&&(i1.u2.p10<5))&&(i1.u2.p9<3))&&(i2.u4.p12<2))&&(i2.u4.p13<1)) * ((((((((((((!(EX(!((((((((i0.u1.p2>=2)||(i1.u2.p6>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=3))||(i1.u3.p8>=2))||(i2.u4.p12>=2))||(i2.u4.p13>=2))))) + (i1.u2.p10>=5)) + (i0.u0.p4>=3)) + (i0.u1.p3>=2)) + (i1.u3.p7>=2)) + (i1.u2.p9>=3)) + (i1.u3.p8>=1)) + (i2.u5.p11>=3)) + (i2.u5.p14>=3)) + (i2.u4.p13>=1)) + (i0.u0.p1>=3)) + ((((i0.u1.p3<2)&&(i1.u2.p9<4))&&(i1.u3.p8<2))&&((((((((((i0.u0.p4>=3)||(i0.u1.p3>=2))||(i1.u2.p6>=5))||(i0.u1.p3>=1))||(i1.u2.p9>=4))||(i1.u2.p9>=3))||(i1.u3.p8>=1))||(i2.u5.p15>=5))||(i2.u5.p14>=4))||(i2.u4.p12>=2)))) + (EG((((((((i0.u0.p4>=3)||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i2.u5.p15>=5))||(i2.u4.p13>=2))||(i2.u5.p14>=3))||(i2.u4.p13>=1))) * (((((((((((((i0.u1.p2>=2)||(i1.u2.p10>=5))||(i2.u5.p11>=5))||(i2.u5.p14>=4))||(i0.u0.p1>=5))||(i0.u0.p5>=5))||(i0.u0.p4>=4))||(i0.u1.p3>=2))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u4.p13>=2))||(i2.u5.p14>=3))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))))) + (!(!(EG(!(((((((((i1.u2.p6>=5)||(i1.u2.p6>=3))||(i1.u2.p9>=4))||(i1.u3.p8>=2))||(i1.u2.p9>=3))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u5.p14>=3))||(i2.u4.p13>=2)))))) * (!(E(TRUE U !((((((((((i0.u0.p4>=4)||(i0.u0.p4>=3))||(i1.u3.p8>=2))||(i1.u2.p9>=3))||(i1.u3.p8>=1))||(i2.u5.p14>=4))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u4.p13>=1))||(i0.u0.p1>=3))))) + !(EG(!((((i0.u1.p2>=2)||(i1.u3.p8>=1))||(i2.u5.p14>=3)))))))))] != FALSE
(forward)formula 5,1,0.297731,12588,1,0,14120,2017,1241,30992,229,6713,14222
FORMULA JoinFreeModules-PT-0003-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EX(A(!(A(E((((((((((i0.u1.p3>=1)||(i1.u2.p6>=3))||(i1.u2.p10>=5))||(i1.u3.p8>=2))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u4.p13>=2))||(i2.u4.p13>=1))||(i0.u0.p1>=3)) U ((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i2.u5.p14>=4))||(i2.u4.p13>=2))) U ((i1.u2.p9>=4)||(i0.u0.p1>=3)))) U EG(AF(((((((((((i1.u2.p6<5)&&(i0.u0.p4<3))&&(i1.u2.p9<4))&&(i1.u3.p7<2))&&(i1.u3.p8<2))&&(i2.u5.p11<3))&&(i2.u4.p12<2))&&(i2.u4.p13<1))&&(i0.u0.p1<5))&&(((i0.u1.p3<3)||(i1.u3.p8<3))||(i2.u4.p13<3)))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(EG(!(EG(!(((((((((((i1.u2.p6<5)&&(i0.u0.p4<3))&&(i1.u2.p9<4))&&(i1.u3.p7<2))&&(i1.u3.p8<2))&&(i2.u5.p11<3))&&(i2.u4.p12<2))&&(i2.u4.p13<1))&&(i0.u0.p1<5))&&(((i0.u1.p3<3)||(i1.u3.p8<3))||(i2.u4.p13<3))))))))))) * !(E(!(EG(!(EG(!(((((((((((i1.u2.p6<5)&&(i0.u0.p4<3))&&(i1.u2.p9<4))&&(i1.u3.p7<2))&&(i1.u3.p8<2))&&(i2.u5.p11<3))&&(i2.u4.p12<2))&&(i2.u4.p13<1))&&(i0.u0.p1<5))&&(((i0.u1.p3<3)||(i1.u3.p8<3))||(i2.u4.p13<3)))))))) U (!(!(!((E(!(((i1.u2.p9>=4)||(i0.u0.p1>=3))) U (!(E((((((((((i0.u1.p3>=1)||(i1.u2.p6>=3))||(i1.u2.p10>=5))||(i1.u3.p8>=2))||(i2.u4.p12>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u4.p13>=2))||(i2.u4.p13>=1))||(i0.u0.p1>=3)) U ((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i1.u3.p7>=2))||(i1.u2.p9>=4))||(i2.u5.p14>=4))||(i2.u4.p13>=2)))) * !(((i1.u2.p9>=4)||(i0.u0.p1>=3))))) + EG(!(((i1.u2.p9>=4)||(i0.u0.p1>=3)))))))) * !(EG(!(EG(!(((((((((((i1.u2.p6<5)&&(i0.u0.p4<3))&&(i1.u2.p9<4))&&(i1.u3.p7<2))&&(i1.u3.p8<2))&&(i2.u5.p11<3))&&(i2.u4.p12<2))&&(i2.u4.p13<1))&&(i0.u0.p1<5))&&(((i0.u1.p3<3)||(i1.u3.p8<3))||(i2.u4.p13<3))))))))))))] != FALSE
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 6,0,0.339479,14172,1,0,16650,2168,1341,36478,234,7131,16322
FORMULA JoinFreeModules-PT-0003-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX((((((i0.u1.p3>=2)||(i1.u2.p9>=4))||(i2.u5.p11>=3))||(i2.u5.p14>=3))||(i2.u4.p13>=1)))
=> equivalent forward existential formula: [(EY(Init) * (((((i0.u1.p3>=2)||(i1.u2.p9>=4))||(i2.u5.p11>=3))||(i2.u5.p14>=3))||(i2.u4.p13>=1)))] != FALSE
(forward)formula 7,1,0.340598,14172,1,0,16655,2168,1348,36486,234,7131,16327
FORMULA JoinFreeModules-PT-0003-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EG(((E(((((i1.u2.p6>=3)||(i1.u2.p9>=3))||(i2.u5.p11>=3))||(i2.u5.p14>=4)) U AX(((((((((i0.u1.p2>=2)||(i1.u2.p10>=5))||(i1.u2.p9>=3))||(i1.u3.p8>=1))||(i2.u5.p14>=4))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))&&(i0.u0.p1>=3)))) + !(EX(EG(((((((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i1.u2.p10>=5))||(i1.u3.p7>=2))||(i1.u3.p8>=2))||(i2.u5.p15>=5))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u4.p13>=2))||(i0.u0.p1>=5))||(i0.u0.p1>=3)))))) + (((i0.u0.p4<3)&&(i1.u2.p10<5))&&(i0.u0.p1<3)))) + A((((((((((((i0.u0.p5>=5)||(i1.u2.p6>=3))||(i1.u2.p10>=5))||(i1.u2.p9>=4))||(i2.u5.p11>=3))||(i2.u5.p15>=5))||(i2.u4.p13>=2))||(i2.u5.p14>=3))||(i0.u0.p1>=5)) + AG((((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i0.u1.p2>=2))||(i0.u0.p4>=3))||(i2.u5.p11>=5))||(i2.u5.p14>=4))||(i2.u5.p15>=5))||(i2.u4.p13>=2))||(i2.u4.p13>=1)))) + EF(((((((((i0.u0.p5<5)&&(i0.u1.p2<2))&&(i1.u3.p7<2))&&(i1.u2.p9<3))&&(i2.u5.p11<5))&&(i2.u4.p13<2))&&(i0.u0.p1<5))&&((((((((i0.u0.p4>=3)||(i1.u3.p7>=2))||(i2.u5.p11>=5))||(i1.u3.p8>=2))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u5.p14>=4))||(i2.u5.p14>=3))))) U (AX(((((((i0.u0.p4<4)&&(i0.u1.p3<1))&&(i0.u0.p5<5))&&(i0.u1.p2<2))&&(i0.u1.p3<1)) + EF((((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))) * !(AF(E((((i0.u0.p4>=3)||(i1.u2.p9>=3))||(i2.u5.p11>=3)) U (i1.u3.p8>=2)))))))
=> equivalent forward existential formula: ([FwdG(Init,((E(((((i1.u2.p6>=3)||(i1.u2.p9>=3))||(i2.u5.p11>=3))||(i2.u5.p14>=4)) U !(EX(!(((((((((i0.u1.p2>=2)||(i1.u2.p10>=5))||(i1.u2.p9>=3))||(i1.u3.p8>=1))||(i2.u5.p14>=4))||(i2.u4.p13>=2))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))&&(i0.u0.p1>=3)))))) + !(EX(EG(((((((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i1.u2.p10>=5))||(i1.u3.p7>=2))||(i1.u3.p8>=2))||(i2.u5.p15>=5))||(((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3)))||(i2.u4.p13>=2))||(i0.u0.p1>=5))||(i0.u0.p1>=3)))))) + (((i0.u0.p4<3)&&(i1.u2.p10<5))&&(i0.u0.p1<3))))] != FALSE + [((Init * !(EG(!((!(EX(!(((((((i0.u0.p4<4)&&(i0.u1.p3<1))&&(i0.u0.p5<5))&&(i0.u1.p2<2))&&(i0.u1.p3<1)) + E(TRUE U (((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))))) * !(!(EG(!(E((((i0.u0.p4>=3)||(i1.u2.p9>=3))||(i2.u5.p11>=3)) U (i1.u3.p8>=2))))))))))) * !(E(!((!(EX(!(((((((i0.u0.p4<4)&&(i0.u1.p3<1))&&(i0.u0.p5<5))&&(i0.u1.p2<2))&&(i0.u1.p3<1)) + E(TRUE U (((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))))) * !(!(EG(!(E((((i0.u0.p4>=3)||(i1.u2.p9>=3))||(i2.u5.p11>=3)) U (i1.u3.p8>=2)))))))) U (!((((((((((((i0.u0.p5>=5)||(i1.u2.p6>=3))||(i1.u2.p10>=5))||(i1.u2.p9>=4))||(i2.u5.p11>=3))||(i2.u5.p15>=5))||(i2.u4.p13>=2))||(i2.u5.p14>=3))||(i0.u0.p1>=5)) + !(E(TRUE U !((((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i0.u1.p2>=2))||(i0.u0.p4>=3))||(i2.u5.p11>=5))||(i2.u5.p14>=4))||(i2.u5.p15>=5))||(i2.u4.p13>=2))||(i2.u4.p13>=1)))))) + E(TRUE U ((((((((i0.u0.p5<5)&&(i0.u1.p2<2))&&(i1.u3.p7<2))&&(i1.u2.p9<3))&&(i2.u5.p11<5))&&(i2.u4.p13<2))&&(i0.u0.p1<5))&&((((((((i0.u0.p4>=3)||(i1.u3.p7>=2))||(i2.u5.p11>=5))||(i1.u3.p8>=2))||(i1.u2.p9>=3))||(i2.u4.p12>=2))||(i2.u5.p14>=4))||(i2.u5.p14>=3)))))) * !((!(EX(!(((((((i0.u0.p4<4)&&(i0.u1.p3<1))&&(i0.u0.p5<5))&&(i0.u1.p2<2))&&(i0.u1.p3<1)) + E(TRUE U (((i0.u1.p3>=3)&&(i1.u3.p8>=3))&&(i2.u4.p13>=3))))))) * !(!(EG(!(E((((i0.u0.p4>=3)||(i1.u2.p9>=3))||(i2.u5.p11>=3)) U (i1.u3.p8>=2))))))))))))] != FALSE)
(forward)formula 8,1,0.357697,14172,1,0,17564,2232,1401,38338,236,7366,16911
FORMULA JoinFreeModules-PT-0003-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1620840953479
--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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="JoinFreeModules-PT-0003"
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 JoinFreeModules-PT-0003, 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 r121-tall-162075406900386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 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 ;