fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897698600076
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BART-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.130 22549.00 38988.00 84.20 FTTFTTTTTTFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897698600076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698600076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 4.0K Apr 15 13:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 15 13:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 15 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 15 13:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 125K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 341K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 150K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 399K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 15 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 15 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 15 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 15 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 15 13:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 15 13:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 24 05:37 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 BART-PT-005-CTLFireability-00
FORMULA_NAME BART-PT-005-CTLFireability-01
FORMULA_NAME BART-PT-005-CTLFireability-02
FORMULA_NAME BART-PT-005-CTLFireability-03
FORMULA_NAME BART-PT-005-CTLFireability-04
FORMULA_NAME BART-PT-005-CTLFireability-05
FORMULA_NAME BART-PT-005-CTLFireability-06
FORMULA_NAME BART-PT-005-CTLFireability-07
FORMULA_NAME BART-PT-005-CTLFireability-08
FORMULA_NAME BART-PT-005-CTLFireability-09
FORMULA_NAME BART-PT-005-CTLFireability-10
FORMULA_NAME BART-PT-005-CTLFireability-11
FORMULA_NAME BART-PT-005-CTLFireability-12
FORMULA_NAME BART-PT-005-CTLFireability-13
FORMULA_NAME BART-PT-005-CTLFireability-14
FORMULA_NAME BART-PT-005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589206297682

[2020-05-11 14:11:39] [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-11 14:11:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 14:11:39] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2020-05-11 14:11:39] [INFO ] Transformed 870 places.
[2020-05-11 14:11:39] [INFO ] Transformed 1010 transitions.
[2020-05-11 14:11:39] [INFO ] Found NUPN structural information;
[2020-05-11 14:11:39] [INFO ] Parsed PT model containing 870 places and 1010 transitions in 217 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 183 ms. (steps per millisecond=546 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1010 rows 660 cols
[2020-05-11 14:11:40] [INFO ] Computed 5 place invariants in 21 ms
[2020-05-11 14:11:40] [INFO ] [Real]Absence check using 5 positive place invariants in 48 ms returned unsat
[2020-05-11 14:11:40] [INFO ] [Real]Absence check using 5 positive place invariants in 22 ms returned unsat
[2020-05-11 14:11:40] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-05-11 14:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:11:41] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2020-05-11 14:11:41] [INFO ] Computed and/alt/rep : 830/1350/830 causal constraints in 92 ms.
[2020-05-11 14:11:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:11:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 237 ms returned sat
[2020-05-11 14:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:11:44] [INFO ] [Nat]Absence check using state equation in 1770 ms returned sat
[2020-05-11 14:11:44] [INFO ] Computed and/alt/rep : 830/1350/830 causal constraints in 128 ms.
[2020-05-11 14:11:56] [INFO ] Added : 830 causal constraints over 166 iterations in 12716 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-11 14:11:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-11 14:11:57] [INFO ] Flatten gal took : 138 ms
[2020-05-11 14:11:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-11 14:11:57] [INFO ] Flatten gal took : 51 ms
FORMULA BART-PT-005-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-11 14:11:57] [INFO ] Applying decomposition
[2020-05-11 14:11:57] [INFO ] Flatten gal took : 52 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/graph1089933665533834568.txt, -o, /tmp/graph1089933665533834568.bin, -w, /tmp/graph1089933665533834568.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/graph1089933665533834568.bin, -l, -1, -v, -w, /tmp/graph1089933665533834568.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 14:11:58] [INFO ] Decomposing Gal with order
[2020-05-11 14:11:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 14:11:58] [INFO ] Removed a total of 210 redundant transitions.
[2020-05-11 14:11:58] [INFO ] Flatten gal took : 202 ms
[2020-05-11 14:11:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 27 ms.
[2020-05-11 14:11:58] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 26 ms
[2020-05-11 14:11:58] [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 15 CTL formulae.
built 1 ordering constraints for composite.
built 3 ordering constraints for composite.
built 14 ordering constraints for composite.
built 83 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 24 ordering constraints for composite.
built 43 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 43 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 1 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 90 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 1 ordering constraints for composite.
built 12 ordering constraints for composite.
built 94 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 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,4.00746e+10,0.188123,11264,364,75,8303,3007,1385,10673,267,2489,0


Converting to forward existential form...Done !
original formula: AF(((i2.i1.i0.u45.TrainState_2_1_34==1)||(i5.i0.i0.u10.TrainState_4_0_0!=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((i2.i1.i0.u45.TrainState_2_1_34==1)||(i5.i0.i0.u10.TrainState_4_0_0!=1))))] = FALSE
Fast SCC detection found an SCC at level 1
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
(forward)formula 0,0,0.303679,14408,1,0,12800,4633,5531,16628,1152,7761,30577
FORMULA BART-PT-005-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((i0.i0.i0.u23.TrainState_5_2_6==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i0.i0.i0.u23.TrainState_5_2_6==1))] != FALSE
(forward)formula 1,1,0.304317,14672,1,0,12840,4633,5536,16673,1153,7761,30661
FORMULA BART-PT-005-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((EF(((i2.i1.i0.u45.TrainState_2_1_27==1)||(i0.i0.i0.u12.TrainState_5_0_0==1))) * E((i4.u223.TrainState_3_4_34==1) U (i3.i1.i0.u16.TrainState_1_2_7==1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * E(TRUE U ((i2.i1.i0.u45.TrainState_2_1_27==1)||(i0.i0.i0.u12.TrainState_5_0_0==1)))),(i4.u223.TrainState_3_4_34==1)) * (i3.i1.i0.u16.TrainState_1_2_7==1))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 2,1,0.624544,27872,1,0,19755,66838,8239,28327,1313,74508,47920
FORMULA BART-PT-005-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((i0.i0.i0.u116.TrainState_5_1_21==1)&&((i3.i1.i0.u80.TrainState_1_2_18==1)||(i0.i0.i0.u12.TrainState_5_0_0==1)))||((i2.i1.i0.u45.TrainState_2_1_6!=1)&&(i5.i0.i0.u104.TrainState_4_4_24!=1))) U EX((i5.i1.i0.u84.TrainState_4_4_15==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EX((i5.i1.i0.u84.TrainState_4_4_15==1)))))) * !(E(!(EX((i5.i1.i0.u84.TrainState_4_4_15==1))) U (!((((i0.i0.i0.u116.TrainState_5_1_21==1)&&((i3.i1.i0.u80.TrainState_1_2_18==1)||(i0.i0.i0.u12.TrainState_5_0_0==1)))||((i2.i1.i0.u45.TrainState_2_1_6!=1)&&(i5.i0.i0.u104.TrainState_4_4_24!=1)))) * !(EX((i5.i1.i0.u84.TrainState_4_4_15==1)))))))] != FALSE
Fast SCC detection found an SCC at level 1
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
(forward)formula 3,0,0.864817,41600,1,0,42839,98302,8286,72470,1315,114772,85793
FORMULA BART-PT-005-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(E((i1.i1.i0.u26.TrainState_3_2_10==1) U (i2.i1.i0.u45.TrainState_2_0_0==1)) U !(AF((i5.i0.i0.u233.TrainState_4_1_36==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!((i5.i0.i0.u233.TrainState_4_1_36==1))))))))) * !(E(!(!(!(EG(!((i5.i0.i0.u233.TrainState_4_1_36==1)))))) U (!(E((i1.i1.i0.u26.TrainState_3_2_10==1) U (i2.i1.i0.u45.TrainState_2_0_0==1))) * !(!(!(EG(!((i5.i0.i0.u233.TrainState_4_1_36==1))))))))))] != FALSE
Fast SCC detection found an SCC at level 5
(forward)formula 4,1,0.873284,42128,1,0,43406,99087,8336,73439,1316,115496,87099
FORMULA BART-PT-005-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((i1.i1.i1.u70.TrainState_3_4_16==1)||((i5.i0.i0.u104.TrainState_4_4_20==1)&&(i1.i1.i0.u11.TrainState_3_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i1.i1.i1.u70.TrainState_3_4_16==1)||((i5.i0.i0.u104.TrainState_4_4_20==1)&&(i1.i1.i0.u11.TrainState_3_0_0==1))))] != FALSE
(forward)formula 5,1,0.874199,42128,1,0,43474,99087,8351,73553,1316,115496,87203
FORMULA BART-PT-005-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((i5.i0.i0.u104.TrainState_4_4_20==1)||(i5.i0.i3.u178.TrainState_4_4_29==1))) * A((i0.i1.i1.u248.TrainState_5_2_38==1) U (((i3.i1.i0.u32.TrainState_1_2_13==1)||(i3.i1.i0.u15.TrainState_1_0_0==1))||(i0.i0.i0.u12.TrainState_5_0_0==1))))
=> equivalent forward existential formula: [(((Init * E(TRUE U ((i5.i0.i0.u104.TrainState_4_4_20==1)||(i5.i0.i3.u178.TrainState_4_4_29==1)))) * !(EG(!((((i3.i1.i0.u32.TrainState_1_2_13==1)||(i3.i1.i0.u15.TrainState_1_0_0==1))||(i0.i0.i0.u12.TrainState_5_0_0==1)))))) * !(E(!((((i3.i1.i0.u32.TrainState_1_2_13==1)||(i3.i1.i0.u15.TrainState_1_0_0==1))||(i0.i0.i0.u12.TrainState_5_0_0==1))) U (!((i0.i1.i1.u248.TrainState_5_2_38==1)) * !((((i3.i1.i0.u32.TrainState_1_2_13==1)||(i3.i1.i0.u15.TrainState_1_0_0==1))||(i0.i0.i0.u12.TrainState_5_0_0==1)))))))] != FALSE
(forward)formula 6,1,0.887592,42656,1,0,44826,99306,8401,76718,1317,115684,89869
FORMULA BART-PT-005-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((A((i5.i0.i0.u204.TrainState_4_3_35==1) U (i0.i2.i1.u160.TrainState_5_4_24==1)) + (((EG((i0.i0.i0.u12.TrainState_5_1_8==1)) * (i1.i1.i1.u70.TrainState_3_4_12==1)) * (i1.i1.i1.u64.TrainState_3_3_15==1)) * (i2.i1.i0.u45.TrainState_2_0_0==1))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!((i0.i2.i1.u160.TrainState_5_4_24==1))))) * !(E(!((i0.i2.i1.u160.TrainState_5_4_24==1)) U (!((i5.i0.i0.u204.TrainState_4_3_35==1)) * !((i0.i2.i1.u160.TrainState_5_4_24==1))))))] != FALSE + [FwdG((((FwdU(Init,TRUE) * (i2.i1.i0.u45.TrainState_2_0_0==1)) * (i1.i1.i1.u64.TrainState_3_3_15==1)) * (i1.i1.i1.u70.TrainState_3_4_12==1)),(i0.i0.i0.u12.TrainState_5_1_8==1))] != FALSE)
(forward)formula 7,1,0.890372,42920,1,0,44949,99306,8447,77007,1318,115684,90132
FORMULA BART-PT-005-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(AG((i3.i1.i0.u5.TrainState_1_1_3==1)) U EF((i2.i1.i3.u168.TrainState_2_4_25==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(E(TRUE U !((i3.i1.i0.u5.TrainState_1_1_3==1))))),TRUE) * (i2.i1.i3.u168.TrainState_2_4_25==1))] != FALSE
(forward)formula 8,1,0.895335,42920,1,0,45377,99306,8464,77643,1318,115684,91333
FORMULA BART-PT-005-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((AF((i2.i1.i0.u45.TrainState_2_1_16==1)) + ((i5.i0.i4.u243.TrainState_4_2_39==1)&&((i5.i0.i0.u40.TrainState_4_1_13==1)||(i2.i1.i0.u7.TrainState_2_2_5==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((i2.i1.i0.u45.TrainState_2_1_16==1)))) + ((i5.i0.i4.u243.TrainState_4_2_39==1)&&((i5.i0.i0.u40.TrainState_4_1_13==1)||(i2.i1.i0.u7.TrainState_2_2_5==1))))))] = FALSE
(forward)formula 9,0,1.05622,50840,1,0,61621,100572,8506,124514,1320,117746,119380
FORMULA BART-PT-005-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(((i2.i1.i0.u45.TrainState_2_1_27==1)&&(i3.i1.i0.u175.TrainState_1_2_31==1))) + EX((i5.i0.i4.u210.TrainState_4_3_33==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((i2.i1.i0.u45.TrainState_2_1_27==1)&&(i3.i1.i0.u175.TrainState_1_2_31==1)))] != FALSE + [(EY(Init) * (i5.i0.i4.u210.TrainState_4_3_33==1))] != FALSE)
(forward)formula 10,1,1.05691,51104,1,0,61645,100572,8512,124551,1320,117746,119418
FORMULA BART-PT-005-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((EF(((i0.i0.i0.u9.TrainState_5_2_5==1)||(i0.i0.i0.u4.TrainState_5_1_2==1))) * ((i1.i2.i1.u60.TrainState_3_3_13!=1)||((i3.i1.i0.u15.TrainState_1_1_5!=1)&&(i0.i2.i2.u195.TrainState_5_4_31!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((i0.i0.i0.u9.TrainState_5_2_5==1)||(i0.i0.i0.u4.TrainState_5_1_2==1))) * ((i1.i2.i1.u60.TrainState_3_3_13!=1)||((i3.i1.i0.u15.TrainState_1_1_5!=1)&&(i0.i2.i2.u195.TrainState_5_4_31!=1))))))] = FALSE
(forward)formula 11,1,1.05964,51368,1,0,61842,100572,8537,124914,1320,117757,119826
FORMULA BART-PT-005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(EX((i2.i1.i0.u45.TrainState_2_0_0!=1)) U EG((i0.i0.i0.u12.TrainState_5_1_6!=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((i0.i0.i0.u12.TrainState_5_1_6!=1)))))) * !(E(!(EG((i0.i0.i0.u12.TrainState_5_1_6!=1))) U (!(EX((i2.i1.i0.u45.TrainState_2_0_0!=1))) * !(EG((i0.i0.i0.u12.TrainState_5_1_6!=1)))))))] != FALSE
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
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
(forward)formula 12,1,1.06448,51368,1,0,62220,100803,8623,125438,1325,118091,121062
FORMULA BART-PT-005-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((!(AX((i0.i0.i0.u180.TrainState_5_1_30==1))) + AG((i2.i1.i0.u45.TrainState_2_1_21==1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(!(EX(!((i0.i0.i0.u180.TrainState_5_1_30==1))))))),TRUE) * !((i2.i1.i0.u45.TrainState_2_1_21==1)))] = FALSE
(forward)formula 13,1,1.06538,51368,1,0,62319,100803,8641,125545,1327,118091,121307
FORMULA BART-PT-005-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((i0.i0.i0.u12.TrainState_5_0_0==1) * EF((i2.i1.i3.u136.TrainState_2_4_21==1))) * (AX((i1.i1.i0.u11.TrainState_3_1_29==1)) + (i1.i1.i0.u11.TrainState_3_0_0==1))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((i0.i0.i0.u12.TrainState_5_0_0==1) * E(TRUE U (i2.i1.i3.u136.TrainState_2_4_21==1)))) * !(EX(!((i1.i1.i0.u11.TrainState_3_1_29==1)))))] != FALSE + [((FwdU(Init,TRUE) * ((i0.i0.i0.u12.TrainState_5_0_0==1) * E(TRUE U (i2.i1.i3.u136.TrainState_2_4_21==1)))) * (i1.i1.i0.u11.TrainState_3_0_0==1))] != FALSE)
(forward)formula 14,1,1.07399,51896,1,0,62545,102580,8654,125882,1329,119880,121750
FORMULA BART-PT-005-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589206320231

--------------------
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="BART-PT-005"
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 BART-PT-005, 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 r021-oct2-158897698600076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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