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.r311-tall-162132108100258.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 TwoPhaseLocking-PT-nC00050vD, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108100258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.4K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC00050vD-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621451516079

Running Version 0
[2021-05-19 19:11:57] [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-19 19:11:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:11:57] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-19 19:11:57] [INFO ] Transformed 8 places.
[2021-05-19 19:11:57] [INFO ] Transformed 6 transitions.
[2021-05-19 19:11:57] [INFO ] Parsed PT model containing 8 places and 6 transitions in 68 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 24 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:11:58] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-19 19:11:58] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:11:58] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:11:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:11:58] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:11:58] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-19 19:11:58] [INFO ] Flatten gal took : 17 ms
[2021-05-19 19:11:58] [INFO ] Flatten gal took : 5 ms
[2021-05-19 19:11:58] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 209 steps, including 1 resets, run visited all 47 properties in 3 ms. (steps per millisecond=69 )
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 7 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
[2021-05-19 19:11:58] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:58] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:58] [INFO ] Input system was already deterministic with 5 transitions.
[2021-05-19 19:11:58] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:11:58] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12660128218773568761.gal : 0 ms
[2021-05-19 19:11:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17731609129812820854.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/CTLFireability12660128218773568761.gal, -t, CGAL, -ctl, /tmp/CTLFireability17731609129812820854.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/CTLFireability12660128218773568761.gal -t CGAL -ctl /tmp/CTLFireability17731609129812820854.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,64700,4.14479,82608,2,16407,5,371695,6,0,36,424065,0


Converting to forward existential form...Done !
original formula: AG(AF(((haveA2andB>=1)||((resA>=1)&&(Clients>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((haveA2andB>=1)||((resA>=1)&&(Clients>=1)))))] = FALSE
Hit Full ! (commute/partial/dont) 0/4/5
(forward)formula 0,0,5.16113,82608,1,0,8,371695,20,2,377,424065,8
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:12:03] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:03] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:03] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:12:03] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:03] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:12:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14344337062693050990.gal : 1 ms
[2021-05-19 19:12:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10327115211948073245.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/CTLFireability14344337062693050990.gal, -t, CGAL, -ctl, /tmp/CTLFireability10327115211948073245.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/CTLFireability14344337062693050990.gal -t CGAL -ctl /tmp/CTLFireability10327115211948073245.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,380015,7.12688,110136,2,25856,5,488804,6,0,41,570253,0


Converting to forward existential form...Done !
original formula: E(((haveA2>=1)||((((haveA2<1)&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(haveB<1)))) U ((((haveA2<1)&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))
=> equivalent forward existential formula: [(FwdU(Init,((haveA2>=1)||((((haveA2<1)&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(haveB<1))))) * ((((haveA2<1)&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/6
(forward)formula 0,1,7.2036,110136,1,0,10,488804,15,1,188,570253,4
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:12:10] [INFO ] Flatten gal took : 13 ms
[2021-05-19 19:12:10] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:10] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:12:10] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:10] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4153663927065432660.gal : 1 ms
[2021-05-19 19:12:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9048372357414793155.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/CTLFireability4153663927065432660.gal, -t, CGAL, -ctl, /tmp/CTLFireability9048372357414793155.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/CTLFireability4153663927065432660.gal -t CGAL -ctl /tmp/CTLFireability9048372357414793155.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,380015,7.09811,110600,2,25856,5,488804,6,0,41,570253,0


Converting to forward existential form...Done !
original formula: E(AF((AG((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))) * EF((AG(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))) * E((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U (((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))))) U AG(((((haveA2<1)&&(haveAandB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(haveB<1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((!(E(TRUE U !((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))))) * E(TRUE U (!(E(TRUE U !(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))))) * E((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U (((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))))) * !(E(TRUE U !(((((haveA2<1)&&(haveAandB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(haveB<1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/1/6
(forward)formula 0,0,26.7881,338220,1,0,105,1.39138e+06,48,69,467,1.7367e+06,184
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:12:37] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:37] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:37] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 105 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:12:37] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:37] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:37] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:12:37] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:37] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:12:37] [INFO ] Time to serialize gal into /tmp/CTLFireability582395307360386496.gal : 1 ms
[2021-05-19 19:12:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3703411673896262289.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/CTLFireability582395307360386496.gal, -t, CGAL, -ctl, /tmp/CTLFireability3703411673896262289.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/CTLFireability582395307360386496.gal -t CGAL -ctl /tmp/CTLFireability3703411673896262289.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,380015,6.90101,110328,2,25856,5,488804,6,0,41,570253,0


Converting to forward existential form...Done !
original formula: A((haveA2andB>=1) U !(EG((E(((haveA2>=1)||((resA>=1)&&(Clients>=1))) U A((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1)) U (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) * (((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + AF((haveAandB>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG((E(((haveA2>=1)||((resA>=1)&&(Clients>=1))) U !((E(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))) * !((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))) * (((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + !(EG(!((haveAandB>=1)))))))))))) * !(E(!(!(EG((E(((haveA2>=1)||((resA>=1)&&(Clients>=1))) U !((E(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))) * !((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))) * (((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + !(EG(!((haveAandB>=1))))))))) U (!((haveA2andB>=1)) * !(!(EG((E(((haveA2>=1)||((resA>=1)&&(Clients>=1))) U !((E(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))) * !((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))) * (((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + !(EG(!((haveAandB>=1)))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/1/6
Using saturation style SCC detection
Detected timeout of ITS tools.
[2021-05-19 19:13:07] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:13:07] [INFO ] Applying decomposition
[2021-05-19 19:13:07] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1415230564754439926.txt, -o, /tmp/graph1415230564754439926.bin, -w, /tmp/graph1415230564754439926.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/graph1415230564754439926.bin, -l, -1, -v, -w, /tmp/graph1415230564754439926.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:13:08] [INFO ] Decomposing Gal with order
[2021-05-19 19:13:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:13:08] [INFO ] Flatten gal took : 77 ms
[2021-05-19 19:13:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:13:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7840693579045433753.gal : 13 ms
[2021-05-19 19:13:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12851935047049205421.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/CTLFireability7840693579045433753.gal, -t, CGAL, -ctl, /tmp/CTLFireability12851935047049205421.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/CTLFireability7840693579045433753.gal -t CGAL -ctl /tmp/CTLFireability12851935047049205421.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:13:38] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:13:38] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:13:38] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:13:38] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:13:38] [INFO ] Flatten gal took : 16 ms
[2021-05-19 19:13:38] [INFO ] Time to serialize gal into /tmp/CTLFireability255432908748038471.gal : 1 ms
[2021-05-19 19:13:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15443194085874252999.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/CTLFireability255432908748038471.gal, -t, CGAL, -ctl, /tmp/CTLFireability15443194085874252999.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/CTLFireability255432908748038471.gal -t CGAL -ctl /tmp/CTLFireability15443194085874252999.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,380015,6.88837,110412,2,25856,5,488804,6,0,41,570253,0


Converting to forward existential form...Done !
original formula: EF(!(AG(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),TRUE) * !(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))))] != FALSE
(forward)formula 0,1,7.82219,110412,1,0,8,488804,10,2,302,570253,3
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:13:46] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:13:46] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:13:46] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:13:46] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:13:46] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:13:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4350876337434745614.gal : 0 ms
[2021-05-19 19:13:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17238579539271563058.ctl : 13 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/CTLFireability4350876337434745614.gal, -t, CGAL, -ctl, /tmp/CTLFireability17238579539271563058.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/CTLFireability4350876337434745614.gal -t CGAL -ctl /tmp/CTLFireability17238579539271563058.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,380015,6.82629,110280,2,25856,5,488804,6,0,41,570253,0


Converting to forward existential form...Done !
original formula: AG((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))) + (((haveAandB>=1)||(haveA2andB>=1)) * (!(AG(((resA>=1)&&(haveB>=1)))) + !(EG(((resA>=1)&&(haveB>=1))))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))) * !(((haveAandB>=1)||(haveA2andB>=1))))] = FALSE * [FwdG(((FwdU(Init,TRUE) * !(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))) * !(!(!(E(TRUE U !(((resA>=1)&&(haveB>=1)))))))),((resA>=1)&&(haveB>=1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/1/6
(forward)formula 0,0,11.4331,125892,1,0,25,584461,44,14,457,635887,26
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-19 19:13:57] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:13:57] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:13:57] [INFO ] Applying decomposition
[2021-05-19 19:13:57] [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/graph5138095076814810132.txt, -o, /tmp/graph5138095076814810132.bin, -w, /tmp/graph5138095076814810132.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/graph5138095076814810132.bin, -l, -1, -v, -w, /tmp/graph5138095076814810132.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:13:57] [INFO ] Decomposing Gal with order
[2021-05-19 19:13:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:13:57] [INFO ] Flatten gal took : 17 ms
[2021-05-19 19:13:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-19 19:13:57] [INFO ] Time to serialize gal into /tmp/CTLFireability9291685325887600874.gal : 0 ms
[2021-05-19 19:13:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14307158203111510783.ctl : 3 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/CTLFireability9291685325887600874.gal, -t, CGAL, -ctl, /tmp/CTLFireability14307158203111510783.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/CTLFireability9291685325887600874.gal -t CGAL -ctl /tmp/CTLFireability14307158203111510783.ctl
No direction supplied, using forward translation only.
Parsed 10 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,380015,1050.54,2098444,10830,4304,772308,4739,30,7.02484e+06,16,6.73898e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-19 19:34:36] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:34:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14953890199191040515.gal : 0 ms
[2021-05-19 19:34:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3242366348513132741.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/CTLFireability14953890199191040515.gal, -t, CGAL, -ctl, /tmp/CTLFireability3242366348513132741.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/CTLFireability14953890199191040515.gal -t CGAL -ctl /tmp/CTLFireability3242366348513132741.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 10 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,380015,6.94765,110252,2,25856,5,488804,6,0,41,570253,0


Converting to forward existential form...Done !
original formula: AG(!(A(EX(!(E((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)) U ((haveA2>=1)||((resB>=1)&&(haveA>=1)))))) U (AX((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))) + AG((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((!(EX(!((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))))) + !(E(TRUE U !((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))))) * !(E(!((!(EX(!((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))))) + !(E(TRUE U !((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))))) U (!(EX(!(E((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)) U ((haveA2>=1)||((resB>=1)&&(haveA>=1))))))) * !((!(EX(!((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))))) + !(E(TRUE U !((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/1/6
Using saturation style SCC detection
(forward)formula 0,0,65.0527,816840,1,0,114,3.40768e+06,46,78,472,3.82541e+06,186
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!(EF(((((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&((resA<1)||(Clients<1)))&&(haveA2andB<1))&&((resA<1)||(haveB<1))) * E(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))) U ((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) * AX((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))) + !(EG(AX((E(((((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U ((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * ((((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))||(haveAandB>=1)))))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U ((((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&((resA<1)||(Clients<1)))&&(haveA2andB<1))&&((resA<1)||(haveB<1))) * E(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))) U ((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) * !(EX(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))))),!(EX(!((E(((((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U ((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * ((((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))||(haveAandB>=1)))))))] = FALSE
(forward)formula 1,1,65.2451,819744,1,0,122,3.41211e+06,62,82,484,3.83803e+06,207
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EX((AF((haveA2andB>=1)) + AF(((resA>=1)&&(haveB>=1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!((haveA2andB>=1)))))] != FALSE + [(EY(Init) * !(EG(!(((resA>=1)&&(haveB>=1))))))] != FALSE)
(forward)formula 2,1,92.2059,1205088,1,0,1711,5.11029e+06,74,905,484,5.96636e+06,2324
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EX(AG(AF(((haveA2andB>=1) + (A(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U (((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) * ((((((haveA2andB>=1)||(haveA2>=1))||(haveAandB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(((haveA2andB>=1) + (!((E(!((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) * !((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))) * ((((((haveA2andB>=1)||(haveA2>=1))||(haveAandB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))))))] != FALSE
Using saturation style SCC detection
(forward)formula 3,0,92.5273,1208520,1,0,1712,5.11253e+06,83,908,491,5.99388e+06,2342
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(((A(E(((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))) U AF((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) U ((((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))&&(((((((((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + EG(((resB>=1)&&(haveA>=1))))) * (((AF((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))&&(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) + AG(((resA>=1)&&(haveB>=1)))) + (((((((haveA2<1)&&(haveAandB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))&&((resB<1)||(haveA<1)))&&((resA<1)||(haveB<1)))) + ((((haveA2<1)&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(Clients<1))))) * ((EX(A(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1)) U ((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + A(((((((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)) * EG((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) U ((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1))))) + (((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))) * (AX(((((((((resA>=1)&&(Clients>=1))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) + (A((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1))) U (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * (haveAandB>=1)))))))
=> equivalent forward existential formula: ((([(((FwdU(FwdU(Init,TRUE),!(((((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))&&(((((((((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + EG(((resB>=1)&&(haveA>=1)))))) * !(E(((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))) U !(EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))) * !((((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))&&(((((((((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))) * !(EG(((resB>=1)&&(haveA>=1)))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(((((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))&&(((((((((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + EG(((resB>=1)&&(haveA>=1))))))] = FALSE) * [(FwdU((((FwdU(Init,TRUE) * !(((((haveA2<1)&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(Clients<1))))) * !((((((((haveA2<1)&&(haveAandB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))&&((resB<1)||(haveA<1)))&&((resA<1)||(haveB<1))))) * !(!(EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))&&(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))),TRUE) * !(((resA>=1)&&(haveB>=1))))] = FALSE) * ([((FwdU(Init,TRUE) * !((EX(!((E(!(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))) * !(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))) + !((E(!(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))) U (!(((((((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)) * EG((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) * !(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))))) + EG(!(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))))))))) * !(((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))] = FALSE * [(EY(((FwdU(Init,TRUE) * !((EX(!((E(!(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))) * !(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))) + !((E(!(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))) U (!(((((((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)) * EG((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) * !(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))))) + EG(!(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))))))))) * !((!((E(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) U (!((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))) * !((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))) + EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))) * (haveAandB>=1))))) * !(((((((((resA>=1)&&(Clients>=1))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))] = FALSE))
(forward)formula 4,0,93.0687,1221652,1,0,1771,5.11681e+06,113,922,517,6.00673e+06,2528
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(E((((haveA2<1)&&(haveAandB<1))&&(haveA2andB<1)) U (!(AF(((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1)))&&((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))) + (!(E(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U ((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) * !(AF((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))))))))
=> equivalent forward existential formula: [(EY(Init) * !(E((((haveA2<1)&&(haveAandB<1))&&(haveA2andB<1)) U (!(!(EG(!(((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1)))&&((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))))) + (!(E(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U ((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) * !(!(EG(!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1)))))))))))] = FALSE
(forward)formula 5,0,94.4222,1254124,1,0,2386,5.14651e+06,129,1245,523,6.04146e+06,3446
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(EF((AX(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * (((resB<1)||(haveA<1))||(((((haveA2<1)&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(EX(!(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))) * (((resB<1)||(haveA<1))||(((((haveA2<1)&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))))))] = FALSE
(forward)formula 6,1,98.3752,1286784,1,0,2388,5.29283e+06,130,1246,524,6.21373e+06,3449
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG((!(A(AF(EX((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1))))) U (((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))) + (AX(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) * A(AF((haveAandB>=1)) U (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))&&((haveA2>=1)||((resA>=1)&&(haveB>=1))))))))
=> equivalent forward existential formula: [FwdG(Init,(!(!((E(!((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))) U (!(!(EG(!(EX((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1)))))))) * !((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))) + EG(!((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))))) + (!(EX(!(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) * !((E(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))&&((haveA2>=1)||((resA>=1)&&(haveB>=1))))) U (!(!(EG(!((haveAandB>=1))))) * !((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))&&((haveA2>=1)||((resA>=1)&&(haveB>=1))))))) + EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))&&((haveA2>=1)||((resA>=1)&&(haveB>=1)))))))))))] != FALSE
Using saturation style SCC detection
(forward)formula 7,1,132.288,1636096,1,0,3725,6.34718e+06,151,2149,533,8.41497e+06,5234
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(!(EF((AX(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * ((haveA2>=1)||((resA>=1)&&(haveB>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(EX(!(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))) * ((haveA2>=1)||((resA>=1)&&(haveB>=1)))))))] != FALSE
(forward)formula 8,1,132.305,1636360,1,0,3726,6.34718e+06,152,2150,533,8.41497e+06,5239
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A((haveA2andB>=1) U !(EG((E(((haveA2>=1)||((resA>=1)&&(Clients>=1))) U A((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1)) U (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) * (((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + AF((haveAandB>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG((E(((haveA2>=1)||((resA>=1)&&(Clients>=1))) U !((E(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))) * !((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))) * (((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + !(EG(!((haveAandB>=1)))))))))))) * !(E(!(!(EG((E(((haveA2>=1)||((resA>=1)&&(Clients>=1))) U !((E(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))) * !((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))) * (((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + !(EG(!((haveAandB>=1))))))))) U (!((haveA2andB>=1)) * !(!(EG((E(((haveA2>=1)||((resA>=1)&&(Clients>=1))) U !((E(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))) * !((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))) * (((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + !(EG(!((haveAandB>=1)))))))))))))] != FALSE
Using saturation style SCC detection
(forward)formula 9,0,148.712,1830824,1,0,3851,7.17683e+06,169,2259,545,9.67886e+06,5391
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1621453027065

--------------------
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="TwoPhaseLocking-PT-nC00050vD"
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 TwoPhaseLocking-PT-nC00050vD, 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 r311-tall-162132108100258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00050vD.tgz
mv TwoPhaseLocking-PT-nC00050vD execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;