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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.8K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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-nC00050vN-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621451664022

Running Version 0
[2021-05-19 19:14:25] [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:14:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:14:25] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-19 19:14:25] [INFO ] Transformed 8 places.
[2021-05-19 19:14:25] [INFO ] Transformed 6 transitions.
[2021-05-19 19:14:25] [INFO ] Parsed PT model containing 8 places and 6 transitions in 53 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 7 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:14:25] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-19 19:14:25] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:14:25] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-19 19:14:25] [INFO ] Implicit Places using invariants and state equation in 21 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:14:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:14:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-19 19:14:25] [INFO ] Flatten gal took : 25 ms
[2021-05-19 19:14:26] [INFO ] Flatten gal took : 7 ms
[2021-05-19 19:14:26] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=414 ) properties (out of 63) seen :56
Running SMT prover for 7 properties.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:14:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:14:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:14:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-19 19:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-19 19:14:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:14:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-19 19:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:14:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:14:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:14:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:14:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:14:26] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-19 19:14:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:14:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2021-05-19 19:14:26] [INFO ] Initial state test concluded for 1 properties.
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Applied a total of 0 rules in 4 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:14:26] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:14:26] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:26] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:14:26] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:26] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5376644480667441444.gal : 1 ms
[2021-05-19 19:14:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9462794063389207614.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/CTLFireability5376644480667441444.gal, -t, CGAL, -ctl, /tmp/CTLFireability9462794063389207614.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/CTLFireability5376644480667441444.gal -t CGAL -ctl /tmp/CTLFireability9462794063389207614.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,403741,7.0442,115152,2,26885,5,512000,6,0,41,598989,0


Converting to forward existential form...Done !
original formula: (AF((EG((haveAandB>=1)) * ((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + AF((haveAandB>=1)))
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!((EG((haveAandB>=1)) * ((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))))),!((haveAandB>=1)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,14.6451,173516,1,0,11,842311,31,3,418,889774,9
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-00 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:14:41] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:41] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:41] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:14:41] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:41] [INFO ] Flatten gal took : 7 ms
[2021-05-19 19:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1393787155640934303.gal : 1 ms
[2021-05-19 19:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4011389663224233783.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/CTLFireability1393787155640934303.gal, -t, CGAL, -ctl, /tmp/CTLFireability4011389663224233783.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/CTLFireability1393787155640934303.gal -t CGAL -ctl /tmp/CTLFireability4011389663224233783.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,403741,6.96273,115220,2,26885,5,512000,6,0,41,598989,0


Converting to forward existential form...Done !
original formula: EF((((((haveAandB<1)&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((haveAandB<1)&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))] != FALSE
(forward)formula 0,1,7.02699,115220,1,0,7,512000,8,1,63,598989,1
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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:14:48] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:48] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:48] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:14:48] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:48] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:14:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11776471427812099355.gal : 1 ms
[2021-05-19 19:14:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10335228729897093921.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/CTLFireability11776471427812099355.gal, -t, CGAL, -ctl, /tmp/CTLFireability10335228729897093921.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/CTLFireability11776471427812099355.gal -t CGAL -ctl /tmp/CTLFireability10335228729897093921.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,403741,7.32573,115164,2,26885,5,512000,6,0,41,598989,0


Converting to forward existential form...Done !
original formula: E(((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1))) * (((AF((haveA2>=1)) + (haveA2andB>=1)) + ((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(haveB>=1)))) U (((((haveAandB<1)&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))
=> equivalent forward existential formula: [(FwdU(Init,((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1))) * (((!(EG(!((haveA2>=1)))) + (haveA2andB>=1)) + ((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(haveB>=1))))) * (((((haveAandB<1)&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-19 19:15:18] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:15:18] [INFO ] Applying decomposition
[2021-05-19 19:15:18] [INFO ] Flatten gal took : 1 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/graph389337775924048378.txt, -o, /tmp/graph389337775924048378.bin, -w, /tmp/graph389337775924048378.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/graph389337775924048378.bin, -l, -1, -v, -w, /tmp/graph389337775924048378.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:15:18] [INFO ] Decomposing Gal with order
[2021-05-19 19:15:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:15:18] [INFO ] Flatten gal took : 19 ms
[2021-05-19 19:15:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-19 19:15:18] [INFO ] Time to serialize gal into /tmp/CTLFireability13555416403981022759.gal : 0 ms
[2021-05-19 19:15:18] [INFO ] Time to serialize properties into /tmp/CTLFireability1947026897368762976.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/CTLFireability13555416403981022759.gal, -t, CGAL, -ctl, /tmp/CTLFireability1947026897368762976.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/CTLFireability13555416403981022759.gal -t CGAL -ctl /tmp/CTLFireability1947026897368762976.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-19 19:15:48] [INFO ] Flatten gal took : 23 ms
[2021-05-19 19:15:48] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:15:48] [INFO ] Applying decomposition
[2021-05-19 19:15:48] [INFO ] Flatten gal took : 2 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/graph12764607855189730979.txt, -o, /tmp/graph12764607855189730979.bin, -w, /tmp/graph12764607855189730979.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/graph12764607855189730979.bin, -l, -1, -v, -w, /tmp/graph12764607855189730979.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:15:48] [INFO ] Decomposing Gal with order
[2021-05-19 19:15:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:15:48] [INFO ] Flatten gal took : 7 ms
[2021-05-19 19:15:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:15:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14351797113052070121.gal : 0 ms
[2021-05-19 19:15:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15775700308888985234.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/CTLFireability14351797113052070121.gal, -t, CGAL, -ctl, /tmp/CTLFireability15775700308888985234.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/CTLFireability14351797113052070121.gal -t CGAL -ctl /tmp/CTLFireability15775700308888985234.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,403741,1181.97,2236004,11559,4706,841778,5197,32,8.54059e+06,17,8.28876e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-19 19:36:15] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:36:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6152198358409991104.gal : 0 ms
[2021-05-19 19:36:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5519530281034376495.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/CTLFireability6152198358409991104.gal, -t, CGAL, -ctl, /tmp/CTLFireability5519530281034376495.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/CTLFireability6152198358409991104.gal -t CGAL -ctl /tmp/CTLFireability5519530281034376495.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,403741,6.62596,115180,2,26885,5,512000,6,0,41,598989,0


Converting to forward existential form...Done !
original formula: AG(EX(AG(A(((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resB>=1)&&(haveA>=1))) U ((((((haveAandB>=1)||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))&&((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U !(!((E(!(((((((haveAandB>=1)||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))&&((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) U (!(((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resB>=1)&&(haveA>=1)))) * !(((((((haveAandB>=1)||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))&&((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))) + EG(!(((((((haveAandB>=1)||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))&&((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,9.2088,115180,1,0,6,512000,26,0,434,598989,6
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A(AX((((((haveA2<1)&&(haveA2andB<1))||((((haveAandB<1)&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))||((((((haveA2<1)&&(haveAandB<1))&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))||(((haveAandB<1)&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))) U EG(((haveA2andB>=1)||((resA>=1)&&(haveB>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(((haveA2andB>=1)||((resA>=1)&&(haveB>=1)))))))) * !(E(!(EG(((haveA2andB>=1)||((resA>=1)&&(haveB>=1))))) U (!(!(EX(!((((((haveA2<1)&&(haveA2andB<1))||((((haveAandB<1)&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))||((((((haveA2<1)&&(haveAandB<1))&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))||(((haveAandB<1)&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))))))) * !(EG(((haveA2andB>=1)||((resA>=1)&&(haveB>=1)))))))))] != FALSE
Using saturation style SCC detection
(forward)formula 1,1,13.0944,157528,1,0,26,729683,40,15,461,813139,21
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF((AX(EF(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))) * AG((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(E(TRUE U ((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))))) * !(E(TRUE U !((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))))))] = FALSE
(forward)formula 2,0,18.5397,237416,1,0,27,995459,46,15,480,1.15084e+06,27
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AG((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))) + (!(EX(TRUE)) * !(EF(((resB>=1)&&(haveA>=1))))))
=> equivalent forward existential formula: ([(EY((Init * !(!(E(TRUE U !((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1))))))))) * TRUE)] = FALSE * [(FwdU((Init * !(!(E(TRUE U !((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))))))),TRUE) * ((resB>=1)&&(haveA>=1)))] = FALSE)
(forward)formula 3,0,27.958,414052,1,0,30,1.99494e+06,49,16,481,2.27316e+06,31
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX((AX(!(AG(A((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)) U (((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))) + ((E((AF(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) + EG(((haveA2>=1)||(haveA2andB>=1)))) U ((((haveA2<1)&&(haveAandB<1))&&((resA<1)||(Clients<1)))&&(haveA2andB<1))) * ((((haveAandB>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * (((haveAandB>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(haveB>=1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(!(!(E(TRUE U !(!((E(!((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))) * !((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))))))))))] != FALSE + [(FwdU(((EY(Init) * (((haveAandB>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(haveB>=1)))) * ((((haveAandB>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))),(!(EG(!(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(((haveA2>=1)||(haveA2andB>=1))))) * ((((haveA2<1)&&(haveAandB<1))&&((resA<1)||(Clients<1)))&&(haveA2andB<1)))] != FALSE)
(forward)formula 4,1,28.2721,420124,1,0,37,2.00872e+06,79,20,508,2.30682e+06,42
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AX((!(A(AX(((resA>=1)&&(haveB>=1))) U AX((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))) * (!(A(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))&&(haveA2andB>=1)) U EF(((haveA2>=1)||((resB>=1)&&(haveA>=1)))))) + ((!(AF((haveA2andB>=1))) * (haveAandB<1)) * ((resA<1)||(haveB<1))))))
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(!(EX(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))))) * !(E(!(!(EX(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))))) U (!(!(EX(!(((resA>=1)&&(haveB>=1)))))) * !(!(EX(!((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&(((haveAandB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))))))] = FALSE * [(((EY(Init) * !(((!(!(EG(!((haveA2andB>=1))))) * (haveAandB<1)) * ((resA<1)||(haveB<1))))) * !(EG(!(E(TRUE U ((haveA2>=1)||((resB>=1)&&(haveA>=1)))))))) * !(E(!(E(TRUE U ((haveA2>=1)||((resB>=1)&&(haveA>=1))))) U (!(((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))&&(haveA2andB>=1))) * !(E(TRUE U ((haveA2>=1)||((resB>=1)&&(haveA>=1)))))))))] = FALSE)
(forward)formula 5,0,35.6541,556580,1,0,41,2.64651e+06,95,21,514,2.90322e+06,48
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(!(EG(!(AF((haveA2>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EG(!((haveA2>=1))))))] = FALSE
(forward)formula 6,1,44.8694,675940,1,0,42,3.10591e+06,106,21,517,3.33926e+06,49
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(!(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] != FALSE
(forward)formula 7,0,44.8695,675940,1,0,42,3.10591e+06,106,21,517,3.33926e+06,49
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(!(A(AG((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U AX((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))
=> equivalent forward existential formula: ([(EY((FwdU(FwdU(Init,TRUE),!(!(EX(!((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))) * !(!(E(TRUE U !((((((haveA2>=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)))))] != FALSE + [FwdG(FwdU(Init,TRUE),!(!(EX(!((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))))] != FALSE)
(forward)formula 8,1,44.8929,677788,1,0,46,3.1062e+06,112,25,521,3.34024e+06,59
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E(((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1))) * (((AF((haveA2>=1)) + (haveA2andB>=1)) + ((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(haveB>=1)))) U (((((haveAandB<1)&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))
=> equivalent forward existential formula: [(FwdU(Init,((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1))) * (((!(EG(!((haveA2>=1)))) + (haveA2andB>=1)) + ((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(haveB>=1))))) * (((((haveAandB<1)&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))] != FALSE
(forward)formula 9,0,75.1901,1157272,1,0,421,4.79455e+06,119,423,521,6.35425e+06,653
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!(EF(((haveA2>=1)||((resB>=1)&&(haveA>=1))))) + (AX(EF(AG(E(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U (((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1))))))) * AX(AX(((((haveAandB>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))))
=> equivalent forward existential formula: ([(EY((Init * !(!(E(TRUE U ((haveA2>=1)||((resB>=1)&&(haveA>=1)))))))) * !(E(TRUE U !(E(TRUE U !(E(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U (((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1))))))))))] = FALSE * [(EY(EY((Init * !(!(E(TRUE U ((haveA2>=1)||((resB>=1)&&(haveA>=1))))))))) * !(((((haveAandB>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))] = FALSE)
Hit Full ! (commute/partial/dont) 0/0/6
(forward)formula 10,0,79.046,1218976,1,0,425,5.03032e+06,128,426,529,6.62866e+06,660
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1))) * (!(AG((((haveAandB<1)&&(haveA2andB<1))&&(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))) + !(AX((EF((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * A(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))) U ((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))))) U !(AF((EX(EX((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)))) * ((haveA2>=1) + EX((haveA2>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!((EX(EX((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)))) * ((haveA2>=1) + EX((haveA2>=1)))))))))))) * !(E(!(!(!(EG(!((EX(EX((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)))) * ((haveA2>=1) + EX((haveA2>=1))))))))) U (!(((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1))) * (!(!(E(TRUE U !((((haveAandB<1)&&(haveA2andB<1))&&(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))))) + !(!(EX(!((E(TRUE U (((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * !((E(!(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U (!(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) * !(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) + EG(!(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))))))))))) * !(!(!(EG(!((EX(EX((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)))) * ((haveA2>=1) + EX((haveA2>=1)))))))))))))] != FALSE
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 0/6/6
(forward)formula 11,0,83.0471,1257908,1,0,435,5.17239e+06,145,435,563,6.81754e+06,678
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A((((((((EF(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + AG(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1))))) + (EG(((haveAandB>=1)&&(((resB>=1)&&(haveA>=1))||(haveAandB>=1)))) * EF((((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))&&(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))))) + (haveA2>=1)) + (haveA2andB>=1)) * (!(AG(((resB>=1)&&(haveA>=1)))) + !(EG((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))) * (((resA>=1)&&(haveB>=1)) + !(AF(((((haveA2>=1)||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))) * EX(((haveA2andB>=1)&&(haveAandB>=1)))) U (((((AX((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))) * (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + EX(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + EF((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + !(A(AF(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) U ((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1))))) * EG((!(A((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))) U (haveAandB>=1))) + (((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!((((((!(EX(!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))))) * (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + EX(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + E(TRUE U (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + !(!((E(!(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1))) U (!(!(EG(!(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))) * !(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1))))) + EG(!(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1)))))))) * EG((!(!((E(!((haveAandB>=1)) U (!((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * !((haveAandB>=1)))) + EG(!((haveAandB>=1)))))) + (((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))))))))) * !(E(!((((((!(EX(!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))))) * (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + EX(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + E(TRUE U (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + !(!((E(!(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1))) U (!(!(EG(!(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))) * !(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1))))) + EG(!(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1)))))))) * EG((!(!((E(!((haveAandB>=1)) U (!((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * !((haveAandB>=1)))) + EG(!((haveAandB>=1)))))) + (((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1))))))) U (!((((((((E(TRUE U ((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + !(E(TRUE U !(((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1))))))) + (EG(((haveAandB>=1)&&(((resB>=1)&&(haveA>=1))||(haveAandB>=1)))) * E(TRUE U (((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))&&(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))))) + (haveA2>=1)) + (haveA2andB>=1)) * (!(!(E(TRUE U !(((resB>=1)&&(haveA>=1)))))) + !(EG((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))) * (((resA>=1)&&(haveB>=1)) + !(!(EG(!(((((haveA2>=1)||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))))) * EX(((haveA2andB>=1)&&(haveAandB>=1))))) * !((((((!(EX(!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))))) * (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + EX(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + E(TRUE U (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + !(!((E(!(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1))) U (!(!(EG(!(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))) * !(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1))))) + EG(!(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||(haveAandB>=1)))))))) * EG((!(!((E(!((haveAandB>=1)) U (!((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * !((haveAandB>=1)))) + EG(!((haveAandB>=1)))))) + (((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))))))))))] != FALSE
Hit Full ! (commute/partial/dont) 4/0/2
Using saturation style SCC detection
(forward)formula 12,0,89.5126,1374716,1,0,447,5.6352e+06,188,445,595,7.36968e+06,702
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621453066421

--------------------
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-nC00050vN"
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-nC00050vN, 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-162132108100266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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