Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814100316.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 Dekker-PT-015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814100316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 141K Apr 27 14:36 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 Dekker-PT-015-CTLFireability-00
FORMULA_NAME Dekker-PT-015-CTLFireability-01
FORMULA_NAME Dekker-PT-015-CTLFireability-02
FORMULA_NAME Dekker-PT-015-CTLFireability-03
FORMULA_NAME Dekker-PT-015-CTLFireability-04
FORMULA_NAME Dekker-PT-015-CTLFireability-05
FORMULA_NAME Dekker-PT-015-CTLFireability-06
FORMULA_NAME Dekker-PT-015-CTLFireability-07
FORMULA_NAME Dekker-PT-015-CTLFireability-08
FORMULA_NAME Dekker-PT-015-CTLFireability-09
FORMULA_NAME Dekker-PT-015-CTLFireability-10
FORMULA_NAME Dekker-PT-015-CTLFireability-11
FORMULA_NAME Dekker-PT-015-CTLFireability-12
FORMULA_NAME Dekker-PT-015-CTLFireability-13
FORMULA_NAME Dekker-PT-015-CTLFireability-14
FORMULA_NAME Dekker-PT-015-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590110869762

[2020-05-22 01:27:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 01:27:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:27:52] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-05-22 01:27:52] [INFO ] Transformed 75 places.
[2020-05-22 01:27:52] [INFO ] Transformed 255 transitions.
[2020-05-22 01:27:52] [INFO ] Found NUPN structural information;
[2020-05-22 01:27:52] [INFO ] Parsed PT model containing 75 places and 255 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 353 ms. (steps per millisecond=283 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-22 01:27:52] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2020-05-22 01:27:52] [INFO ] Computed 45 place invariants in 9 ms
[2020-05-22 01:27:52] [INFO ] [Real]Absence check using 30 positive place invariants in 49 ms returned sat
[2020-05-22 01:27:52] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 12 ms returned sat
[2020-05-22 01:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:52] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-05-22 01:27:52] [INFO ] State equation strengthened by 15 read => feed constraints.
[2020-05-22 01:27:52] [INFO ] [Real]Added 15 Read/Feed constraints in 4 ms returned sat
[2020-05-22 01:27:52] [INFO ] Deduced a trap composed of 5 places in 47 ms
[2020-05-22 01:27:52] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:27:52] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:27:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 134 ms
[2020-05-22 01:27:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2020-05-22 01:27:52] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:52] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2020-05-22 01:27:52] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-05-22 01:27:53] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2020-05-22 01:27:53] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-05-22 01:27:53] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-05-22 01:27:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 65 ms
[2020-05-22 01:27:53] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 25 ms.
[2020-05-22 01:27:53] [INFO ] Added : 16 causal constraints over 4 iterations in 102 ms. Result :sat
[2020-05-22 01:27:53] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-05-22 01:27:53] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:53] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-22 01:27:53] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2020-05-22 01:27:53] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 24 ms.
[2020-05-22 01:27:53] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
[2020-05-22 01:27:53] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-05-22 01:27:53] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-05-22 01:27:53] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:53] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-05-22 01:27:53] [INFO ] [Real]Added 15 Read/Feed constraints in 14 ms returned sat
[2020-05-22 01:27:53] [INFO ] Deduced a trap composed of 5 places in 11 ms
[2020-05-22 01:27:53] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-05-22 01:27:53] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:27:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 59 ms
[2020-05-22 01:27:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-05-22 01:27:53] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 15 ms returned sat
[2020-05-22 01:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:53] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-05-22 01:27:53] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-05-22 01:27:53] [INFO ] Deduced a trap composed of 5 places in 47 ms
[2020-05-22 01:27:53] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-05-22 01:27:53] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-05-22 01:27:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 79 ms
[2020-05-22 01:27:53] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2020-05-22 01:27:53] [INFO ] Added : 16 causal constraints over 4 iterations in 53 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-22 01:27:54] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-22 01:27:54] [INFO ] Flatten gal took : 99 ms
[2020-05-22 01:27:54] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-22 01:27:54] [INFO ] Flatten gal took : 23 ms
FORMULA Dekker-PT-015-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:27:54] [INFO ] Applying decomposition
[2020-05-22 01:27:54] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph13300354747789565968.txt, -o, /tmp/graph13300354747789565968.bin, -w, /tmp/graph13300354747789565968.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13300354747789565968.bin, -l, -1, -v, -w, /tmp/graph13300354747789565968.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:27:54] [INFO ] Decomposing Gal with order
[2020-05-22 01:27:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:27:54] [INFO ] Removed a total of 641 redundant transitions.
[2020-05-22 01:27:54] [INFO ] Flatten gal took : 102 ms
[2020-05-22 01:27:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2020-05-22 01:27:54] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 4 ms
[2020-05-22 01:27:54] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
built 106 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
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,278528,0.044772,5476,47,15,443,171,364,385,40,209,0


Converting to forward existential form...Done !
original formula: EF((((((u4.flag_1_5==1)&&(i13.u8.flag_1_10==1))&&(u4.p1_5==1)) * EG((((u6.flag_1_8==1)&&(i13.u8.flag_1_10==1))&&(u6.p1_8==1)))) * (EG((((u0.flag_1_1==1)&&(u3.flag_1_4==1))&&(u3.p1_4==1))) + AG(((i14.u9.flag_1_11==1)&&(i14.u17.p3_11==1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * ((((u4.flag_1_5==1)&&(i13.u8.flag_1_10==1))&&(u4.p1_5==1)) * EG((((u6.flag_1_8==1)&&(i13.u8.flag_1_10==1))&&(u6.p1_8==1))))),(((u0.flag_1_1==1)&&(u3.flag_1_4==1))&&(u3.p1_4==1)))] != FALSE + [((FwdU(Init,TRUE) * ((((u4.flag_1_5==1)&&(i13.u8.flag_1_10==1))&&(u4.p1_5==1)) * EG((((u6.flag_1_8==1)&&(i13.u8.flag_1_10==1))&&(u6.p1_8==1))))) * !(E(TRUE U !(((i14.u9.flag_1_11==1)&&(i14.u17.p3_11==1))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions u0.exit_1, u1.exit_2, u3.exit_4, u4.exit_5, u5.exit_7, u6.exit_8, u7.exit_9, u11.exit_13, u12.exit_14, u13.exit_0, u15.exit_6, i2.exit_3, i8.exit_12, i13.exit_10, i14.exit_11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/240/15/255
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,0.150546,7296,1,0,6078,171,2565,4001,299,209,10106
FORMULA Dekker-PT-015-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A(AG((((u15.flag_1_6==1)&&(u12.flag_1_14==1))&&(u12.p1_14==1))) U (((u1.flag_1_2!=1)||(u15.flag_1_6!=1))||(u1.p1_2!=1))) * EF(((((((u0.flag_1_1==1)&&(i13.u8.flag_1_10==1))&&(i13.u16.p1_10==1))&&(u13.flag_1_0==1))&&(i2.u14.flag_1_3==1))&&(u13.p1_0==1))))
=> equivalent forward existential formula: [(FwdU((Init * !((E(!((((u1.flag_1_2!=1)||(u15.flag_1_6!=1))||(u1.p1_2!=1))) U (!(!(E(TRUE U !((((u15.flag_1_6==1)&&(u12.flag_1_14==1))&&(u12.p1_14==1)))))) * !((((u1.flag_1_2!=1)||(u15.flag_1_6!=1))||(u1.p1_2!=1))))) + EG(!((((u1.flag_1_2!=1)||(u15.flag_1_6!=1))||(u1.p1_2!=1))))))),TRUE) * ((((((u0.flag_1_1==1)&&(i13.u8.flag_1_10==1))&&(i13.u16.p1_10==1))&&(u13.flag_1_0==1))&&(i2.u14.flag_1_3==1))&&(u13.p1_0==1)))] != FALSE
(forward)formula 1,1,0.171063,7824,1,0,6686,171,3032,5001,305,209,12252
FORMULA Dekker-PT-015-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG(EF((((u3.flag_1_4==1)&&(u7.flag_1_9==1))&&(u3.p1_4==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u3.flag_1_4==1)&&(u7.flag_1_9==1))&&(u3.p1_4==1)))))] != FALSE
(forward)formula 2,0,0.185875,8088,1,0,6820,171,3037,5139,305,209,12580
FORMULA Dekker-PT-015-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (((AG(EF((((u0.flag_1_1==1)&&(u15.flag_1_6==1))&&(u15.p1_6==1)))) + EG((((u15.flag_1_6==1)&&(u7.flag_1_9==1))&&(u7.p1_9==1)))) + E(((((u1.flag_1_2==1)&&(u11.flag_1_13==1))&&(u1.p1_2==1))||(((u6.flag_1_8==1)&&(i13.u8.flag_1_10==1))&&(i13.u16.p1_10==1))) U (((i14.u9.flag_1_11==1)&&(i8.u10.flag_1_12==1))&&(i8.u18.p1_12==1)))) + E(((((((u15.flag_1_6==1)&&(u7.flag_1_9==1))&&(u15.p1_6==1))&&(u13.flag_1_0==1))&&(u5.flag_1_7==1))&&(u5.p1_7==1)) U ((((((u7.flag_1_9==1)&&(i8.u10.flag_1_12==1))&&(i8.u18.p1_12==1))&&(u5.flag_1_7==1))&&(i13.u8.flag_1_10==1))&&(i13.u16.p1_10==1))))
=> equivalent forward existential formula: [(FwdU((((Init * !(E(((((((u15.flag_1_6==1)&&(u7.flag_1_9==1))&&(u15.p1_6==1))&&(u13.flag_1_0==1))&&(u5.flag_1_7==1))&&(u5.p1_7==1)) U ((((((u7.flag_1_9==1)&&(i8.u10.flag_1_12==1))&&(i8.u18.p1_12==1))&&(u5.flag_1_7==1))&&(i13.u8.flag_1_10==1))&&(i13.u16.p1_10==1))))) * !(E(((((u1.flag_1_2==1)&&(u11.flag_1_13==1))&&(u1.p1_2==1))||(((u6.flag_1_8==1)&&(i13.u8.flag_1_10==1))&&(i13.u16.p1_10==1))) U (((i14.u9.flag_1_11==1)&&(i8.u10.flag_1_12==1))&&(i8.u18.p1_12==1))))) * !(EG((((u15.flag_1_6==1)&&(u7.flag_1_9==1))&&(u7.p1_9==1))))),TRUE) * !(E(TRUE U (((u0.flag_1_1==1)&&(u15.flag_1_6==1))&&(u15.p1_6==1)))))] = FALSE
(forward)formula 3,1,0.186843,8088,1,0,6821,171,3043,5142,305,209,12664
FORMULA Dekker-PT-015-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF((((u0.flag_1_1!=1)||(u6.flag_1_8!=1))||(u6.p1_8!=1))) * (E(((((u15.flag_1_6==1)&&(u6.flag_1_8==1))&&(u6.p1_8==1))||(((u13.flag_1_0==1)&&(u7.flag_1_9==1))&&(u7.p1_9==1))) U ((((((u4.flag_1_5==1)&&(i13.u8.flag_1_10==1))&&(u4.p1_5==1))&&(i2.u14.flag_1_3==1))&&(u6.flag_1_8==1))&&(i2.u2.p1_3==1))) + AG(EF((((u0.flag_1_1==1)&&(u6.flag_1_8==1))&&(u6.p1_8==1))))))
=> equivalent forward existential formula: ([FwdG(Init,!((((u0.flag_1_1!=1)||(u6.flag_1_8!=1))||(u6.p1_8!=1))))] = FALSE * [(FwdU((Init * !(E(((((u15.flag_1_6==1)&&(u6.flag_1_8==1))&&(u6.p1_8==1))||(((u13.flag_1_0==1)&&(u7.flag_1_9==1))&&(u7.p1_9==1))) U ((((((u4.flag_1_5==1)&&(i13.u8.flag_1_10==1))&&(u4.p1_5==1))&&(i2.u14.flag_1_3==1))&&(u6.flag_1_8==1))&&(i2.u2.p1_3==1))))),TRUE) * !(E(TRUE U (((u0.flag_1_1==1)&&(u6.flag_1_8==1))&&(u6.p1_8==1)))))] = FALSE)
(forward)formula 4,1,0.189323,8352,1,0,6913,171,3065,5272,305,209,12939
FORMULA Dekker-PT-015-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((!(EG(((((((u6.flag_1_8==1)&&(u11.flag_1_13==1))&&(u6.p1_8==1))&&(u3.flag_1_4==1))&&(u5.flag_1_7==1))&&(u5.p1_7==1)))) * !(EF(AX((((u15.flag_1_6==1)&&(i14.u9.flag_1_11==1))&&(i14.u17.p1_11==1)))))) * !(EX((((u6.flag_1_8==1)&&(i13.u8.flag_1_10==1))&&(u6.p1_8==1)))))
=> equivalent forward existential formula: (([FwdG(Init,((((((u6.flag_1_8==1)&&(u11.flag_1_13==1))&&(u6.p1_8==1))&&(u3.flag_1_4==1))&&(u5.flag_1_7==1))&&(u5.p1_7==1)))] = FALSE * [(FwdU(Init,TRUE) * !(EX(!((((u15.flag_1_6==1)&&(i14.u9.flag_1_11==1))&&(i14.u17.p1_11==1))))))] = FALSE) * [(EY(Init) * (((u6.flag_1_8==1)&&(i13.u8.flag_1_10==1))&&(u6.p1_8==1)))] = FALSE)
(forward)formula 5,1,0.192689,8352,1,0,6952,171,3100,5325,305,209,13241
FORMULA Dekker-PT-015-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((((((((((((((((((((AX(((((((u3.flag_1_4==1)&&(u11.flag_1_13==1))&&(u3.p1_4==1))&&(u5.flag_1_7==1))&&(u11.flag_1_13==1))&&(u11.p1_13==1))) + AF((((i2.u14.flag_1_3==1)&&(u15.flag_1_6==1))&&(i2.u2.p1_3==1)))) + (u13.flag_0_0!=1)) + (u0.flag_0_1!=1)) + (u1.flag_0_2!=1)) + (i2.u2.flag_0_3!=1)) + (u3.flag_0_4!=1)) + (u4.flag_0_5!=1)) + (u15.flag_0_6!=1)) + (u5.flag_0_7!=1)) + (u6.flag_0_8!=1)) + (u7.flag_0_9!=1)) + (i13.u8.flag_0_10!=1)) + (i14.u9.flag_0_11!=1)) + (u11.flag_0_13!=1)) + (u12.flag_0_14!=1)) + (i8.u18.p1_12!=1)) + (u1.flag_1_2!=1)) + (u6.flag_1_8!=1)) + (u6.p1_8!=1)))
=> equivalent forward existential formula: [FwdG((((((((((((((((((((FwdU(Init,TRUE) * !((u6.p1_8!=1))) * !((u6.flag_1_8!=1))) * !((u1.flag_1_2!=1))) * !((i8.u18.p1_12!=1))) * !((u12.flag_0_14!=1))) * !((u11.flag_0_13!=1))) * !((i14.u9.flag_0_11!=1))) * !((i13.u8.flag_0_10!=1))) * !((u7.flag_0_9!=1))) * !((u6.flag_0_8!=1))) * !((u5.flag_0_7!=1))) * !((u15.flag_0_6!=1))) * !((u4.flag_0_5!=1))) * !((u3.flag_0_4!=1))) * !((i2.u2.flag_0_3!=1))) * !((u1.flag_0_2!=1))) * !((u0.flag_0_1!=1))) * !((u13.flag_0_0!=1))) * !(!(EX(!(((((((u3.flag_1_4==1)&&(u11.flag_1_13==1))&&(u3.p1_4==1))&&(u5.flag_1_7==1))&&(u11.flag_1_13==1))&&(u11.p1_13==1))))))),!((((i2.u14.flag_1_3==1)&&(u15.flag_1_6==1))&&(i2.u2.p1_3==1))))] = FALSE
(forward)formula 6,1,0.199007,8352,1,0,7269,171,3164,5979,306,209,14024
FORMULA Dekker-PT-015-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(E((((u0.flag_1_1==1)&&(u0.p3_1==1))||(((u4.flag_1_5==1)&&(u11.flag_1_13==1))&&(u11.p1_13==1))) U (((i2.u14.flag_1_3==1)&&(u11.flag_1_13==1))&&(i2.u2.p1_3==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E((((u0.flag_1_1==1)&&(u0.p3_1==1))||(((u4.flag_1_5==1)&&(u11.flag_1_13==1))&&(u11.p1_13==1))) U (((i2.u14.flag_1_3==1)&&(u11.flag_1_13==1))&&(i2.u2.p1_3==1)))))] = FALSE
(forward)formula 7,0,0.214727,8616,1,0,8355,171,3370,7313,309,209,16337
FORMULA Dekker-PT-015-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590110875180

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Dekker-PT-015"
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"

# 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 Dekker-PT-015, 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 r066-tajo-158922814100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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