fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r141-smll-158961510800276
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Raft-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.680 889478.00 911114.00 2441.90 FFFTTTFTTFTTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r141-smll-158961510800276.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Raft-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510800276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 3.2K Apr 12 08:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 08:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 09:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 09:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 10 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 9 21:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 9 21:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 196K Mar 24 05:38 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 Raft-PT-09-CTLFireability-00
FORMULA_NAME Raft-PT-09-CTLFireability-01
FORMULA_NAME Raft-PT-09-CTLFireability-02
FORMULA_NAME Raft-PT-09-CTLFireability-03
FORMULA_NAME Raft-PT-09-CTLFireability-04
FORMULA_NAME Raft-PT-09-CTLFireability-05
FORMULA_NAME Raft-PT-09-CTLFireability-06
FORMULA_NAME Raft-PT-09-CTLFireability-07
FORMULA_NAME Raft-PT-09-CTLFireability-08
FORMULA_NAME Raft-PT-09-CTLFireability-09
FORMULA_NAME Raft-PT-09-CTLFireability-10
FORMULA_NAME Raft-PT-09-CTLFireability-11
FORMULA_NAME Raft-PT-09-CTLFireability-12
FORMULA_NAME Raft-PT-09-CTLFireability-13
FORMULA_NAME Raft-PT-09-CTLFireability-14
FORMULA_NAME Raft-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590060287085

[2020-05-21 11:24:50] [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-21 11:24:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 11:24:50] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2020-05-21 11:24:50] [INFO ] Transformed 413 places.
[2020-05-21 11:24:50] [INFO ] Transformed 710 transitions.
[2020-05-21 11:24:50] [INFO ] Found NUPN structural information;
[2020-05-21 11:24:50] [INFO ] Parsed PT model containing 413 places and 710 transitions in 229 ms.
Ensure Unique test removed 38 transitions
Reduce redundant transitions removed 38 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 922 ms. (steps per millisecond=108 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-21 11:24:51] [INFO ] Flow matrix only has 631 transitions (discarded 41 similar events)
// Phase 1: matrix 631 rows 413 cols
[2020-05-21 11:24:51] [INFO ] Computed 81 place invariants in 33 ms
[2020-05-21 11:24:51] [INFO ] [Real]Absence check using 81 positive place invariants in 105 ms returned sat
[2020-05-21 11:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 11:24:52] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2020-05-21 11:24:53] [INFO ] State equation strengthened by 364 read => feed constraints.
[2020-05-21 11:24:53] [INFO ] [Real]Added 364 Read/Feed constraints in 92 ms returned sat
[2020-05-21 11:24:53] [INFO ] Computed and/alt/rep : 671/5218/630 causal constraints in 120 ms.
[2020-05-21 11:24:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 11:24:53] [INFO ] [Nat]Absence check using 81 positive place invariants in 93 ms returned sat
[2020-05-21 11:24:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 11:24:54] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2020-05-21 11:24:55] [INFO ] [Nat]Added 364 Read/Feed constraints in 79 ms returned sat
[2020-05-21 11:24:55] [INFO ] Computed and/alt/rep : 671/5218/630 causal constraints in 108 ms.
[2020-05-21 11:25:13] [INFO ] Added : 545 causal constraints over 109 iterations in 18620 ms. Result :unknown
[2020-05-21 11:25:14] [INFO ] Flatten gal took : 191 ms
[2020-05-21 11:25:14] [INFO ] Flatten gal took : 95 ms
[2020-05-21 11:25:14] [INFO ] Applying decomposition
[2020-05-21 11:25:14] [INFO ] Flatten gal took : 85 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/graph1166963756575431585.txt, -o, /tmp/graph1166963756575431585.bin, -w, /tmp/graph1166963756575431585.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/graph1166963756575431585.bin, -l, -1, -v, -w, /tmp/graph1166963756575431585.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 11:25:14] [INFO ] Decomposing Gal with order
[2020-05-21 11:25:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 11:25:15] [INFO ] Removed a total of 480 redundant transitions.
[2020-05-21 11:25:15] [INFO ] Flatten gal took : 145 ms
[2020-05-21 11:25:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 556 labels/synchronizations in 36 ms.
[2020-05-21 11:25:15] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 14 ms
[2020-05-21 11:25:15] [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 56 ordering constraints for composite.
built 30 ordering constraints for composite.
built 31 ordering constraints for composite.
built 29 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 26 ordering constraints for composite.
built 30 ordering constraints for composite.
built 34 ordering constraints for composite.
built 30 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,8.27181e+57,2.35064,58476,118,368,71738,24187,682,236381,301,142847,0


Converting to forward existential form...Done !
original formula: E((((i2.u47.p225!=1)||(i1.u48.p390!=1))||(((i8.u40.p346!=1)||(i1.u48.p390!=1))&&((i5.u45.p335!=1)||(i8.u51.p405!=1)))) U AF((((i10.u54.p410==1)&&(i6.u35.p315==1))&&(i7.u50.p400==1))))
=> equivalent forward existential formula: [(FwdU(Init,(((i2.u47.p225!=1)||(i1.u48.p390!=1))||(((i8.u40.p346!=1)||(i1.u48.p390!=1))&&((i5.u45.p335!=1)||(i8.u51.p405!=1))))) * !(EG(!((((i10.u54.p410==1)&&(i6.u35.p315==1))&&(i7.u50.p400==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.u46.t36, i0.u46.t37, i0.u46.t38, i0.u46.t40, i1.u48.t24, i1.u48.t25, i1.u48.t26, i1.u48.t28, i2.u47.t30, i2.u47.t31, i2.u47.t32, i2.u47.t34, i3.u42.t54, i3.u42.t55, i3.u42.t56, i3.u42.t58, i4.u44.t48, i4.u44.t49, i4.u44.t50, i4.u44.t52, i5.u45.t42, i5.u45.t43, i5.u45.t44, i5.u45.t46, i6.u49.t18, i6.u49.t19, i6.u49.t20, i6.u49.t22, i7.u50.t12, i7.u50.t13, i7.u50.t14, i7.u50.t16, i8.u51.t6, i8.u51.t7, i8.u51.t8, i8.u51.t10, i10.t709, i10.u54.t707, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/389/38/427
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
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,2.56097,58856,1,0,71738,24187,4547,236381,2488,142847,21370
FORMULA Raft-PT-09-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((i4.u44.p289==1)&&(i4.u44.p370==1)) * AX(((i6.u49.p69==1)&&(i6.u49.p395==1)))) * EX(((i7.u50.p33==1)&&(i7.u50.p400==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((i4.u44.p289==1)&&(i4.u44.p370==1)) * !(EX(!(((i6.u49.p69==1)&&(i6.u49.p395==1)))))) * EX(((i7.u50.p33==1)&&(i7.u50.p400==1))))))] = FALSE
(forward)formula 1,0,3.77556,63080,1,0,89643,34579,4944,236381,2578,191534,108563
FORMULA Raft-PT-09-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(((i6.u49.p395==1)&&((((i8.u39.p337!=1)||(i0.u46.p380!=1))||(i1.u48.p21!=1))||(i1.u48.p390!=1))) U (AF(((i1.u48.p21==1)&&(i1.u48.p390==1))) + ((i8.u39.p338==1)&&(i0.u46.p380==1))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((i1.u48.p21==1)&&(i1.u48.p390==1))))) + ((i8.u39.p338==1)&&(i0.u46.p380==1))))))) * !(E(!((!(EG(!(((i1.u48.p21==1)&&(i1.u48.p390==1))))) + ((i8.u39.p338==1)&&(i0.u46.p380==1)))) U (!(((i6.u49.p395==1)&&((((i8.u39.p337!=1)||(i0.u46.p380!=1))||(i1.u48.p21!=1))||(i1.u48.p390!=1)))) * !((!(EG(!(((i1.u48.p21==1)&&(i1.u48.p390==1))))) + ((i8.u39.p338==1)&&(i0.u46.p380==1))))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
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
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
(forward)formula 2,0,5.53316,115088,1,0,184432,46079,5036,482808,2605,276294,124086
FORMULA Raft-PT-09-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(((i0.u14.p148!=1)||(i6.u49.p395!=1)))
=> equivalent forward existential formula: [FwdG(Init,((i0.u14.p148!=1)||(i6.u49.p395!=1)))] != FALSE
(forward)formula 3,1,8.07135,173960,1,0,270108,73164,5172,738829,2606,520847,193458
FORMULA Raft-PT-09-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(((i1.u25.p207!=1)||(i4.u44.p370!=1)))
=> equivalent forward existential formula: [FwdG(Init,((i1.u25.p207!=1)||(i4.u44.p370!=1)))] != FALSE
(forward)formula 4,1,11.3101,244712,1,0,355260,132821,5297,997703,2606,912936,248218
FORMULA Raft-PT-09-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(E(((i0.u14.p149!=1)||(i6.u49.p395!=1)) U ((i8.u51.p240==1)&&(i1.u48.p390==1))))
=> equivalent forward existential formula: [FwdG(Init,E(((i0.u14.p149!=1)||(i6.u49.p395!=1)) U ((i8.u51.p240==1)&&(i1.u48.p390==1))))] != FALSE
(forward)formula 5,1,543.054,2786048,1,0,2.15547e+06,367453,1580,5.34347e+06,823,3.44362e+06,140530
FORMULA Raft-PT-09-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AG(AF(((i6.u49.p355==1)&&(i8.u51.p405==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),!(((i6.u49.p355==1)&&(i8.u51.p405==1))))] = FALSE
(forward)formula 6,0,545.116,2786048,1,0,2.15547e+06,367453,2208,5.34347e+06,953,3.59634e+06,253136
FORMULA Raft-PT-09-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AG(((((((i6.u26.p230==1)&&(i1.u48.p390==1))&&(i3.u42.p364==1))||(i1.u25.p207!=1))||(i4.u44.p370!=1)) + AX(((i7.u11.p112==1)&&(i7.u50.p400==1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((((((i6.u26.p230==1)&&(i1.u48.p390==1))&&(i3.u42.p364==1))||(i1.u25.p207!=1))||(i4.u44.p370!=1))))) * !(((i7.u11.p112==1)&&(i7.u50.p400==1))))] != FALSE
(forward)formula 7,1,545.142,2786048,1,0,2.15547e+06,367453,2244,5.34347e+06,959,3.60021e+06,254571
FORMULA Raft-PT-09-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EF((((i1.u48.p390!=1)||(u53.p406!=1))&&(((i2.u47.p225==1)&&(i1.u48.p390==1))||((i0.u46.p51==1)&&(i0.u46.p380==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((i1.u48.p390!=1)||(u53.p406!=1))&&(((i2.u47.p225==1)&&(i1.u48.p390==1))||((i0.u46.p51==1)&&(i0.u46.p380==1))))))] != FALSE
(forward)formula 8,1,545.571,2786048,1,0,2.15547e+06,374915,3138,5.34347e+06,1226,3.66463e+06,273359
FORMULA Raft-PT-09-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(A(((i5.u45.p375==1)||((i4.u5.p75==1)&&(i4.u44.p370==1))) U ((i5.u45.p175!=1)||(i2.u47.p385!=1))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),!(((i5.u45.p175!=1)||(i2.u47.p385!=1)))) * (!(((i5.u45.p375==1)||((i4.u5.p75==1)&&(i4.u44.p370==1)))) * !(((i5.u45.p175!=1)||(i2.u47.p385!=1)))))] = FALSE * [FwdG(EY(Init),!(((i5.u45.p175!=1)||(i2.u47.p385!=1))))] = FALSE)
(forward)formula 9,0,547.301,2786048,1,0,2.15547e+06,408367,3255,5.34347e+06,1228,3.95907e+06,307777
FORMULA Raft-PT-09-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((((((AG(((i2.u20.p184==1)&&(i1.u48.p390==1))) + (i6.u49.p355!=1)) + (i8.u51.p405!=1)) + (i4.u44.p2!=1)) + (i4.u44.p370!=1)) + (((i6.u30.p271==1)&&(i7.u50.p400==1))&&((((i8.u51.p40!=1)||(i3.u42.p365!=1))||(i5.u45.p294!=1))||(i5.u45.p375!=1)))))
=> equivalent forward existential formula: [FwdG(Init,(((((!(E(TRUE U !(((i2.u20.p184==1)&&(i1.u48.p390==1))))) + (i6.u49.p355!=1)) + (i8.u51.p405!=1)) + (i4.u44.p2!=1)) + (i4.u44.p370!=1)) + (((i6.u30.p271==1)&&(i7.u50.p400==1))&&((((i8.u51.p40!=1)||(i3.u42.p365!=1))||(i5.u45.p294!=1))||(i5.u45.p375!=1)))))] != FALSE
(forward)formula 10,1,831.267,3110940,1,0,2.62219e+06,585567,1580,8.37352e+06,823,5.73321e+06,208566
FORMULA Raft-PT-09-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EF((((i6.u49.p392==1)&&(i6.u35.p315==1))&&(i7.u50.p400==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((i6.u49.p392==1)&&(i6.u35.p315==1))&&(i7.u50.p400==1))))] != FALSE
(forward)formula 11,1,833.074,3110940,1,0,2.62219e+06,585567,3026,8.37352e+06,1216,5.73321e+06,320489
FORMULA Raft-PT-09-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(!(EX(((i0.u33.p297==1)&&(i0.u46.p380==1))))) * AG(!(EG(((i3.u17.p165==1)&&(i2.u47.p385==1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(((i0.u33.p297==1)&&(i0.u46.p380==1))))))] = FALSE * [FwdG(FwdU(Init,TRUE),((i3.u17.p165==1)&&(i2.u47.p385==1)))] = FALSE)
(forward)formula 12,0,833.09,3110940,1,0,2.62219e+06,585567,3162,8.37352e+06,1217,5.73321e+06,321607
FORMULA Raft-PT-09-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF(((((((i2.u29.p262==1)&&(i2.u47.p385==1))&&(i0.u33.p300==1))&&(i7.u50.p400==1))&&(i6.u35.p312==1))&&(i6.u49.p395==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((((((i2.u29.p262==1)&&(i2.u47.p385==1))&&(i0.u33.p300==1))&&(i7.u50.p400==1))&&(i6.u35.p312==1))&&(i6.u49.p395==1))))] = FALSE
(forward)formula 13,0,858.98,3115528,1,0,2.76445e+06,735471,3282,8.43818e+06,1219,7.16001e+06,405504
FORMULA Raft-PT-09-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((A(((i3.u17.p163==1)&&(i3.u42.p365==1)) U ((i7.u34.p303==1)&&(i2.u47.p385==1))) * !(AF(((i5.u45.p175==1)&&(i2.u47.p385==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((E(!(((i7.u34.p303==1)&&(i2.u47.p385==1))) U (!(((i3.u17.p163==1)&&(i3.u42.p365==1))) * !(((i7.u34.p303==1)&&(i2.u47.p385==1))))) + EG(!(((i7.u34.p303==1)&&(i2.u47.p385==1))))))),!(((i5.u45.p175==1)&&(i2.u47.p385==1))))] != FALSE
(forward)formula 14,1,859.802,3141928,1,0,2.80376e+06,754588,3533,8.53062e+06,1272,7.32008e+06,425256
FORMULA Raft-PT-09-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(E(EF(((i2.u29.p263==1)&&(i2.u47.p385==1))) U ((((i5.u45.p174==1)&&(i5.u45.p375==1))&&(i7.u22.p193==1))&&(i7.u50.p400==1))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((i2.u29.p263==1)&&(i2.u47.p385==1)))) * ((((i5.u45.p174==1)&&(i5.u45.p375==1))&&(i7.u22.p193==1))&&(i7.u50.p400==1)))] = FALSE
(forward)formula 15,0,859.855,3143248,1,0,2.8063e+06,756497,3558,8.5339e+06,1275,7.32597e+06,429826
FORMULA Raft-PT-09-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590061176563

--------------------
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="Raft-PT-09"
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 Raft-PT-09, 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 r141-smll-158961510800276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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