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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.9K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 11 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 11 18:03 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-nC00020vN-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621451475941

Running Version 0
[2021-05-19 19:11:17] [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:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:11:17] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-19 19:11:17] [INFO ] Transformed 8 places.
[2021-05-19 19:11:17] [INFO ] Transformed 6 transitions.
[2021-05-19 19:11:17] [INFO ] Parsed PT model containing 8 places and 6 transitions in 54 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 8 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:17] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-19 19:11:17] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:11:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:11:17] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:11:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:11:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-19 19:11:18] [INFO ] Flatten gal took : 20 ms
[2021-05-19 19:11:18] [INFO ] Flatten gal took : 6 ms
[2021-05-19 19:11:18] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 100001 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=363 ) properties (out of 66) seen :54
Running SMT prover for 12 properties.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:11:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-19 19:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-19 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned unsat
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-19 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-19 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-19 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-19 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-19 19:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-19 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:11:18] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:11:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
[2021-05-19 19:11:18] [INFO ] Initial state test concluded for 2 properties.
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-13 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:11:18] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:11:18] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:18] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:11:18] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:11:18] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:11:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16722613234387747932.gal : 1 ms
[2021-05-19 19:11:18] [INFO ] Time to serialize properties into /tmp/CTLFireability7548089110011704232.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/CTLFireability16722613234387747932.gal, -t, CGAL, -ctl, /tmp/CTLFireability7548089110011704232.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/CTLFireability16722613234387747932.gal -t CGAL -ctl /tmp/CTLFireability7548089110011704232.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,7997,0.153943,8784,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: E(((((((haveA2>=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)))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||(haveAandB>=1)) U AF((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1)))) + AF(((((resB<1)||(haveA<1))&&(haveAandB<1))&&((resA<1)||(haveB<1))))) + EG(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) + (haveA2>=1)) + (haveAandB>=1)) + ((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(Clients>=1))) + ((resA>=1)&&(haveB>=1)))) U EG(((haveAandB<1)&&((resA<1)||(haveB<1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,((((((haveA2>=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)))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||(haveAandB>=1)) U !(EG(!((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1)))))) + !(EG(!(((((resB<1)||(haveA<1))&&(haveAandB<1))&&((resA<1)||(haveB<1))))))) + EG(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) + (haveA2>=1)) + (haveAandB>=1)) + ((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(Clients>=1))) + ((resA>=1)&&(haveB>=1))))),((haveAandB<1)&&((resA<1)||(haveB<1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/6
Hit Full ! (commute/partial/dont) 1/4/5
(forward)formula 0,0,0.901955,26268,1,0,172,101311,59,169,333,142203,266
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5 transition count 3
Applied a total of 6 rules in 4 ms. Remains 5 /8 variables (removed 3) and now considering 3/6 (removed 3) transitions.
[2021-05-19 19:11:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 19:11:19] [INFO ] Flatten gal took : 1 ms
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:11:19] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:19] [INFO ] Input system was already deterministic with 3 transitions.
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:11:19] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:19] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:19] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:11:19] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:19] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11981140531201073367.gal : 0 ms
[2021-05-19 19:11:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15483908138073742078.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/CTLFireability11981140531201073367.gal, -t, CGAL, -ctl, /tmp/CTLFireability15483908138073742078.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/CTLFireability11981140531201073367.gal -t CGAL -ctl /tmp/CTLFireability15483908138073742078.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,7997,0.151833,8876,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: EF((E(AF(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))) U AG((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1)))) * ((((((E(((haveAandB>=1)||((resA>=1)&&(Clients>=1))) U ((((resB>=1)&&(haveA>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) + (haveA2>=1)) + (haveAandB>=1)) + ((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(Clients>=1))) + ((resA>=1)&&(haveB>=1))) + (((((haveA2andB<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))&&((resB<1)||(haveA<1))))))
=> equivalent forward existential formula: (((((([(FwdU((FwdU(Init,TRUE) * E(!(EG(!(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))) U !(E(TRUE U !((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))))))),((haveAandB>=1)||((resA>=1)&&(Clients>=1)))) * ((((resB>=1)&&(haveA>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))] != FALSE + [((FwdU(Init,TRUE) * E(!(EG(!(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))) U !(E(TRUE U !((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))))))) * (haveA2>=1))] != FALSE) + [((FwdU(Init,TRUE) * E(!(EG(!(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))) U !(E(TRUE U !((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))))))) * (haveAandB>=1))] != FALSE) + [((FwdU(Init,TRUE) * E(!(EG(!(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))) U !(E(TRUE U !((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))))))) * ((resB>=1)&&(haveA>=1)))] != FALSE) + [((FwdU(Init,TRUE) * E(!(EG(!(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))) U !(E(TRUE U !((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))))))) * ((resA>=1)&&(Clients>=1)))] != FALSE) + [((FwdU(Init,TRUE) * E(!(EG(!(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))) U !(E(TRUE U !((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))))))) * ((resA>=1)&&(haveB>=1)))] != FALSE) + [((FwdU(Init,TRUE) * E(!(EG(!(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))) U !(E(TRUE U !((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))))))) * (((((haveA2andB<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))&&((resB<1)||(haveA<1))))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.361068,12428,1,0,21,36319,38,0,303,36426,16
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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:11:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:11:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:20] [INFO ] Input system was already deterministic with 6 transitions.
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:11:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 19:11:20] [INFO ] Flatten gal took : 1 ms
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:11:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:20] [INFO ] Input system was already deterministic with 6 transitions.
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:11:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:20] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:11:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14305662077417557197.gal : 0 ms
[2021-05-19 19:11:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9649173889360085724.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/CTLFireability14305662077417557197.gal, -t, CGAL, -ctl, /tmp/CTLFireability9649173889360085724.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/CTLFireability14305662077417557197.gal -t CGAL -ctl /tmp/CTLFireability9649173889360085724.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,7997,0.161304,8820,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: AG((E(AF(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) U ((((((haveA2>=1)||(haveA2andB>=1))&&(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))&&(((haveA2andB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))&&(resA>=1))&&(haveB>=1))) + (AG(EF(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))) * EG((((AG(((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(Clients>=1))) + (haveA2andB>=1)) + ((resA>=1)&&(haveB>=1)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(E(!(EG(!(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))) U ((((((haveA2>=1)||(haveA2andB>=1))&&(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))&&(((haveA2andB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))&&(resA>=1))&&(haveB>=1))))),TRUE) * !(E(TRUE U ((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))))] = FALSE * [((FwdU(Init,TRUE) * !(E(!(EG(!(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))) U ((((((haveA2>=1)||(haveA2andB>=1))&&(((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))&&(((haveA2andB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))&&(resA>=1))&&(haveB>=1))))) * !(EG((((!(E(TRUE U !(((resB>=1)&&(haveA>=1))))) + ((resA>=1)&&(Clients>=1))) + (haveA2andB>=1)) + ((resA>=1)&&(haveB>=1))))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.68105,21676,1,0,16,83161,35,3,311,88763,18
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-19 19:11:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 19:11:20] [INFO ] Flatten gal took : 2 ms
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:11:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:11:20] [INFO ] Applying decomposition
[2021-05-19 19:11:20] [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/graph18049428352997736115.txt, -o, /tmp/graph18049428352997736115.bin, -w, /tmp/graph18049428352997736115.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/graph18049428352997736115.bin, -l, -1, -v, -w, /tmp/graph18049428352997736115.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:11:21] [INFO ] Decomposing Gal with order
[2021-05-19 19:11:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:11:21] [INFO ] Flatten gal took : 21 ms
[2021-05-19 19:11:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:11:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9539323870324494394.gal : 1 ms
[2021-05-19 19:11:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11928171448138660699.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/CTLFireability9539323870324494394.gal, -t, CGAL, -ctl, /tmp/CTLFireability11928171448138660699.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/CTLFireability9539323870324494394.gal -t CGAL -ctl /tmp/CTLFireability11928171448138660699.ctl
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,2.0776,33688,1179,553,25202,672,30,110904,16,99721,0


Converting to forward existential form...Done !
original formula: EF((((!(AX((((u0.resA>=1)&&(u1.Clients>=1))||((u0.resA>=1)&&(u2.haveB>=1))))) * !(EF((u1.haveA2>=1)))) * ((u0.resA<1)||(u1.Clients<1))) * ((u0.resA<1)||(u2.haveB<1))))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((u0.resA<1)||(u2.haveB<1))) * ((u0.resA<1)||(u1.Clients<1))) * !(!(EX(!((((u0.resA>=1)&&(u1.Clients>=1))||((u0.resA>=1)&&(u2.haveB>=1)))))))) * !(E(TRUE U (u1.haveA2>=1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.75614,34072,1,0,25202,6166,75,111230,115,112280,13031
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AF(EX((((((u1.haveA2>=1)||(u2.haveA2andB>=1))||((u2.resB>=1)&&(u0.haveA>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))||((u0.resA>=1)&&(u1.Clients>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX((((((u1.haveA2>=1)||(u2.haveA2andB>=1))||((u2.resB>=1)&&(u0.haveA>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))||((u0.resA>=1)&&(u1.Clients>=1))))))] = FALSE
(forward)formula 1,1,3.60251,38560,1,0,31704,6907,112,129649,115,121761,50563
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(EX((((((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u0.haveAandB<1))&&(u2.haveA2andB<1))&&((u0.resA<1)||(u2.haveB<1))))) * AG(!(EF(AG((((((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u2.haveA2andB<1))&&((u0.resA<1)||(u1.Clients<1)))&&((u0.resA<1)||(u2.haveB<1))))))))
=> equivalent forward existential formula: ([(EY(Init) * (((((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u0.haveAandB<1))&&(u2.haveA2andB<1))&&((u0.resA<1)||(u2.haveB<1))))] = FALSE * [(FwdU(FwdU(Init,TRUE),TRUE) * !(E(TRUE U !((((((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u2.haveA2andB<1))&&((u0.resA<1)||(u1.Clients<1)))&&((u0.resA<1)||(u2.haveB<1)))))))] = FALSE)
(forward)formula 2,1,3.67292,39352,1,0,32090,6907,143,129743,118,121762,53138
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF(!(AF((((u1.haveA2>=1)||((u0.resA>=1)&&(u2.haveB>=1)))||((((u1.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))&&((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u0.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))))))) U A(((((u1.haveA2<1)&&(u0.haveAandB<1))&&(u2.haveA2andB<1))&&((u0.resA<1)||(u1.Clients<1))) U (AF(AX(((u0.resA>=1)&&(u2.haveB>=1)))) * EX(((((u2.resB>=1)&&(u0.haveA>=1))||(u0.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))))))
=> equivalent forward existential formula: [((FwdU(Init,E(TRUE U !(!(EG(!((((u1.haveA2>=1)||((u0.resA>=1)&&(u2.haveB>=1)))||((((u1.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))&&((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u0.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))))))) * !(EG(!((!(EG(!(!(EX(!(((u0.resA>=1)&&(u2.haveB>=1)))))))) * EX(((((u2.resB>=1)&&(u0.haveA>=1))||(u0.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1))))))))) * !(E(!((!(EG(!(!(EX(!(((u0.resA>=1)&&(u2.haveB>=1)))))))) * EX(((((u2.resB>=1)&&(u0.haveA>=1))||(u0.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))))) U (!(((((u1.haveA2<1)&&(u0.haveAandB<1))&&(u2.haveA2andB<1))&&((u0.resA<1)||(u1.Clients<1)))) * !((!(EG(!(!(EX(!(((u0.resA>=1)&&(u2.haveB>=1)))))))) * EX(((((u2.resB>=1)&&(u0.haveA>=1))||(u0.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1))))))))))] != FALSE
(forward)formula 3,0,5.40337,55984,1,0,52395,10422,185,149611,118,129071,96231
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EX(!(E((EX(((((u1.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) * AF(((u0.haveAandB>=1)||((u0.resA>=1)&&(u1.Clients>=1))))) U (!(EF((((((u2.resB>=1)&&(u0.haveA>=1))||(u0.haveAandB>=1))||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1))))) * !(E((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u0.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))) U (((((u1.haveA2>=1)||(u0.haveAandB>=1))||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))))
=> equivalent forward existential formula: [(EY(Init) * !(E((EX(((((u1.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) * !(EG(!(((u0.haveAandB>=1)||((u0.resA>=1)&&(u1.Clients>=1))))))) U (!(E(TRUE U (((((u2.resB>=1)&&(u0.haveA>=1))||(u0.haveAandB>=1))||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1))))) * !(E((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u0.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))) U (((((u1.haveA2>=1)||(u0.haveAandB>=1))||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))))))] = FALSE
(forward)formula 4,0,5.71192,57040,1,0,52971,10588,205,150537,118,129416,98489
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(AG((((((((EF((((u1.haveA2>=1)||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) + (u1.haveA2>=1)) + (u0.haveAandB>=1)) + (u2.haveA2andB>=1)) + (AX((((u1.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) * (((((u1.haveA2>=1)||(u2.haveA2andB>=1))||((u2.resB>=1)&&(u0.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))) + ((u2.resB>=1)&&(u0.haveA>=1))) + ((u0.resA>=1)&&(u2.haveB>=1))) * (EF((((u2.resB>=1)&&(u0.haveA>=1))||(u0.haveAandB>=1))) + (!(EG((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveA2andB>=1)))) * (((((u1.haveA2>=1)||(u0.haveAandB>=1))||(u2.haveA2andB>=1))||((u2.resB>=1)&&(u0.haveA>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((((((((E(TRUE U (((u1.haveA2>=1)||(u2.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) + (u1.haveA2>=1)) + (u0.haveAandB>=1)) + (u2.haveA2andB>=1)) + (!(EX(!((((u1.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) * (((((u1.haveA2>=1)||(u2.haveA2andB>=1))||((u2.resB>=1)&&(u0.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))) + ((u2.resB>=1)&&(u0.haveA>=1))) + ((u0.resA>=1)&&(u2.haveB>=1))) * (E(TRUE U (((u2.resB>=1)&&(u0.haveA>=1))||(u0.haveAandB>=1))) + (!(EG((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveA2andB>=1)))) * (((((u1.haveA2>=1)||(u0.haveAandB>=1))||(u2.haveA2andB>=1))||((u2.resB>=1)&&(u0.haveA>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))))] != FALSE
(forward)formula 5,1,6.34825,59680,1,0,55451,12653,214,154291,118,133581,100041
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((!(EG(AG(EX(((u2.resB>=1)&&(u0.haveA>=1)))))) * EF(!(AF(((u0.resA>=1)&&(u1.Clients>=1)))))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(E(TRUE U !(EX(((u2.resB>=1)&&(u0.haveA>=1)))))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((u0.resA>=1)&&(u1.Clients>=1)))))))))] = FALSE)
(forward)formula 6,0,6.94739,64960,1,0,63822,12667,219,162140,118,133613,120342
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621451488945

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

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