About the Execution of ITS-Tools for QuasiCertifProtocol-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.780 | 257887.00 | 271374.00 | 414.00 | TTFFTFFFFTFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390900787.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390900787
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 5.8K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 153K 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 QuasiCertifProtocol-PT-06-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1589857987673
[2020-05-19 03:13:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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-19 03:13:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 03:13:09] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-05-19 03:13:09] [INFO ] Transformed 270 places.
[2020-05-19 03:13:09] [INFO ] Transformed 116 transitions.
[2020-05-19 03:13:09] [INFO ] Parsed PT model containing 270 places and 116 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Incomplete random walk after 100000 steps, including 9834 resets, run finished after 454 ms. (steps per millisecond=220 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0]
// Phase 1: matrix 116 rows 270 cols
[2020-05-19 03:13:10] [INFO ] Computed 155 place invariants in 24 ms
[2020-05-19 03:13:10] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-05-19 03:13:10] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 56 ms returned sat
[2020-05-19 03:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:10] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-05-19 03:13:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:13:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-05-19 03:13:10] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 48 ms returned sat
[2020-05-19 03:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:11] [INFO ] [Nat]Absence check using state equation in 795 ms returned unsat
[2020-05-19 03:13:11] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-19 03:13:11] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 66 ms returned sat
[2020-05-19 03:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:11] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2020-05-19 03:13:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:13:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:13:11] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2020-05-19 03:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:12] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2020-05-19 03:13:12] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-05-19 03:13:12] [INFO ] Added : 48 causal constraints over 10 iterations in 165 ms. Result :sat
[2020-05-19 03:13:12] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:13:12] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 53 ms returned sat
[2020-05-19 03:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:12] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-05-19 03:13:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:13:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-19 03:13:12] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 55 ms returned sat
[2020-05-19 03:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:12] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2020-05-19 03:13:12] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 03:13:13] [INFO ] Added : 58 causal constraints over 12 iterations in 154 ms. Result :sat
[2020-05-19 03:13:13] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-19 03:13:13] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 27 ms returned unsat
[2020-05-19 03:13:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:13:13] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 52 ms returned sat
[2020-05-19 03:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:13] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-05-19 03:13:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 03:13:13] [INFO ] Added : 49 causal constraints over 10 iterations in 135 ms. Result :sat
[2020-05-19 03:13:13] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:13:13] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 35 ms returned sat
[2020-05-19 03:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:13] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2020-05-19 03:13:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 03:13:13] [INFO ] Added : 18 causal constraints over 4 iterations in 79 ms. Result :sat
[2020-05-19 03:13:13] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-19 03:13:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:13:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:14] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-05-19 03:13:14] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 03:13:14] [INFO ] Added : 48 causal constraints over 10 iterations in 102 ms. Result :sat
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 59 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using state equation in 81 ms returned unsat
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 37 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using state equation in 47 ms returned unsat
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 37 ms returned sat
[2020-05-19 03:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:15] [INFO ] [Real]Absence check using state equation in 136 ms returned unsat
[2020-05-19 03:13:15] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:13:15] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 37 ms returned sat
[2020-05-19 03:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:15] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
[2020-05-19 03:13:15] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-19 03:13:15] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2020-05-19 03:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:15] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-05-19 03:13:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:13:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:13:15] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2020-05-19 03:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:15] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-05-19 03:13:15] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-05-19 03:13:15] [INFO ] Added : 51 causal constraints over 11 iterations in 116 ms. Result :sat
[2020-05-19 03:13:15] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:13:16] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 63 ms returned sat
[2020-05-19 03:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:16] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-05-19 03:13:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:13:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:13:16] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 52 ms returned sat
[2020-05-19 03:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:13:16] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-05-19 03:13:16] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 03:13:16] [INFO ] Added : 50 causal constraints over 10 iterations in 124 ms. Result :sat
[2020-05-19 03:13:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-05-19 03:13:16] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-19 03:13:16] [INFO ] Flatten gal took : 48 ms
[2020-05-19 03:13:16] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-19 03:13:16] [INFO ] Flatten gal took : 19 ms
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 03:13:16] [INFO ] Applying decomposition
[2020-05-19 03:13:16] [INFO ] Flatten gal took : 13 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/graph12498366931798254276.txt, -o, /tmp/graph12498366931798254276.bin, -w, /tmp/graph12498366931798254276.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/graph12498366931798254276.bin, -l, -1, -v, -w, /tmp/graph12498366931798254276.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 03:13:17] [INFO ] Decomposing Gal with order
[2020-05-19 03:13:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 03:13:17] [INFO ] Removed a total of 65 redundant transitions.
[2020-05-19 03:13:17] [INFO ] Flatten gal took : 43 ms
[2020-05-19 03:13:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 5 ms.
[2020-05-19 03:13:17] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 4 ms
[2020-05-19 03:13:17] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.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/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], 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/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
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.27196e+06,8.94722,214300,2,192718,5,1.20152e+06,6,0,1124,541956,0
Converting to forward existential form...Done !
original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 0,1,134.791,2677672,1,0,69,8.38483e+06,8,3,2211,4.46544e+06,2
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EX(TRUE) * EG(AF((gu16.Astart<=((((((gu16.n3_3+gu16.n3_2)+gu16.n3_1)+gu16.n3_0)+gu16.n3_6)+gu16.n3_4)+gu16.n3_5)))))
=> equivalent forward existential formula: [FwdG((Init * EX(TRUE)),!(EG(!((gu16.Astart<=((((((gu16.n3_3+gu16.n3_2)+gu16.n3_1)+gu16.n3_0)+gu16.n3_6)+gu16.n3_4)+gu16.n3_5))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.gu3.malS6_2, gi0.gu3.malS6_1, gi0.gu3.malS6_0, gi0.gu3.malS5_0, gi0.gu3.malS6_5, gi0.gu3.malS5_1, gi0.gu3.malS5_2, gi0.gu3.malS5_3, gi0.gu3.malS5_4, gi0.gu3.malS5_5, gi0.gu3.malS5_6, gi0.gu3.malS4_0, gi0.gu3.malS4_3, gi0.gu3.malS4_4, gi0.gu12.malA1, gi0.gu12.malA3, gi0.malA5, gi0.malS4_6, gi0.malS4_5, gi0.malS4_2, gi0.malS4_1, gi0.malS6_4, gi0.malS6_6, gi0.malS6_3, malC1_2, malC1_1, malC1_0, malC1_6, malC1_5, malC1_4, malC1_3, malS3_3, malS2_1, malS2_0, malS2_3, malS2_2, malS2_5, malS2_4, malS1_0, malS2_6, malS1_2, malS1_1, malS1_4, malS1_3, malA4, malA2, malS1_5, malS1_6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/48/110
(forward)formula 1,1,206.32,2854764,1,0,271,9.52315e+06,241,117,7506,7.72171e+06,229
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E(AG((((((((gu23.c1_0+gu23.c1_1)+gu23.c1_2)+gu23.c1_3)+gu23.c1_4)+gu23.c1_5)+gu23.c1_6)<=((((((gu23.n4_5+gu23.n4_6)+gu23.n4_3)+gu23.n4_4)+gu23.n4_1)+gu23.n4_2)+gu23.n4_0))) U AG((((((((gu7.s3_0+gu7.s3_1)+gu7.s3_4)+gu7.s3_5)+gu7.s3_2)+gu7.s3_3)+gu7.s3_6)>=3)))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !((((((((gu23.c1_0+gu23.c1_1)+gu23.c1_2)+gu23.c1_3)+gu23.c1_4)+gu23.c1_5)+gu23.c1_6)<=((((((gu23.n4_5+gu23.n4_6)+gu23.n4_3)+gu23.n4_4)+gu23.n4_1)+gu23.n4_2)+gu23.n4_0)))))) * !(E(TRUE U !((((((((gu7.s3_0+gu7.s3_1)+gu7.s3_4)+gu7.s3_5)+gu7.s3_2)+gu7.s3_3)+gu7.s3_6)>=3)))))] != FALSE
(forward)formula 2,0,239.278,3041464,1,0,277,1.0562e+07,20,119,4127,8.13423e+06,26
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF((((((((gu14.Cstart_5+gu14.Cstart_4)+gu14.Cstart_3)+gu14.Cstart_2)+gu14.Cstart_6)+gu14.Cstart_1)+gu14.Cstart_0)<3))
=> equivalent forward existential formula: [FwdG(Init,!((((((((gu14.Cstart_5+gu14.Cstart_4)+gu14.Cstart_3)+gu14.Cstart_2)+gu14.Cstart_6)+gu14.Cstart_1)+gu14.Cstart_0)<3)))] = FALSE
Hit Full ! (commute/partial/dont) 103/0/7
(forward)formula 3,0,241.976,3041464,1,0,277,1.0562e+07,28,119,4708,8.13423e+06,29
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(!(AF((gu13.a4>=1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((gu13.a4>=1)))] != FALSE
Hit Full ! (commute/partial/dont) 107/0/3
(forward)formula 4,1,242.109,3041464,1,0,277,1.0562e+07,36,119,4937,8.13423e+06,33
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(AX(((((((((gu10.n5_4+gu10.n5_5)+gu10.n5_2)+gu10.n5_3)+gu10.n5_0)+gu10.n5_1)+gu10.n5_6)>=1)||(gi0.gu0.CstopAbort<=gi0.gu0.a5))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((((((((gu10.n5_4+gu10.n5_5)+gu10.n5_2)+gu10.n5_3)+gu10.n5_0)+gu10.n5_1)+gu10.n5_6)>=1)||(gi0.gu0.CstopAbort<=gi0.gu0.a5))))] = FALSE
(forward)formula 5,0,244.476,3041464,1,0,277,1.0562e+07,38,119,5093,8.13423e+06,35
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG((((((((gi2.gu11.Sstart_3+gi2.gu11.Sstart_2)+gi2.gu11.Sstart_1)+gi2.gu11.Sstart_0)+gi2.gu11.Sstart_6)+gi2.gu11.Sstart_5)+gi2.gu11.Sstart_4)>=2))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((((gi2.gu11.Sstart_3+gi2.gu11.Sstart_2)+gi2.gu11.Sstart_1)+gi2.gu11.Sstart_0)+gi2.gu11.Sstart_6)+gi2.gu11.Sstart_5)+gi2.gu11.Sstart_4)>=2)))] = FALSE
(forward)formula 6,0,244.612,3041464,1,0,277,1.0562e+07,40,119,5174,8.13423e+06,36
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF((((((((((gu10.n5_4+gu10.n5_5)+gu10.n5_2)+gu10.n5_3)+gu10.n5_0)+gu10.n5_1)+gu10.n5_6)<=((((((gu10.s2_1+gu10.s2_2)+gu10.s2_0)+gu10.s2_5)+gu10.s2_6)+gu10.s2_3)+gu10.s2_4))&&(((((((((((((((((((((((((((((((((((((((((((((((((gu13.n9_2_0+gu13.n9_1_0)+gu13.n9_0_0)+gu13.n9_0_1)+gu13.n9_1_1)+gu13.n9_2_1)+gu13.n9_3_1)+gu13.n9_3_0)+gu13.n9_4_0)+gu13.n9_5_0)+gu13.n9_6_0)+gu13.n9_1_2)+gu13.n9_2_2)+gu13.n9_3_2)+gu13.n9_4_2)+gu13.n9_4_1)+gu13.n9_5_1)+gu13.n9_6_1)+gu13.n9_0_2)+gu13.n9_3_3)+gu13.n9_2_3)+gu13.n9_5_3)+gu13.n9_4_3)+gu13.n9_6_2)+gu13.n9_5_2)+gu13.n9_1_3)+gu13.n9_0_3)+gu13.n9_4_4)+gu13.n9_3_4)+gu13.n9_6_4)+gu13.n9_5_4)+gu13.n9_0_4)+gu13.n9_6_3)+gu13.n9_2_4)+gu13.n9_1_4)+gu13.n9_6_5)+gu13.n9_0_6)+gu13.n9_4_5)+gu13.n9_5_5)+gu13.n9_2_5)+gu13.n9_3_5)+gu13.n9_0_5)+gu13.n9_1_5)+gu13.n9_5_6)+gu13.n9_6_6)+gu13.n9_3_6)+gu13.n9_4_6)+gu13.n9_1_6)+gu13.n9_2_6)<=gu13.a4))&&(gi0.gu12.a3>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((gu10.n5_4+gu10.n5_5)+gu10.n5_2)+gu10.n5_3)+gu10.n5_0)+gu10.n5_1)+gu10.n5_6)<=((((((gu10.s2_1+gu10.s2_2)+gu10.s2_0)+gu10.s2_5)+gu10.s2_6)+gu10.s2_3)+gu10.s2_4))&&(((((((((((((((((((((((((((((((((((((((((((((((((gu13.n9_2_0+gu13.n9_1_0)+gu13.n9_0_0)+gu13.n9_0_1)+gu13.n9_1_1)+gu13.n9_2_1)+gu13.n9_3_1)+gu13.n9_3_0)+gu13.n9_4_0)+gu13.n9_5_0)+gu13.n9_6_0)+gu13.n9_1_2)+gu13.n9_2_2)+gu13.n9_3_2)+gu13.n9_4_2)+gu13.n9_4_1)+gu13.n9_5_1)+gu13.n9_6_1)+gu13.n9_0_2)+gu13.n9_3_3)+gu13.n9_2_3)+gu13.n9_5_3)+gu13.n9_4_3)+gu13.n9_6_2)+gu13.n9_5_2)+gu13.n9_1_3)+gu13.n9_0_3)+gu13.n9_4_4)+gu13.n9_3_4)+gu13.n9_6_4)+gu13.n9_5_4)+gu13.n9_0_4)+gu13.n9_6_3)+gu13.n9_2_4)+gu13.n9_1_4)+gu13.n9_6_5)+gu13.n9_0_6)+gu13.n9_4_5)+gu13.n9_5_5)+gu13.n9_2_5)+gu13.n9_3_5)+gu13.n9_0_5)+gu13.n9_1_5)+gu13.n9_5_6)+gu13.n9_6_6)+gu13.n9_3_6)+gu13.n9_4_6)+gu13.n9_1_6)+gu13.n9_2_6)<=gu13.a4))&&(gi0.gu12.a3>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 63/0/47
(forward)formula 7,0,245.401,3041464,1,0,277,1.0562e+07,48,119,8171,8.13423e+06,39
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EG((gu13.a2<=gu13.n9_0_2))
=> equivalent forward existential formula: [FwdG(Init,(gu13.a2<=gu13.n9_0_2))] != FALSE
Hit Full ! (commute/partial/dont) 105/0/5
(forward)formula 8,1,245.477,3041464,1,0,277,1.0562e+07,55,119,8265,8.13423e+06,42
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(AX(((gu13.n9_5_2<=gu13.n8_0_0)||(gi0.gu8.n7_5_0>=1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((gu13.n9_5_2<=gu13.n8_0_0)||(gi0.gu8.n7_5_0>=1))))] = FALSE
(forward)formula 9,0,245.85,3041464,1,0,277,1.0562e+07,57,119,8272,8.13423e+06,43
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(AX(AG((gu23.c1_3<=gu23.n8_1_3))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((gu23.c1_3<=gu23.n8_1_3)))] != FALSE
(forward)formula 10,1,246.809,3041464,1,0,277,1.0562e+07,63,119,8282,8.13423e+06,46
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1589858245560
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="CTLCardinality"
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 QuasiCertifProtocol-PT-06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tajo-158961390900787"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;