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-158897698600084.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-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698600084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 4.7K Apr 15 13:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 15 13:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 15 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 229K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 601K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 247K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 641K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 15 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 16K 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 2.4M 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-010-CTLFireability-00
FORMULA_NAME BART-PT-010-CTLFireability-01
FORMULA_NAME BART-PT-010-CTLFireability-02
FORMULA_NAME BART-PT-010-CTLFireability-03
FORMULA_NAME BART-PT-010-CTLFireability-04
FORMULA_NAME BART-PT-010-CTLFireability-05
FORMULA_NAME BART-PT-010-CTLFireability-06
FORMULA_NAME BART-PT-010-CTLFireability-07
FORMULA_NAME BART-PT-010-CTLFireability-08
FORMULA_NAME BART-PT-010-CTLFireability-09
FORMULA_NAME BART-PT-010-CTLFireability-10
FORMULA_NAME BART-PT-010-CTLFireability-11
FORMULA_NAME BART-PT-010-CTLFireability-12
FORMULA_NAME BART-PT-010-CTLFireability-13
FORMULA_NAME BART-PT-010-CTLFireability-14
FORMULA_NAME BART-PT-010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589206328274

[2020-05-11 14:12:10] [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:12:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 14:12:10] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2020-05-11 14:12:10] [INFO ] Transformed 1530 places.
[2020-05-11 14:12:10] [INFO ] Transformed 2020 transitions.
[2020-05-11 14:12:10] [INFO ] Found NUPN structural information;
[2020-05-11 14:12:10] [INFO ] Parsed PT model containing 1530 places and 2020 transitions in 436 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 84 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 312 ms. (steps per millisecond=320 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 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, 0, 1, 1]
// Phase 1: matrix 2020 rows 1320 cols
[2020-05-11 14:12:11] [INFO ] Computed 10 place invariants in 70 ms
[2020-05-11 14:12:12] [INFO ] [Real]Absence check using 10 positive place invariants in 77 ms returned sat
[2020-05-11 14:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:12:16] [INFO ] [Real]Absence check using state equation in 4323 ms returned sat
[2020-05-11 14:12:16] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints in 174 ms.
[2020-05-11 14:12:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:12:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 92 ms returned sat
[2020-05-11 14:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:12:20] [INFO ] [Nat]Absence check using state equation in 3444 ms returned sat
[2020-05-11 14:12:21] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints in 156 ms.
[2020-05-11 14:12:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t412 0) (and (> t802 0) (< o802 o412)))") while checking expression at index 0
[2020-05-11 14:12:37] [INFO ] [Real]Absence check using 10 positive place invariants in 40 ms returned unsat
[2020-05-11 14:12:37] [INFO ] [Real]Absence check using 10 positive place invariants in 39 ms returned sat
[2020-05-11 14:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:12:41] [INFO ] [Real]Absence check using state equation in 3604 ms returned sat
[2020-05-11 14:12:41] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints in 58 ms.
[2020-05-11 14:12:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:12:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 123 ms returned sat
[2020-05-11 14:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:12:44] [INFO ] [Nat]Absence check using state equation in 3329 ms returned sat
[2020-05-11 14:12:45] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints in 81 ms.
[2020-05-11 14:13:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t865 0) (or (and (> t145 0) (< o145 o865)) (and (> t1755 0) (< o1755 o865))))") while checking expression at index 2
[2020-05-11 14:13:01] [INFO ] [Real]Absence check using 10 positive place invariants in 39 ms returned sat
[2020-05-11 14:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:13:05] [INFO ] [Real]Absence check using state equation in 3612 ms returned sat
[2020-05-11 14:13:05] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints in 56 ms.
[2020-05-11 14:13:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:13:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 177 ms returned sat
[2020-05-11 14:13:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:13:09] [INFO ] [Nat]Absence check using state equation in 3470 ms returned sat
[2020-05-11 14:13:09] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints in 80 ms.
[2020-05-11 14:13:25] [INFO ] Added : 810 causal constraints over 162 iterations in 16201 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-11 14:13:25] [INFO ] [Real]Absence check using 10 positive place invariants in 129 ms returned sat
[2020-05-11 14:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:13:30] [INFO ] [Real]Absence check using state equation in 4519 ms returned sat
[2020-05-11 14:13:30] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints in 159 ms.
[2020-05-11 14:13:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:13:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 144 ms returned sat
[2020-05-11 14:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:13:39] [INFO ] [Nat]Absence check using state equation in 8092 ms returned sat
[2020-05-11 14:13:39] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints in 135 ms.
[2020-05-11 14:13:50] [INFO ] Added : 560 causal constraints over 112 iterations in 11600 ms. Result :(error "Failed to check-sat")
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-11 14:13:51] [INFO ] Flatten gal took : 209 ms
[2020-05-11 14:13:51] [INFO ] Flatten gal took : 146 ms
[2020-05-11 14:13:51] [INFO ] Applying decomposition
[2020-05-11 14:13:52] [INFO ] Flatten gal took : 105 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/graph4456270374024066302.txt, -o, /tmp/graph4456270374024066302.bin, -w, /tmp/graph4456270374024066302.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/graph4456270374024066302.bin, -l, -1, -v, -w, /tmp/graph4456270374024066302.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 14:13:52] [INFO ] Decomposing Gal with order
[2020-05-11 14:13:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 14:13:53] [INFO ] Removed a total of 173 redundant transitions.
[2020-05-11 14:13:53] [INFO ] Flatten gal took : 499 ms
[2020-05-11 14:13:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2020-05-11 14:13:53] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 57 ms
[2020-05-11 14:13:53] [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 16 CTL formulae.
built 0 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 94 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 43 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 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 44 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 46 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 47 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 48 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 51 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 48 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 54 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 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 48 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 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,1.60598e+21,0.598995,18040,459,75,10141,2905,1753,10289,239,2256,0


Converting to forward existential form...Done !
original formula: EX((!(EF((i8.i0.u137.TrainState_2_2_16==1))) * (EG((i7.i0.u22.TrainState_9_1_38==1)) + (((i0.i2.u249.TrainState_3_2_26==1)&&(i2.i0.u145.TrainState_6_2_18==1))&&(i1.i0.u27.TrainState_4_1_22==1)))))
=> equivalent forward existential formula: ([FwdG((EY(Init) * !(E(TRUE U (i8.i0.u137.TrainState_2_2_16==1)))),(i7.i0.u22.TrainState_9_1_38==1))] != FALSE + [((EY(Init) * !(E(TRUE U (i8.i0.u137.TrainState_2_2_16==1)))) * (((i0.i2.u249.TrainState_3_2_26==1)&&(i2.i0.u145.TrainState_6_2_18==1))&&(i1.i0.u27.TrainState_4_1_22==1)))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,1.52661,37872,1,0,17533,139045,7557,20441,987,142041,36325
FORMULA BART-PT-010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(A((i9.i7.u426.TrainState_8_0_0==1) U (i9.i7.u114.TrainState_8_3_9==1)) U AF((i9.i7.u426.TrainState_8_1_33==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((i9.i7.u426.TrainState_8_1_33==1)))))))) * !(E(!(!(EG(!((i9.i7.u426.TrainState_8_1_33==1))))) U (!(!((E(!((i9.i7.u114.TrainState_8_3_9==1)) U (!((i9.i7.u426.TrainState_8_0_0==1)) * !((i9.i7.u114.TrainState_8_3_9==1)))) + EG(!((i9.i7.u114.TrainState_8_3_9==1)))))) * !(!(EG(!((i9.i7.u426.TrainState_8_1_33==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
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
(forward)formula 1,0,1.56481,38400,1,0,18245,140576,7659,21505,992,144072,37424
FORMULA BART-PT-010-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AG(EF(((i2.i0.u70.TrainState_6_0_0==1)||(i6.i0.u23.TrainState_10_1_27==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u70.TrainState_6_0_0==1)||(i6.i0.u23.TrainState_10_1_27==1)))))] != FALSE
(forward)formula 2,0,1.57911,38400,1,0,18315,140872,7667,21614,993,144291,37727
FORMULA BART-PT-010-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG((EF((i3.i0.u21.TrainState_7_1_23==1)) + AG((i3.i0.u76.TrainState_7_2_13==1)))) + E(((i9.i7.u114.TrainState_8_3_12==1)||(i5.i0.u20.TrainState_1_1_7==1)) U ((i4.i1.u69.TrainState_5_1_32==1)||((i0.i0.u87.TrainState_3_1_13==1)&&(i6.i0.u23.TrainState_10_1_21==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(E(((i9.i7.u114.TrainState_8_3_12==1)||(i5.i0.u20.TrainState_1_1_7==1)) U ((i4.i1.u69.TrainState_5_1_32==1)||((i0.i0.u87.TrainState_3_1_13==1)&&(i6.i0.u23.TrainState_10_1_21==1)))))),TRUE) * !(E(TRUE U (i3.i0.u21.TrainState_7_1_23==1)))),TRUE) * !((i3.i0.u76.TrainState_7_2_13==1)))] = FALSE
(forward)formula 3,1,1.58417,38664,1,0,18379,140872,7677,21650,994,144291,37930
FORMULA BART-PT-010-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((i2.i0.u70.TrainState_6_1_16==1))
=> equivalent forward existential formula: [(EY(Init) * !((i2.i0.u70.TrainState_6_1_16==1)))] = FALSE
(forward)formula 4,0,1.61158,38928,1,0,19024,140900,8482,22331,1030,144389,42588
FORMULA BART-PT-010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EX(EX(((i9.i3.u153.TrainState_8_3_15==1)&&(i0.i0.u122.TrainState_3_2_15==1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * ((i9.i3.u153.TrainState_8_3_15==1)&&(i0.i0.u122.TrainState_3_2_15==1)))] = FALSE
(forward)formula 5,1,1.64773,39720,1,0,21070,140929,8491,24146,1031,144486,47396
FORMULA BART-PT-010-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(EX((i5.i0.u20.TrainState_1_0_0!=1))) + !(AF((i0.i0.u253.TrainState_3_1_24==1))))
=> equivalent forward existential formula: [(EY((Init * !(!(!(EG(!((i0.i0.u253.TrainState_3_1_24==1)))))))) * (i5.i0.u20.TrainState_1_0_0!=1))] = FALSE
(forward)formula 6,1,1.66287,39984,1,0,21223,140929,8516,24354,1032,144486,47777
FORMULA BART-PT-010-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(EX(((i9.i7.u426.TrainState_8_1_13==1)&&(i4.i1.u11.TrainState_5_2_5==1)))) * !(AF(((i4.i1.u117.TrainState_5_2_16==1)||(i9.i7.u426.TrainState_8_1_15==1)))))
=> equivalent forward existential formula: ([(EY(Init) * ((i9.i7.u426.TrainState_8_1_13==1)&&(i4.i1.u11.TrainState_5_2_5==1)))] = FALSE * [(Init * !(EG(!(((i4.i1.u117.TrainState_5_2_16==1)||(i9.i7.u426.TrainState_8_1_15==1))))))] = FALSE)
(forward)formula 7,1,1.67024,40248,1,0,21480,142305,8546,24690,1034,145685,48310
FORMULA BART-PT-010-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EG((i4.i1.u34.TrainState_5_2_7!=1)))
=> equivalent forward existential formula: [FwdG(Init,(i4.i1.u34.TrainState_5_2_7!=1))] = FALSE
(forward)formula 8,0,1.81411,44736,1,0,30074,143216,10895,35278,1155,147245,75543
FORMULA BART-PT-010-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((i5.i2.u176.TrainState_1_4_14==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i5.i2.u176.TrainState_1_4_14==1))] != FALSE
(forward)formula 9,1,1.82691,45000,1,0,30082,143216,10898,35290,1155,147245,75565
FORMULA BART-PT-010-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((i7.i4.u248.TrainState_9_3_22==1))
=> equivalent forward existential formula: [FwdG(Init,!((i7.i4.u248.TrainState_9_3_22==1)))] = FALSE
(forward)formula 10,0,1.83613,45000,1,0,30707,143216,11108,36053,1155,147245,77662
FORMULA BART-PT-010-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF(((i6.i1.u164.TrainState_10_4_17==1) * EF((i3.i0.u21.TrainState_7_1_17==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (i6.i1.u164.TrainState_10_4_17==1)),TRUE) * (i3.i0.u21.TrainState_7_1_17==1))] = FALSE
(forward)formula 11,0,1.83793,45264,1,0,30795,143216,11119,36193,1156,147245,77912
FORMULA BART-PT-010-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF((i6.i0.u4.TrainState_10_1_2==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i6.i0.u4.TrainState_10_1_2==1))] = FALSE
(forward)formula 12,0,1.83826,45264,1,0,30817,143216,11121,36230,1156,147245,77955
FORMULA BART-PT-010-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!(EG((i1.i0.u27.TrainState_4_1_34==1))) U ((i4.i1.u69.TrainState_5_1_30==1) * EG((i2.i0.u70.TrainState_6_1_29==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,!(EG((i1.i0.u27.TrainState_4_1_34==1)))) * (i4.i1.u69.TrainState_5_1_30==1)),(i2.i0.u70.TrainState_6_1_29==1))] != FALSE
(forward)formula 13,1,2.05382,54768,1,0,50985,143504,11206,87894,1159,147732,114880
FORMULA BART-PT-010-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(((i9.i5.u263.TrainState_8_3_25==1)||((i2.i0.u70.TrainState_6_1_19==1)&&(i5.i0.u0.TrainState_1_2_4!=1)))) + (E((i9.i7.u426.TrainState_8_0_0==1) U (i7.i0.u205.TrainState_9_3_19!=1)) * !(EF((i2.i11.u387.TrainState_6_4_29==1)))))
=> equivalent forward existential formula: ([((Init * !(!(EG(!(((i9.i5.u263.TrainState_8_3_25==1)||((i2.i0.u70.TrainState_6_1_19==1)&&(i5.i0.u0.TrainState_1_2_4!=1)))))))) * !(E((i9.i7.u426.TrainState_8_0_0==1) U (i7.i0.u205.TrainState_9_3_19!=1))))] = FALSE * [(FwdU((Init * !(!(EG(!(((i9.i5.u263.TrainState_8_3_25==1)||((i2.i0.u70.TrainState_6_1_19==1)&&(i5.i0.u0.TrainState_1_2_4!=1)))))))),TRUE) * (i2.i11.u387.TrainState_6_4_29==1))] = FALSE)
(forward)formula 14,0,2.06623,55296,1,0,51853,144918,11234,89392,1161,150063,116170
FORMULA BART-PT-010-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (A(((((i9.i7.u25.TrainState_8_1_4==1)&&(i6.i6.u294.TrainState_10_2_29==1))&&(i1.i8.u318.TrainState_4_4_26==1))&&(i4.i11.u401.TrainState_5_2_35==1)) U AG((i7.i0.u13.TrainState_9_2_5==1))) + AG(EF(((i8.i0.u40.TrainState_2_0_0==1)||(i5.i0.u20.TrainState_1_1_21==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!(!(E(TRUE U !((i7.i0.u13.TrainState_9_2_5==1))))) U (!(((((i9.i7.u25.TrainState_8_1_4==1)&&(i6.i6.u294.TrainState_10_2_29==1))&&(i1.i8.u318.TrainState_4_4_26==1))&&(i4.i11.u401.TrainState_5_2_35==1))) * !(!(E(TRUE U !((i7.i0.u13.TrainState_9_2_5==1))))))) + EG(!(!(E(TRUE U !((i7.i0.u13.TrainState_9_2_5==1)))))))))),TRUE) * !(E(TRUE U ((i8.i0.u40.TrainState_2_0_0==1)||(i5.i0.u20.TrainState_1_1_21==1)))))] = FALSE
(forward)formula 15,1,2.06754,55560,1,0,51873,144918,11242,89427,1162,150063,116377
FORMULA BART-PT-010-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589206436378

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

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