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-158922814200332.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-050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814200332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.5K 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.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 1.5M 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-050-CTLFireability-00
FORMULA_NAME Dekker-PT-050-CTLFireability-01
FORMULA_NAME Dekker-PT-050-CTLFireability-02
FORMULA_NAME Dekker-PT-050-CTLFireability-03
FORMULA_NAME Dekker-PT-050-CTLFireability-04
FORMULA_NAME Dekker-PT-050-CTLFireability-05
FORMULA_NAME Dekker-PT-050-CTLFireability-06
FORMULA_NAME Dekker-PT-050-CTLFireability-07
FORMULA_NAME Dekker-PT-050-CTLFireability-08
FORMULA_NAME Dekker-PT-050-CTLFireability-09
FORMULA_NAME Dekker-PT-050-CTLFireability-10
FORMULA_NAME Dekker-PT-050-CTLFireability-11
FORMULA_NAME Dekker-PT-050-CTLFireability-12
FORMULA_NAME Dekker-PT-050-CTLFireability-13
FORMULA_NAME Dekker-PT-050-CTLFireability-14
FORMULA_NAME Dekker-PT-050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590111053230

[2020-05-22 01:30:55] [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:30:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:30:55] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2020-05-22 01:30:55] [INFO ] Transformed 250 places.
[2020-05-22 01:30:55] [INFO ] Transformed 2600 transitions.
[2020-05-22 01:30:55] [INFO ] Found NUPN structural information;
[2020-05-22 01:30:55] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 272 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 805 ms. (steps per millisecond=124 ) properties seen :[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, 0]
[2020-05-22 01:30:56] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-05-22 01:30:56] [INFO ] Computed 150 place invariants in 11 ms
[2020-05-22 01:30:56] [INFO ] [Real]Absence check using 100 positive place invariants in 55 ms returned sat
[2020-05-22 01:30:56] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 14 ms returned sat
[2020-05-22 01:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:56] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-05-22 01:30:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-05-22 01:30:56] [INFO ] [Real]Added 50 Read/Feed constraints in 25 ms returned sat
[2020-05-22 01:30:56] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 89 ms.
[2020-05-22 01:30:56] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
[2020-05-22 01:30:57] [INFO ] [Real]Absence check using 100 positive place invariants in 34 ms returned sat
[2020-05-22 01:30:57] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 16 ms returned sat
[2020-05-22 01:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:57] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-22 01:30:57] [INFO ] [Real]Added 50 Read/Feed constraints in 15 ms returned sat
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 5 places in 39 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 6 places in 22 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:30:57] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:30:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 513 ms
[2020-05-22 01:30:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:30:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 38 ms returned sat
[2020-05-22 01:30:57] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 13 ms returned sat
[2020-05-22 01:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:58] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-05-22 01:30:58] [INFO ] [Nat]Added 50 Read/Feed constraints in 14 ms returned sat
[2020-05-22 01:30:58] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-05-22 01:30:58] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-05-22 01:30:58] [INFO ] Deduced a trap composed of 5 places in 50 ms
[2020-05-22 01:30:58] [INFO ] Deduced a trap composed of 5 places in 26 ms
[2020-05-22 01:30:58] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:30:58] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:30:58] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-05-22 01:30:58] [INFO ] Deduced a trap composed of 6 places in 38 ms
[2020-05-22 01:30:58] [INFO ] Deduced a trap composed of 4 places in 153 ms
[2020-05-22 01:30:59] [INFO ] Deduced a trap composed of 4 places in 303 ms
[2020-05-22 01:30:59] [INFO ] Deduced a trap composed of 6 places in 39 ms
[2020-05-22 01:30:59] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-05-22 01:30:59] [INFO ] Deduced a trap composed of 4 places in 180 ms
[2020-05-22 01:30:59] [INFO ] Deduced a trap composed of 6 places in 23 ms
[2020-05-22 01:30:59] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:30:59] [INFO ] Deduced a trap composed of 6 places in 204 ms
[2020-05-22 01:30:59] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-05-22 01:30:59] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:30:59] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1822 ms
[2020-05-22 01:31:00] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 92 ms.
[2020-05-22 01:31:00] [INFO ] Added : 51 causal constraints over 11 iterations in 434 ms. Result :sat
[2020-05-22 01:31:01] [INFO ] Flatten gal took : 391 ms
[2020-05-22 01:31:01] [INFO ] Flatten gal took : 155 ms
[2020-05-22 01:31:01] [INFO ] Applying decomposition
[2020-05-22 01:31:01] [INFO ] Flatten gal took : 272 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/graph6045996734303116999.txt, -o, /tmp/graph6045996734303116999.bin, -w, /tmp/graph6045996734303116999.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/graph6045996734303116999.bin, -l, -1, -v, -w, /tmp/graph6045996734303116999.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:31:02] [INFO ] Decomposing Gal with order
[2020-05-22 01:31:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:31:02] [INFO ] Removed a total of 8180 redundant transitions.
[2020-05-22 01:31:03] [INFO ] Flatten gal took : 300 ms
[2020-05-22 01:31:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 76 ms.
[2020-05-22 01:31:03] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 33 ms
[2020-05-22 01:31:03] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 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 16 CTL formulae.
built 1226 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.
built 6 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.
built 6 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.
built 6 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.
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,2.92734e+16,0.422111,13248,118,15,1603,1361,2856,1403,40,1834,0


Converting to forward existential form...Done !
original formula: AG(EF(((((u60.flag_1_28==1)&&(u68.flag_1_48==1))&&(u60.p1_28==1))&&(((u29.flag_1_32!=1)||(u43.flag_1_46!=1))||(u43.p1_46!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((u60.flag_1_28==1)&&(u68.flag_1_48==1))&&(u60.p1_28==1))&&(((u29.flag_1_32!=1)||(u43.flag_1_46!=1))||(u43.p1_46!=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions u1.exit_1, u2.exit_2, u6.exit_5, u11.exit_10, u12.exit_11, u16.exit_14, u19.exit_17, u20.exit_18, u22.exit_20, u25.exit_25, u26.exit_27, u29.exit_32, u33.exit_36, u35.exit_38, u36.exit_39, u38.exit_41, u39.exit_42, u40.exit_43, u41.exit_44, u42.exit_45, u43.exit_46, u44.exit_47, u48.exit_7, u55.exit_21, u56.exit_22, u59.exit_26, u60.exit_28, u61.exit_29, u64.exit_33, u68.exit_48, i0.exit_0, i3.exit_3, i4.exit_4, i6.exit_6, i9.exit_12, i11.exit_15, i12.exit_16, i15.exit_19, i20.exit_35, i22.exit_37, i25.exit_40, i33.exit_49, i35.exit_8, i36.exit_9, i37.exit_13, i40.exit_23, i41.exit_24, i45.exit_30, i46.exit_31, i48.exit_34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2550/50/2600
(forward)formula 0,1,1.93683,55992,1,0,156314,1361,20560,73271,370,1834,199790
FORMULA Dekker-PT-050-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((EF((((u48.flag_1_7==1)&&(i20.u32.flag_1_35==1))&&(u48.p1_7==1))) + A(((((((((((((((((((((((((((((((((((((((((((((((((((i0.u0.flag_0_0==1)&&(u1.flag_0_1==1))&&(u2.flag_0_2==1))&&(i3.u3.flag_0_3==1))&&(i4.u4.flag_0_4==1))&&(u6.flag_0_5==1))&&(i6.u7.flag_0_6==1))&&(u48.flag_0_7==1))&&(i35.u9.flag_0_8==1))&&(i36.u10.flag_0_9==1))&&(u11.flag_0_10==1))&&(i9.u13.flag_0_12==1))&&(i37.u15.flag_0_13==1))&&(u16.flag_0_14==1))&&(i11.u17.flag_0_15==1))&&(i12.u18.flag_0_16==1))&&(u19.flag_0_17==1))&&(u20.flag_0_18==1))&&(i15.u21.flag_0_19==1))&&(u22.flag_0_20==1))&&(u55.flag_0_21==1))&&(u56.flag_0_22==1))&&(i40.u23.flag_0_23==1))&&(i41.u24.flag_0_24==1))&&(u25.flag_0_25==1))&&(u59.flag_0_26==1))&&(u26.flag_0_27==1))&&(u60.flag_0_28==1))&&(u61.flag_0_29==1))&&(i45.u27.flag_0_30==1))&&(i46.u28.flag_0_31==1))&&(u29.flag_0_32==1))&&(u64.flag_0_33==1))&&(i48.u30.flag_0_34==1))&&(i20.u31.flag_0_35==1))&&(u33.flag_0_36==1))&&(i22.u34.flag_0_37==1))&&(u35.flag_0_38==1))&&(u36.flag_0_39==1))&&(i25.u37.flag_0_40==1))&&(u38.flag_0_41==1))&&(u39.flag_0_42==1))&&(u40.flag_0_43==1))&&(u41.flag_0_44==1))&&(u42.flag_0_45==1))&&(u43.flag_0_46==1))&&(u44.flag_0_47==1))&&(u68.flag_0_48==1))&&(i33.u45.flag_0_49==1))&&(u12.p1_11==1)) U (((u42.flag_1_45==1)&&(u68.flag_1_48==1))&&(u42.p1_45==1)))) + (((i41.u58.flag_1_24==1)&&(u43.flag_1_46==1))&&(u43.p1_46==1))) + (((u61.flag_1_29==1)&&(u36.flag_1_39==1))&&(u61.p1_29==1))) + ((((((u60.flag_1_28==1)&&(u44.flag_1_47==1))&&(u44.p1_47==1))&&(i40.u57.flag_1_23==1))&&(u38.flag_1_41==1))&&(u38.p1_41==1))))
=> equivalent forward existential formula: [(((((FwdU(Init,TRUE) * !(((((((u60.flag_1_28==1)&&(u44.flag_1_47==1))&&(u44.p1_47==1))&&(i40.u57.flag_1_23==1))&&(u38.flag_1_41==1))&&(u38.p1_41==1)))) * !((((u61.flag_1_29==1)&&(u36.flag_1_39==1))&&(u61.p1_29==1)))) * !((((i41.u58.flag_1_24==1)&&(u43.flag_1_46==1))&&(u43.p1_46==1)))) * !(!((E(!((((u42.flag_1_45==1)&&(u68.flag_1_48==1))&&(u42.p1_45==1))) U (!(((((((((((((((((((((((((((((((((((((((((((((((((((i0.u0.flag_0_0==1)&&(u1.flag_0_1==1))&&(u2.flag_0_2==1))&&(i3.u3.flag_0_3==1))&&(i4.u4.flag_0_4==1))&&(u6.flag_0_5==1))&&(i6.u7.flag_0_6==1))&&(u48.flag_0_7==1))&&(i35.u9.flag_0_8==1))&&(i36.u10.flag_0_9==1))&&(u11.flag_0_10==1))&&(i9.u13.flag_0_12==1))&&(i37.u15.flag_0_13==1))&&(u16.flag_0_14==1))&&(i11.u17.flag_0_15==1))&&(i12.u18.flag_0_16==1))&&(u19.flag_0_17==1))&&(u20.flag_0_18==1))&&(i15.u21.flag_0_19==1))&&(u22.flag_0_20==1))&&(u55.flag_0_21==1))&&(u56.flag_0_22==1))&&(i40.u23.flag_0_23==1))&&(i41.u24.flag_0_24==1))&&(u25.flag_0_25==1))&&(u59.flag_0_26==1))&&(u26.flag_0_27==1))&&(u60.flag_0_28==1))&&(u61.flag_0_29==1))&&(i45.u27.flag_0_30==1))&&(i46.u28.flag_0_31==1))&&(u29.flag_0_32==1))&&(u64.flag_0_33==1))&&(i48.u30.flag_0_34==1))&&(i20.u31.flag_0_35==1))&&(u33.flag_0_36==1))&&(i22.u34.flag_0_37==1))&&(u35.flag_0_38==1))&&(u36.flag_0_39==1))&&(i25.u37.flag_0_40==1))&&(u38.flag_0_41==1))&&(u39.flag_0_42==1))&&(u40.flag_0_43==1))&&(u41.flag_0_44==1))&&(u42.flag_0_45==1))&&(u43.flag_0_46==1))&&(u44.flag_0_47==1))&&(u68.flag_0_48==1))&&(i33.u45.flag_0_49==1))&&(u12.p1_11==1))) * !((((u42.flag_1_45==1)&&(u68.flag_1_48==1))&&(u42.p1_45==1))))) + EG(!((((u42.flag_1_45==1)&&(u68.flag_1_48==1))&&(u42.p1_45==1)))))))) * !(E(TRUE U (((u48.flag_1_7==1)&&(i20.u32.flag_1_35==1))&&(u48.p1_7==1)))))] = FALSE
(forward)formula 1,1,1.94662,56256,1,0,156403,1361,20570,73366,371,1834,200183
FORMULA Dekker-PT-050-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((((((i3.u3.flag_1_3!=1)||(i9.u14.flag_1_12!=1))||(i3.u47.p1_3!=1))||(u48.flag_1_7!=1))||(u40.flag_1_43!=1))||(u40.p1_43!=1)) U (((((((i9.u14.flag_1_12==1)&&(u44.flag_1_47==1))&&(u44.p1_47==1))||(((u1.flag_1_1==1)&&(u42.flag_1_45==1))&&(u42.p1_45==1)))&&(u59.flag_1_26==1))&&(u41.flag_1_44==1))&&(u41.p1_44==1)))
=> equivalent forward existential formula: [(FwdU(Init,((((((i3.u3.flag_1_3!=1)||(i9.u14.flag_1_12!=1))||(i3.u47.p1_3!=1))||(u48.flag_1_7!=1))||(u40.flag_1_43!=1))||(u40.p1_43!=1))) * (((((((i9.u14.flag_1_12==1)&&(u44.flag_1_47==1))&&(u44.p1_47==1))||(((u1.flag_1_1==1)&&(u42.flag_1_45==1))&&(u42.p1_45==1)))&&(u59.flag_1_26==1))&&(u41.flag_1_44==1))&&(u41.p1_44==1)))] != FALSE
(forward)formula 2,1,2.39153,61272,1,0,163774,1361,21814,83306,380,1834,217583
FORMULA Dekker-PT-050-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EG(((((u59.flag_1_26==1)&&(u39.flag_1_42==1))&&(u39.p1_42==1))||(((i35.u49.flag_1_8==1)&&(u26.flag_1_27==1))&&(i35.u9.p1_8==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((u59.flag_1_26==1)&&(u39.flag_1_42==1))&&(u39.p1_42==1))||(((i35.u49.flag_1_8==1)&&(u26.flag_1_27==1))&&(i35.u9.p1_8==1))))] != FALSE
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
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
(forward)formula 3,1,2.77811,67080,1,0,165598,1361,22715,85831,384,1834,221740
FORMULA Dekker-PT-050-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((EF(((((((u29.flag_1_32==1)&&(u42.flag_1_45==1))&&(u42.p1_45==1))&&(i6.u8.flag_1_6==1))&&(u12.flag_1_11==1))&&(u12.p1_11==1))) + ((((((u60.flag_1_28==1)&&(i25.u37.flag_1_40==1))&&(i25.u67.p1_40==1))&&(i3.u3.flag_1_3==1))&&(u25.flag_1_25==1))&&(i3.u47.p1_3==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * ((((((u29.flag_1_32==1)&&(u42.flag_1_45==1))&&(u42.p1_45==1))&&(i6.u8.flag_1_6==1))&&(u12.flag_1_11==1))&&(u12.p1_11==1)))] != FALSE + [(FwdU(Init,TRUE) * ((((((u60.flag_1_28==1)&&(i25.u37.flag_1_40==1))&&(i25.u67.p1_40==1))&&(i3.u3.flag_1_3==1))&&(u25.flag_1_25==1))&&(i3.u47.p1_3==1)))] != FALSE)
(forward)formula 4,1,2.84949,69720,1,0,165747,1361,22912,86131,384,1834,222262
FORMULA Dekker-PT-050-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((((((i0.u0.flag_1_0==1)&&(u36.flag_1_39==1))&&(i0.u46.p1_0==1))&&(i37.u51.flag_1_13==1))&&(u39.flag_1_42==1))&&(i37.u15.p1_13==1))) + A((((u11.flag_1_10==1)&&(i25.u37.flag_1_40==1))&&(i25.u67.p1_40==1)) U (((u25.flag_1_25==1)&&(i25.u37.flag_1_40==1))&&(u25.p1_25==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((((((i0.u0.flag_1_0==1)&&(u36.flag_1_39==1))&&(i0.u46.p1_0==1))&&(i37.u51.flag_1_13==1))&&(u39.flag_1_42==1))&&(i37.u15.p1_13==1)))] != FALSE + [((Init * !(EG(!((((u25.flag_1_25==1)&&(i25.u37.flag_1_40==1))&&(u25.p1_25==1)))))) * !(E(!((((u25.flag_1_25==1)&&(i25.u37.flag_1_40==1))&&(u25.p1_25==1))) U (!((((u11.flag_1_10==1)&&(i25.u37.flag_1_40==1))&&(i25.u67.p1_40==1))) * !((((u25.flag_1_25==1)&&(i25.u37.flag_1_40==1))&&(u25.p1_25==1)))))))] != FALSE)
(forward)formula 5,1,2.85167,69984,1,0,165789,1361,22932,86229,384,1834,222382
FORMULA Dekker-PT-050-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AX(EF((((u36.flag_1_39==1)&&(u39.flag_1_42==1))&&(u39.p1_42==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U (((u36.flag_1_39==1)&&(u39.flag_1_42==1))&&(u39.p1_42==1)))))))] != FALSE
(forward)formula 6,1,2.86066,69984,1,0,166021,1361,22936,86467,384,1834,222942
FORMULA Dekker-PT-050-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(AF((((((((i3.u3.flag_1_3==1)&&(u56.flag_1_22==1))&&(u56.p1_22==1))&&(i15.u21.flag_1_19==1))&&(i40.u57.flag_1_23==1))&&(i40.u23.p1_23==1))&&(((i41.u58.flag_1_24!=1)||(u64.flag_1_33!=1))||(u64.p1_33!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((((((((i3.u3.flag_1_3==1)&&(u56.flag_1_22==1))&&(u56.p1_22==1))&&(i15.u21.flag_1_19==1))&&(i40.u57.flag_1_23==1))&&(i40.u23.p1_23==1))&&(((i41.u58.flag_1_24!=1)||(u64.flag_1_33!=1))||(u64.p1_33!=1)))))))] != FALSE
(forward)formula 7,0,3.06169,71832,1,0,167337,1361,23025,88297,384,1834,225500
FORMULA Dekker-PT-050-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG(AF((((i6.u8.flag_1_6!=1)||(i9.u14.flag_1_12!=1))||(i6.u7.p1_6!=1)))) + AG(AF((((u41.flag_1_44!=1)||(u42.flag_1_45!=1))||(u42.p1_45!=1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!(E(TRUE U !(!(EG(!((((i6.u8.flag_1_6!=1)||(i9.u14.flag_1_12!=1))||(i6.u7.p1_6!=1)))))))))),TRUE),!((((u41.flag_1_44!=1)||(u42.flag_1_45!=1))||(u42.p1_45!=1))))] = FALSE
(forward)formula 8,0,3.1541,75000,1,0,169424,1361,23282,90553,384,1834,230782
FORMULA Dekker-PT-050-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG((((((((i6.u8.flag_1_6==1)&&(i48.u65.flag_1_34==1))&&(i48.u30.p1_34==1))&&(i37.u51.flag_1_13==1))&&(i15.u21.flag_1_19==1))&&(i37.u15.p1_13==1))&&(u68.flag_1_48!=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((((((i6.u8.flag_1_6==1)&&(i48.u65.flag_1_34==1))&&(i48.u30.p1_34==1))&&(i37.u51.flag_1_13==1))&&(i15.u21.flag_1_19==1))&&(i37.u15.p1_13==1))&&(u68.flag_1_48!=1)))] != FALSE
(forward)formula 9,1,3.29683,77640,1,0,170773,1361,23986,92176,384,1834,234055
FORMULA Dekker-PT-050-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((((((u26.flag_1_27==1)&&(u64.flag_1_33==1))&&(u64.p1_33==1))&&(i40.u57.flag_1_23==1))&&(u33.flag_1_36==1))&&(u33.p1_36==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((((u26.flag_1_27==1)&&(u64.flag_1_33==1))&&(u64.p1_33==1))&&(i40.u57.flag_1_23==1))&&(u33.flag_1_36==1))&&(u33.p1_36==1)))] != FALSE
(forward)formula 10,1,3.29835,77904,1,0,170809,1361,24004,92227,384,1834,234118
FORMULA Dekker-PT-050-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(AG((((i9.u14.flag_1_12!=1)||(u19.flag_1_17!=1))||(u19.p1_17!=1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((((i9.u14.flag_1_12!=1)||(u19.flag_1_17!=1))||(u19.p1_17!=1))))))] != FALSE
(forward)formula 11,0,3.30821,78168,1,0,171265,1361,24010,92719,384,1834,235198
FORMULA Dekker-PT-050-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AX(EF((((i9.u14.flag_1_12==1)&&(i48.u65.flag_1_34==1))&&(i48.u30.p1_34==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((i9.u14.flag_1_12==1)&&(i48.u65.flag_1_34==1))&&(i48.u30.p1_34==1)))))] != FALSE
(forward)formula 12,0,3.31254,78168,1,0,171367,1361,24014,92827,384,1834,235564
FORMULA Dekker-PT-050-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG((((((((i9.u14.flag_1_12==1)&&(i41.u58.flag_1_24==1))&&(i41.u24.p1_24==1))&&(i6.u8.flag_1_6==1))&&(i36.u10.flag_1_9==1))&&(i36.u50.p1_9==1))||((((((u48.flag_1_7==1)&&(i46.u28.flag_1_31==1))&&(u48.p1_7==1))&&(u1.flag_1_1==1))&&(i48.u65.flag_1_34==1))&&(u1.p1_1==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((i9.u14.flag_1_12==1)&&(i41.u58.flag_1_24==1))&&(i41.u24.p1_24==1))&&(i6.u8.flag_1_6==1))&&(i36.u10.flag_1_9==1))&&(i36.u50.p1_9==1))||((((((u48.flag_1_7==1)&&(i46.u28.flag_1_31==1))&&(u48.p1_7==1))&&(u1.flag_1_1==1))&&(i48.u65.flag_1_34==1))&&(u1.p1_1==1)))))))] != FALSE
(forward)formula 13,0,3.32332,78432,1,0,171696,1361,24050,93137,384,1834,236253
FORMULA Dekker-PT-050-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF(((((((((i0.u0.flag_1_0==1)&&(i4.u5.flag_1_4==1))&&(i0.u46.p1_0==1))||(((u1.flag_1_1==1)&&(i3.u3.flag_1_3==1))&&(u1.p1_1==1)))&&(u29.flag_1_32==1))&&(i33.u45.flag_1_49==1))&&(u29.p1_32==1)) * EX((((i0.u0.flag_1_0==1)&&(i36.u10.flag_1_9==1))&&(i0.u46.p1_0==1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (((((((i0.u0.flag_1_0==1)&&(i4.u5.flag_1_4==1))&&(i0.u46.p1_0==1))||(((u1.flag_1_1==1)&&(i3.u3.flag_1_3==1))&&(u1.p1_1==1)))&&(u29.flag_1_32==1))&&(i33.u45.flag_1_49==1))&&(u29.p1_32==1)))) * (((i0.u0.flag_1_0==1)&&(i36.u10.flag_1_9==1))&&(i0.u46.p1_0==1)))] = FALSE
(forward)formula 14,0,3.33316,78696,1,0,172657,1361,24076,94227,384,1834,238022
FORMULA Dekker-PT-050-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((((((u55.flag_1_21==1)&&(u38.flag_1_41==1))&&(u38.p1_41==1))&&(i36.u10.flag_1_9==1))&&(i36.u50.p3_9==1))&&((((u2.flag_1_2==1)&&(u64.flag_1_33==1))&&(u64.p1_33==1))||((i15.u21.flag_1_19==1)&&(u55.p1_21==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((((u55.flag_1_21==1)&&(u38.flag_1_41==1))&&(u38.p1_41==1))&&(i36.u10.flag_1_9==1))&&(i36.u50.p3_9==1))&&((((u2.flag_1_2==1)&&(u64.flag_1_33==1))&&(u64.p1_33==1))||((i15.u21.flag_1_19==1)&&(u55.p1_21==1)))))] != FALSE
(forward)formula 15,1,3.33731,78696,1,0,172784,1361,24108,94406,385,1834,238328
FORMULA Dekker-PT-050-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1590111066948

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

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