About the Execution of ITS-Tools for Raft-PT-04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.680 | 12816.00 | 24464.00 | 190.70 | TTFTFFTTTTFFFTFF | 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-158961510700236.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-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510700236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.3K Apr 12 07:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 07:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 08:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 08:58 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.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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.4K Apr 10 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 9 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 21:20 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 41K 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-04-CTLFireability-00
FORMULA_NAME Raft-PT-04-CTLFireability-01
FORMULA_NAME Raft-PT-04-CTLFireability-02
FORMULA_NAME Raft-PT-04-CTLFireability-03
FORMULA_NAME Raft-PT-04-CTLFireability-04
FORMULA_NAME Raft-PT-04-CTLFireability-05
FORMULA_NAME Raft-PT-04-CTLFireability-06
FORMULA_NAME Raft-PT-04-CTLFireability-07
FORMULA_NAME Raft-PT-04-CTLFireability-08
FORMULA_NAME Raft-PT-04-CTLFireability-09
FORMULA_NAME Raft-PT-04-CTLFireability-10
FORMULA_NAME Raft-PT-04-CTLFireability-11
FORMULA_NAME Raft-PT-04-CTLFireability-12
FORMULA_NAME Raft-PT-04-CTLFireability-13
FORMULA_NAME Raft-PT-04-CTLFireability-14
FORMULA_NAME Raft-PT-04-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1590053736580
[2020-05-21 09:35:38] [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 09:35:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 09:35:39] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2020-05-21 09:35:39] [INFO ] Transformed 88 places.
[2020-05-21 09:35:39] [INFO ] Transformed 160 transitions.
[2020-05-21 09:35:39] [INFO ] Found NUPN structural information;
[2020-05-21 09:35:39] [INFO ] Parsed PT model containing 88 places and 160 transitions in 147 ms.
Ensure Unique test removed 18 transitions
Reduce redundant transitions removed 18 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 528 ms. (steps per millisecond=189 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1]
[2020-05-21 09:35:39] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
// Phase 1: matrix 126 rows 88 cols
[2020-05-21 09:35:39] [INFO ] Computed 16 place invariants in 13 ms
[2020-05-21 09:35:39] [INFO ] [Real]Absence check using 16 positive place invariants in 27 ms returned unsat
[2020-05-21 09:35:40] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned unsat
[2020-05-21 09:35:40] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2020-05-21 09:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:40] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2020-05-21 09:35:40] [INFO ] State equation strengthened by 64 read => feed constraints.
[2020-05-21 09:35:40] [INFO ] [Real]Added 64 Read/Feed constraints in 16 ms returned sat
[2020-05-21 09:35:40] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 29 ms.
[2020-05-21 09:35:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:35:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 22 ms returned sat
[2020-05-21 09:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:40] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2020-05-21 09:35:40] [INFO ] [Nat]Added 64 Read/Feed constraints in 17 ms returned sat
[2020-05-21 09:35:40] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 37 ms.
[2020-05-21 09:35:41] [INFO ] Added : 101 causal constraints over 21 iterations in 487 ms. Result :sat
[2020-05-21 09:35:41] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2020-05-21 09:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:41] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-05-21 09:35:41] [INFO ] [Real]Added 64 Read/Feed constraints in 11 ms returned sat
[2020-05-21 09:35:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:35:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 18 ms returned sat
[2020-05-21 09:35:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:41] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2020-05-21 09:35:41] [INFO ] [Nat]Added 64 Read/Feed constraints in 13 ms returned sat
[2020-05-21 09:35:41] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 15 ms.
[2020-05-21 09:35:41] [INFO ] Added : 123 causal constraints over 25 iterations in 534 ms. Result :sat
[2020-05-21 09:35:41] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2020-05-21 09:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:42] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-05-21 09:35:42] [INFO ] [Real]Added 64 Read/Feed constraints in 10 ms returned sat
[2020-05-21 09:35:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:35:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2020-05-21 09:35:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:42] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2020-05-21 09:35:42] [INFO ] [Nat]Added 64 Read/Feed constraints in 15 ms returned sat
[2020-05-21 09:35:42] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 19 ms.
[2020-05-21 09:35:42] [INFO ] Added : 118 causal constraints over 24 iterations in 631 ms. Result :sat
[2020-05-21 09:35:42] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2020-05-21 09:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:42] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-05-21 09:35:42] [INFO ] [Real]Added 64 Read/Feed constraints in 12 ms returned sat
[2020-05-21 09:35:43] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 18 ms.
[2020-05-21 09:35:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:35:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2020-05-21 09:35:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:43] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-05-21 09:35:43] [INFO ] [Nat]Added 64 Read/Feed constraints in 10 ms returned sat
[2020-05-21 09:35:43] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 10 ms.
[2020-05-21 09:35:43] [INFO ] Added : 111 causal constraints over 23 iterations in 486 ms. Result :sat
[2020-05-21 09:35:43] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned unsat
[2020-05-21 09:35:43] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2020-05-21 09:35:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:43] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-21 09:35:43] [INFO ] [Real]Added 64 Read/Feed constraints in 8 ms returned sat
[2020-05-21 09:35:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:35:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 18 ms returned sat
[2020-05-21 09:35:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:43] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-05-21 09:35:43] [INFO ] [Nat]Added 64 Read/Feed constraints in 9 ms returned sat
[2020-05-21 09:35:43] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 15 ms.
[2020-05-21 09:35:44] [INFO ] Added : 113 causal constraints over 23 iterations in 442 ms. Result :sat
[2020-05-21 09:35:44] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2020-05-21 09:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:44] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-05-21 09:35:44] [INFO ] [Real]Added 64 Read/Feed constraints in 9 ms returned sat
[2020-05-21 09:35:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:35:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2020-05-21 09:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:44] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-05-21 09:35:44] [INFO ] [Nat]Added 64 Read/Feed constraints in 12 ms returned sat
[2020-05-21 09:35:44] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 21 ms.
[2020-05-21 09:35:45] [INFO ] Added : 117 causal constraints over 26 iterations in 644 ms. Result :sat
[2020-05-21 09:35:45] [INFO ] [Real]Absence check using 16 positive place invariants in 28 ms returned sat
[2020-05-21 09:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:45] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2020-05-21 09:35:45] [INFO ] [Real]Added 64 Read/Feed constraints in 11 ms returned sat
[2020-05-21 09:35:45] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 20 ms.
[2020-05-21 09:35:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:35:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 20 ms returned sat
[2020-05-21 09:35:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:35:45] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2020-05-21 09:35:45] [INFO ] [Nat]Added 64 Read/Feed constraints in 15 ms returned sat
[2020-05-21 09:35:45] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 18 ms.
[2020-05-21 09:35:46] [INFO ] Added : 117 causal constraints over 24 iterations in 690 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-21 09:35:46] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-21 09:35:46] [INFO ] Flatten gal took : 69 ms
[2020-05-21 09:35:46] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-21 09:35:46] [INFO ] Flatten gal took : 34 ms
FORMULA Raft-PT-04-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 09:35:46] [INFO ] Applying decomposition
[2020-05-21 09:35:46] [INFO ] Flatten gal took : 27 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/graph8007767066128337791.txt, -o, /tmp/graph8007767066128337791.bin, -w, /tmp/graph8007767066128337791.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/graph8007767066128337791.bin, -l, -1, -v, -w, /tmp/graph8007767066128337791.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 09:35:47] [INFO ] Decomposing Gal with order
[2020-05-21 09:35:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 09:35:47] [INFO ] Removed a total of 102 redundant transitions.
[2020-05-21 09:35:47] [INFO ] Flatten gal took : 62 ms
[2020-05-21 09:35:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 13 ms.
[2020-05-21 09:35:47] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2020-05-21 09:35:47] [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 13 CTL formulae.
built 18 ordering constraints for composite.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 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.96586e+12,0.05423,5584,47,24,1745,110,206,4142,37,622,0
Converting to forward existential form...Done !
original formula: EF(EG((i1.u12.p64==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i1.u12.p64==1))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,0.069543,5968,1,0,1745,178,771,4142,148,651,2209
FORMULA Raft-PT-04-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(!(EG((i4.u15.p78==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i4.u15.p78==1))] = FALSE
(forward)formula 1,0,0.073736,5968,1,0,1745,178,854,4142,149,705,2803
FORMULA Raft-PT-04-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((((i4.u15.p79==1)&&(i3.u14.p73==1))&&(i5.u18.p87==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i4.u15.p79==1)&&(i3.u14.p73==1))&&(i5.u18.p87==1)))] != FALSE
(forward)formula 2,1,0.074638,5968,1,0,1745,178,865,4142,150,705,2828
FORMULA Raft-PT-04-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EX((i3.u14.p73==1)) + (EF(AX((i2.u13.p69==1))) * !(AG((i1.u12.p64==1)))))
=> equivalent forward existential formula: ([(EY(Init) * (i3.u14.p73==1))] != FALSE + [(FwdU((Init * E(TRUE U !(EX(!((i2.u13.p69==1)))))),TRUE) * !((i1.u12.p64==1)))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions i1.u12.t24, i1.u12.t25, i1.u12.t26, i1.u12.t28, i2.u13.t18, i2.u13.t19, i2.u13.t20, i2.u13.t22, i3.u14.t12, i3.u14.t13, i3.u14.t14, i3.u14.t16, i4.u15.t6, i4.u15.t7, i4.u15.t8, i4.u15.t10, i5.t159, i5.u18.t157, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/82/18/100
(forward)formula 3,0,0.091991,6232,1,0,3214,183,1193,5635,194,793,5293
FORMULA Raft-PT-04-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF(((EX(((i2.u5.p30==1)&&(i2.u13.p70==1))) * EF((((i5.u18.p85==1)&&(i4.u9.p49==1))&&(i1.u12.p65==1)))) * ((((i2.u7.p40==1)&&(i3.u14.p75==1))||((i3.u8.p45==1)&&(i3.u14.p75==1)))||((i4.u9.p50==1)&&(i4.u15.p80==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((i2.u5.p30==1)&&(i2.u13.p70==1))) * E(TRUE U (((i5.u18.p85==1)&&(i4.u9.p49==1))&&(i1.u12.p65==1)))) * ((((i2.u7.p40==1)&&(i3.u14.p75==1))||((i3.u8.p45==1)&&(i3.u14.p75==1)))||((i4.u9.p50==1)&&(i4.u15.p80==1))))))] = FALSE
(forward)formula 4,1,0.187044,9664,1,0,9410,269,1384,23806,199,980,17439
FORMULA Raft-PT-04-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(EF((AX((i5.u18.p85==1)) * EF(((i1.u6.p31==1)&&(i1.u12.p65==1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EX(!((i5.u18.p85==1))))),TRUE) * ((i1.u6.p31==1)&&(i1.u12.p65==1)))] = FALSE
(forward)formula 5,1,0.189833,9928,1,0,9508,277,1393,24044,200,1000,17547
FORMULA Raft-PT-04-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(((((i2.u13.p66==1)&&(i3.u14.p75==1))&&(u3.p16==1))&&(i1.u12.p65==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((i2.u13.p66==1)&&(i3.u14.p75==1))&&(u3.p16==1))&&(i1.u12.p65==1)))] != FALSE
(forward)formula 6,1,0.191016,9928,1,0,9517,277,1404,24052,200,1000,17564
FORMULA Raft-PT-04-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(EX(((((i3.u14.p75!=1)||(u17.p81!=1))||(i2.u7.p36!=1))||(i2.u13.p70!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((((i3.u14.p75!=1)||(u17.p81!=1))||(i2.u7.p36!=1))||(i2.u13.p70!=1)))))] = FALSE
(forward)formula 7,1,0.197013,9928,1,0,9961,277,1418,25248,202,1013,17894
FORMULA Raft-PT-04-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (AF(AX((((i4.u9.p46==1)&&(i1.u12.p65==1))||((i3.u8.p42==1)&&(i4.u15.p80==1))))) + E(((((i1.u1.p9!=1)||(i3.u14.p75!=1))||(i1.u12.p63!=1))||(i5.u18.p87!=1)) U AX((i4.u15.p77==1))))
=> equivalent forward existential formula: [FwdG((Init * !(E(((((i1.u1.p9!=1)||(i3.u14.p75!=1))||(i1.u12.p63!=1))||(i5.u18.p87!=1)) U !(EX(!((i4.u15.p77==1))))))),!(!(EX(!((((i4.u9.p46==1)&&(i1.u12.p65==1))||((i3.u8.p42==1)&&(i4.u15.p80==1))))))))] = FALSE
(forward)formula 8,0,0.811428,23656,1,0,33895,282,1460,91675,204,1105,31848
FORMULA Raft-PT-04-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(AF(((i4.u10.p55==1)&&(i4.u15.p80==1))) U AX((i3.u14.p75!=1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((i4.u10.p55==1)&&(i4.u15.p80==1)))))) * !(EX(!((i3.u14.p75!=1)))))] != FALSE
(forward)formula 9,0,0.812866,23920,1,0,33957,282,1460,91719,204,1105,31991
FORMULA Raft-PT-04-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EG((((i2.u5.p27!=1)||(i4.u15.p80!=1))||(i5.u18.p86!=1))) * EF(EG(((i2.u0.p3==1)&&(i2.u13.p70==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * EG((((i2.u5.p27!=1)||(i4.u15.p80!=1))||(i5.u18.p86!=1)))),TRUE),((i2.u0.p3==1)&&(i2.u13.p70==1)))] != FALSE
(forward)formula 10,1,0.842873,24712,1,0,35347,290,1581,95107,204,1128,36285
FORMULA Raft-PT-04-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(EF((((((((i3.u11.p60==1)&&(i4.u15.p80==1))&&(i3.u14.p75==1))&&(i5.u16.p83==1))&&(u3.p20==1))&&(i2.u13.p70==1)) * AF(((i3.u8.p45==1)&&(i3.u14.p75==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((((((i3.u11.p60==1)&&(i4.u15.p80==1))&&(i3.u14.p75==1))&&(i5.u16.p83==1))&&(u3.p20==1))&&(i2.u13.p70==1))) * !(EG(!(((i3.u8.p45==1)&&(i3.u14.p75==1))))))] = FALSE
(forward)formula 11,0,0.847898,24976,1,0,35606,290,1613,95715,204,1128,36569
FORMULA Raft-PT-04-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(EX(((i3.u14.p75==1)&&(u17.p81==1))) U (((i1.u12.p65==1)&&(i5.u16.p83==1))&&((i3.u14.p73==1)||((i4.u15.p80==1)&&(i5.u16.p83==1)))))
=> equivalent forward existential formula: [(FwdU(Init,EX(((i3.u14.p75==1)&&(u17.p81==1)))) * (((i1.u12.p65==1)&&(i5.u16.p83==1))&&((i3.u14.p73==1)||((i4.u15.p80==1)&&(i5.u16.p83==1)))))] != FALSE
(forward)formula 12,0,0.980678,26824,1,0,38912,290,1629,103964,204,1145,38673
FORMULA Raft-PT-04-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
BK_STOP 1590053749396
--------------------
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-04"
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-04, 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-158961510700236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-04.tgz
mv Raft-PT-04 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 '
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 ;