fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r126-tajo-158961390800731
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for QuasiCertifProtocol-COL-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15738.950 326096.00 341224.00 1318.40 TTFFTFFFFFFFFTTT 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-158961390800731.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-COL-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390800731
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 3.7K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 61K 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-COL-06-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589852246030

[2020-05-19 01:37:27] [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 01:37:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 01:37:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-19 01:37:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 577 ms
[2020-05-19 01:37:28] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2020-05-19 01:37:28] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 41 ms.
[2020-05-19 01:37:28] [INFO ] Computed order based on color domains.
[2020-05-19 01:37:28] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 11 ms.
[2020-05-19 01:37:28] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Incomplete random walk after 100000 steps, including 9832 resets, run finished after 602 ms. (steps per millisecond=166 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0]
// Phase 1: matrix 116 rows 270 cols
[2020-05-19 01:37:29] [INFO ] Computed 155 place invariants in 21 ms
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using 11 positive place invariants in 34 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 75 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2020-05-19 01:37:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 78 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:33] [INFO ] [Nat]Absence check using state equation in 3228 ms returned unsat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 55 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-05-19 01:37:33] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:33] [INFO ] Added : 38 causal constraints over 8 iterations in 128 ms. Result :sat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-05-19 01:37:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:34] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2020-05-19 01:37:34] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:34] [INFO ] Added : 50 causal constraints over 10 iterations in 112 ms. Result :sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 25 ms returned unsat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 30 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-05-19 01:37:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 30 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:35] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-05-19 01:37:35] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 01:37:35] [INFO ] Added : 41 causal constraints over 9 iterations in 81 ms. Result :sat
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 31 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2020-05-19 01:37:35] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:35] [INFO ] Added : 20 causal constraints over 4 iterations in 64 ms. Result :sat
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 36 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-05-19 01:37:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:35] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2020-05-19 01:37:35] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:35] [INFO ] Added : 40 causal constraints over 8 iterations in 87 ms. Result :sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned unsat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2020-05-19 01:37:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 56 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:36] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-05-19 01:37:36] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 18 ms.
[2020-05-19 01:37:37] [INFO ] Added : 52 causal constraints over 11 iterations in 280 ms. Result :sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 71 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2020-05-19 01:37:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 119 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:38] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2020-05-19 01:37:38] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-05-19 01:37:38] [INFO ] Added : 48 causal constraints over 10 iterations in 158 ms. Result :sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 44 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-05-19 01:37:38] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 01:37:38] [INFO ] Added : 41 causal constraints over 9 iterations in 132 ms. Result :sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:39] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-05-19 01:37:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:39] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-05-19 01:37:39] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 01:37:39] [INFO ] Added : 50 causal constraints over 10 iterations in 120 ms. Result :sat
[2020-05-19 01:37:39] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 60 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:39] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2020-05-19 01:37:39] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:37:39] [INFO ] Added : 42 causal constraints over 9 iterations in 150 ms. Result :sat
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 59 ms returned sat
[2020-05-19 01:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2020-05-19 01:37:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-19 01:37:40] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 69 ms returned sat
[2020-05-19 01:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:41] [INFO ] [Nat]Absence check using state equation in 710 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-19 01:37:41] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 01:37:41] [INFO ] Flatten gal took : 82 ms
[2020-05-19 01:37:41] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 01:37:41] [INFO ] Flatten gal took : 24 ms
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 01:37:41] [INFO ] Applying decomposition
[2020-05-19 01:37:41] [INFO ] Flatten gal took : 21 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/graph17611083545604946617.txt, -o, /tmp/graph17611083545604946617.bin, -w, /tmp/graph17611083545604946617.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/graph17611083545604946617.bin, -l, -1, -v, -w, /tmp/graph17611083545604946617.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 01:37:41] [INFO ] Decomposing Gal with order
[2020-05-19 01:37:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 01:37:41] [INFO ] Removed a total of 84 redundant transitions.
[2020-05-19 01:37:42] [INFO ] Flatten gal took : 80 ms
[2020-05-19 01:37:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 10 ms.
[2020-05-19 01:37:42] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 6 ms
[2020-05-19 01:37:42] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.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/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 13 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,5.42272,178480,2,216662,5,696550,6,0,1124,675103,0


Converting to forward existential form...Done !
original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 0,1,125.824,2585324,1,0,69,8.0258e+06,8,3,2196,7.39267e+06,2
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(TRUE) * EG(AF((gi2.gu3.Astart_0<=((((((gi2.gu3.n3_0+gi2.gu3.n3_1)+gi2.gu3.n3_2)+gi2.gu3.n3_3)+gi2.gu3.n3_4)+gi2.gu3.n3_5)+gi2.gu3.n3_6)))))
=> equivalent forward existential formula: [FwdG((Init * EX(TRUE)),!(EG(!((gi2.gu3.Astart_0<=((((((gi2.gu3.n3_0+gi2.gu3.n3_1)+gi2.gu3.n3_2)+gi2.gu3.n3_3)+gi2.gu3.n3_4)+gi2.gu3.n3_5)+gi2.gu3.n3_6))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gu8.malS4i0, gu8.malS4i1, gu8.malS4i2, gu8.malS4i3, gu8.malS4i4, gu8.malS4i5, gu8.malS4i6, gi6.gu1.malA3, gi6.gu1.malA2, gi6.gu1.malA1, malC1i0, malC1i1, malC1i2, malC1i3, malC1i4, malC1i5, malC1i6, malS6i0, malS6i1, malS6i2, malS6i3, malS6i4, malS6i5, malS6i6, malS5i0, malS5i1, malS5i2, malS5i3, malS5i4, malS5i5, malS5i6, malS3i6, malS2i0, malS2i1, malS2i2, malS2i3, malS2i4, malS2i5, malS2i6, malS1i0, malS1i1, malS1i2, malS1i3, malS1i4, malS1i5, malS1i6, malA5, malA4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/48/110
(forward)formula 1,1,208.158,3156148,1,0,271,1.18682e+07,241,117,7338,1.17829e+07,229
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(AG((((((((gu2.c1_0+gu2.c1_1)+gu2.c1_2)+gu2.c1_3)+gu2.c1_4)+gu2.c1_5)+gu2.c1_6)<=((((((gu2.n4_0+gu2.n4_1)+gu2.n4_2)+gu2.n4_3)+gu2.n4_4)+gu2.n4_5)+gu2.n4_6))) U AG((((((((gi6.gu7.s3_0+gi6.gu7.s3_1)+gi6.gu7.s3_2)+gi6.gu7.s3_3)+gi6.gu7.s3_4)+gi6.gu7.s3_5)+gi6.gu7.s3_6)>=3)))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !((((((((gu2.c1_0+gu2.c1_1)+gu2.c1_2)+gu2.c1_3)+gu2.c1_4)+gu2.c1_5)+gu2.c1_6)<=((((((gu2.n4_0+gu2.n4_1)+gu2.n4_2)+gu2.n4_3)+gu2.n4_4)+gu2.n4_5)+gu2.n4_6)))))) * !(E(TRUE U !((((((((gi6.gu7.s3_0+gi6.gu7.s3_1)+gi6.gu7.s3_2)+gi6.gu7.s3_3)+gi6.gu7.s3_4)+gi6.gu7.s3_5)+gi6.gu7.s3_6)>=3)))))] != FALSE
(forward)formula 2,0,259.86,3470768,1,0,277,1.36127e+07,20,119,4057,1.25346e+07,26
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((((((gu5.Cstart_0+gu5.Cstart_1)+gu5.Cstart_2)+gu5.Cstart_3)+gu5.Cstart_4)+gu5.Cstart_5)+gu5.Cstart_6)<3))
=> equivalent forward existential formula: [FwdG(Init,!((((((((gu5.Cstart_0+gu5.Cstart_1)+gu5.Cstart_2)+gu5.Cstart_3)+gu5.Cstart_4)+gu5.Cstart_5)+gu5.Cstart_6)<3)))] = FALSE
Hit Full ! (commute/partial/dont) 103/0/7
(forward)formula 3,0,262.018,3470768,1,0,277,1.36127e+07,28,119,4566,1.25346e+07,29
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(!(AF((gu0.a4_0>=1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((gu0.a4_0>=1)))] != FALSE
Hit Full ! (commute/partial/dont) 107/0/3
(forward)formula 4,1,262.752,3470768,1,0,277,1.36127e+07,36,119,4784,1.25346e+07,33
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(AX(((((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6)>=1)||(gu11.CstopAbort_0<=gu11.a5_0))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6)>=1)||(gu11.CstopAbort_0<=gu11.a5_0))))] = FALSE
(forward)formula 5,0,265.532,3470768,1,0,277,1.36127e+07,38,119,4933,1.25346e+07,35
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((((((((gu6.Sstart_0+gu6.Sstart_1)+gu6.Sstart_2)+gu6.Sstart_3)+gu6.Sstart_4)+gu6.Sstart_5)+gu6.Sstart_6)>=2))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((((gu6.Sstart_0+gu6.Sstart_1)+gu6.Sstart_2)+gu6.Sstart_3)+gu6.Sstart_4)+gu6.Sstart_5)+gu6.Sstart_6)>=2)))] = FALSE
(forward)formula 6,0,265.801,3470768,1,0,277,1.36127e+07,40,119,4968,1.25346e+07,36
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6)<=((((((gi6.gu1.s2_0+gi6.gu1.s2_1)+gi6.gu1.s2_2)+gi6.gu1.s2_3)+gi6.gu1.s2_4)+gi6.gu1.s2_5)+gi6.gu1.s2_6))&&(((((((((((((((((((((((((((((((((((((((((((((((((gu0.n9_0+gu0.n9_1)+gu0.n9_2)+gu0.n9_3)+gu0.n9_4)+gu0.n9_5)+gu0.n9_6)+gu0.n9_7)+gu0.n9_8)+gu0.n9_9)+gu0.n9_10)+gu0.n9_11)+gu0.n9_12)+gu0.n9_13)+gu0.n9_14)+gu0.n9_15)+gu0.n9_16)+gu0.n9_17)+gu0.n9_18)+gu0.n9_19)+gu0.n9_20)+gu0.n9_21)+gu0.n9_22)+gu0.n9_23)+gu0.n9_24)+gu0.n9_25)+gu0.n9_26)+gu0.n9_27)+gu0.n9_28)+gu0.n9_29)+gu0.n9_30)+gu0.n9_31)+gu0.n9_32)+gu0.n9_33)+gu0.n9_34)+gu0.n9_35)+gu0.n9_36)+gu0.n9_37)+gu0.n9_38)+gu0.n9_39)+gu0.n9_40)+gu0.n9_41)+gu0.n9_42)+gu0.n9_43)+gu0.n9_44)+gu0.n9_45)+gu0.n9_46)+gu0.n9_47)+gu0.n9_48)<=gu0.a4_0))&&(gi6.gu1.a3_0>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6)<=((((((gi6.gu1.s2_0+gi6.gu1.s2_1)+gi6.gu1.s2_2)+gi6.gu1.s2_3)+gi6.gu1.s2_4)+gi6.gu1.s2_5)+gi6.gu1.s2_6))&&(((((((((((((((((((((((((((((((((((((((((((((((((gu0.n9_0+gu0.n9_1)+gu0.n9_2)+gu0.n9_3)+gu0.n9_4)+gu0.n9_5)+gu0.n9_6)+gu0.n9_7)+gu0.n9_8)+gu0.n9_9)+gu0.n9_10)+gu0.n9_11)+gu0.n9_12)+gu0.n9_13)+gu0.n9_14)+gu0.n9_15)+gu0.n9_16)+gu0.n9_17)+gu0.n9_18)+gu0.n9_19)+gu0.n9_20)+gu0.n9_21)+gu0.n9_22)+gu0.n9_23)+gu0.n9_24)+gu0.n9_25)+gu0.n9_26)+gu0.n9_27)+gu0.n9_28)+gu0.n9_29)+gu0.n9_30)+gu0.n9_31)+gu0.n9_32)+gu0.n9_33)+gu0.n9_34)+gu0.n9_35)+gu0.n9_36)+gu0.n9_37)+gu0.n9_38)+gu0.n9_39)+gu0.n9_40)+gu0.n9_41)+gu0.n9_42)+gu0.n9_43)+gu0.n9_44)+gu0.n9_45)+gu0.n9_46)+gu0.n9_47)+gu0.n9_48)<=gu0.a4_0))&&(gi6.gu1.a3_0>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 63/0/47
(forward)formula 7,0,267.69,3470768,1,0,277,1.36127e+07,48,119,7179,1.25346e+07,39
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((!(EF((((((((((((((((((((((((((((((((((((((((((((((((((gu0.n9_0+gu0.n9_1)+gu0.n9_2)+gu0.n9_3)+gu0.n9_4)+gu0.n9_5)+gu0.n9_6)+gu0.n9_7)+gu0.n9_8)+gu0.n9_9)+gu0.n9_10)+gu0.n9_11)+gu0.n9_12)+gu0.n9_13)+gu0.n9_14)+gu0.n9_15)+gu0.n9_16)+gu0.n9_17)+gu0.n9_18)+gu0.n9_19)+gu0.n9_20)+gu0.n9_21)+gu0.n9_22)+gu0.n9_23)+gu0.n9_24)+gu0.n9_25)+gu0.n9_26)+gu0.n9_27)+gu0.n9_28)+gu0.n9_29)+gu0.n9_30)+gu0.n9_31)+gu0.n9_32)+gu0.n9_33)+gu0.n9_34)+gu0.n9_35)+gu0.n9_36)+gu0.n9_37)+gu0.n9_38)+gu0.n9_39)+gu0.n9_40)+gu0.n9_41)+gu0.n9_42)+gu0.n9_43)+gu0.n9_44)+gu0.n9_45)+gu0.n9_46)+gu0.n9_47)+gu0.n9_48)>=1))) * EX(((((((((gi6.gu1.s6_0+gi6.gu1.s6_1)+gi6.gu1.s6_2)+gi6.gu1.s6_3)+gi6.gu1.s6_4)+gi6.gu1.s6_5)+gi6.gu1.s6_6)<=((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6))||(gi6.gu1.AstopAbort_0>=1)))) * EX((gi6.gu1.a1_0<=((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * (((((((((((((((((((((((((((((((((((((((((((((((((gu0.n9_0+gu0.n9_1)+gu0.n9_2)+gu0.n9_3)+gu0.n9_4)+gu0.n9_5)+gu0.n9_6)+gu0.n9_7)+gu0.n9_8)+gu0.n9_9)+gu0.n9_10)+gu0.n9_11)+gu0.n9_12)+gu0.n9_13)+gu0.n9_14)+gu0.n9_15)+gu0.n9_16)+gu0.n9_17)+gu0.n9_18)+gu0.n9_19)+gu0.n9_20)+gu0.n9_21)+gu0.n9_22)+gu0.n9_23)+gu0.n9_24)+gu0.n9_25)+gu0.n9_26)+gu0.n9_27)+gu0.n9_28)+gu0.n9_29)+gu0.n9_30)+gu0.n9_31)+gu0.n9_32)+gu0.n9_33)+gu0.n9_34)+gu0.n9_35)+gu0.n9_36)+gu0.n9_37)+gu0.n9_38)+gu0.n9_39)+gu0.n9_40)+gu0.n9_41)+gu0.n9_42)+gu0.n9_43)+gu0.n9_44)+gu0.n9_45)+gu0.n9_46)+gu0.n9_47)+gu0.n9_48)>=1))] = FALSE * [(Init * !(EX(((((((((gi6.gu1.s6_0+gi6.gu1.s6_1)+gi6.gu1.s6_2)+gi6.gu1.s6_3)+gi6.gu1.s6_4)+gi6.gu1.s6_5)+gi6.gu1.s6_6)<=((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6))||(gi6.gu1.AstopAbort_0>=1)))))] = FALSE) * [(Init * !(EX((gi6.gu1.a1_0<=((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6)))))] = FALSE)
(forward)formula 8,0,280.968,3470768,1,0,277,1.36127e+07,51,119,9277,1.25346e+07,50
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF((((((((gu6.Sstart_0+gu6.Sstart_1)+gu6.Sstart_2)+gu6.Sstart_3)+gu6.Sstart_4)+gu6.Sstart_5)+gu6.Sstart_6)<1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((((gu6.Sstart_0+gu6.Sstart_1)+gu6.Sstart_2)+gu6.Sstart_3)+gu6.Sstart_4)+gu6.Sstart_5)+gu6.Sstart_6)<1))] = FALSE
(forward)formula 9,0,281.219,3470768,1,0,277,1.36127e+07,52,119,9305,1.25346e+07,51
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(E((((((((gi2.gu10.SstopOK_0+gi2.gu10.SstopOK_1)+gi2.gu10.SstopOK_2)+gi2.gu10.SstopOK_3)+gi2.gu10.SstopOK_4)+gi2.gu10.SstopOK_5)+gi2.gu10.SstopOK_6)<=gi2.gu3.Astart_0) U (((((((gu9.s5_0+gu9.s5_1)+gu9.s5_2)+gu9.s5_3)+gu9.s5_4)+gu9.s5_5)+gu9.s5_6)>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((((((((gi2.gu10.SstopOK_0+gi2.gu10.SstopOK_1)+gi2.gu10.SstopOK_2)+gi2.gu10.SstopOK_3)+gi2.gu10.SstopOK_4)+gi2.gu10.SstopOK_5)+gi2.gu10.SstopOK_6)<=gi2.gu3.Astart_0) U (((((((gu9.s5_0+gu9.s5_1)+gu9.s5_2)+gu9.s5_3)+gu9.s5_4)+gu9.s5_5)+gu9.s5_6)>=1))))] = FALSE
(forward)formula 10,0,284.604,3470768,1,0,277,1.36127e+07,57,119,9370,1.25346e+07,185
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((((((((gi6.gu7.s3_0+gi6.gu7.s3_1)+gi6.gu7.s3_2)+gi6.gu7.s3_3)+gi6.gu7.s3_4)+gi6.gu7.s3_5)+gi6.gu7.s3_6)<=((((((gi6.gu1.s6_0+gi6.gu1.s6_1)+gi6.gu1.s6_2)+gi6.gu1.s6_3)+gi6.gu1.s6_4)+gi6.gu1.s6_5)+gi6.gu1.s6_6)) + EF((gi6.gu1.AstopAbort_0<=gi6.gu1.a3_0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((((((((gi6.gu7.s3_0+gi6.gu7.s3_1)+gi6.gu7.s3_2)+gi6.gu7.s3_3)+gi6.gu7.s3_4)+gi6.gu7.s3_5)+gi6.gu7.s3_6)<=((((((gi6.gu1.s6_0+gi6.gu1.s6_1)+gi6.gu1.s6_2)+gi6.gu1.s6_3)+gi6.gu1.s6_4)+gi6.gu1.s6_5)+gi6.gu1.s6_6)))) * !(E(TRUE U (gi6.gu1.AstopAbort_0<=gi6.gu1.a3_0))))] = FALSE
(forward)formula 11,0,305.532,3481008,1,0,277,1.48192e+07,60,119,9478,1.25346e+07,193
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((((((((((gi6.gu1.s2_0+gi6.gu1.s2_1)+gi6.gu1.s2_2)+gi6.gu1.s2_3)+gi6.gu1.s2_4)+gi6.gu1.s2_5)+gi6.gu1.s2_6)<=((((((gi6.gu7.s3_0+gi6.gu7.s3_1)+gi6.gu7.s3_2)+gi6.gu7.s3_3)+gi6.gu7.s3_4)+gi6.gu7.s3_5)+gi6.gu7.s3_6))||(((((((gu4.n2_0+gu4.n2_1)+gu4.n2_2)+gu4.n2_3)+gu4.n2_4)+gu4.n2_5)+gu4.n2_6)>=1))||(((gu8.malicious_reservoir_0>=3)||(((((((gu8.s4_0+gu8.s4_1)+gu8.s4_2)+gu8.s4_3)+gu8.s4_4)+gu8.s4_5)+gu8.s4_6)<=gu8.malicious_reservoir_0))&&((((((((gu12.CstopOK_0+gu12.CstopOK_1)+gu12.CstopOK_2)+gu12.CstopOK_3)+gu12.CstopOK_4)+gu12.CstopOK_5)+gu12.CstopOK_6)>=1)||(((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6)>=2))))||((((((((gi2.gu10.SstopOK_0+gi2.gu10.SstopOK_1)+gi2.gu10.SstopOK_2)+gi2.gu10.SstopOK_3)+gi2.gu10.SstopOK_4)+gi2.gu10.SstopOK_5)+gi2.gu10.SstopOK_6)>=3)&&(gi6.gu1.a3_0<=((((((gi6.gu1.s2_0+gi6.gu1.s2_1)+gi6.gu1.s2_2)+gi6.gu1.s2_3)+gi6.gu1.s2_4)+gi6.gu1.s2_5)+gi6.gu1.s2_6)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((((((((gi6.gu1.s2_0+gi6.gu1.s2_1)+gi6.gu1.s2_2)+gi6.gu1.s2_3)+gi6.gu1.s2_4)+gi6.gu1.s2_5)+gi6.gu1.s2_6)<=((((((gi6.gu7.s3_0+gi6.gu7.s3_1)+gi6.gu7.s3_2)+gi6.gu7.s3_3)+gi6.gu7.s3_4)+gi6.gu7.s3_5)+gi6.gu7.s3_6))||(((((((gu4.n2_0+gu4.n2_1)+gu4.n2_2)+gu4.n2_3)+gu4.n2_4)+gu4.n2_5)+gu4.n2_6)>=1))||(((gu8.malicious_reservoir_0>=3)||(((((((gu8.s4_0+gu8.s4_1)+gu8.s4_2)+gu8.s4_3)+gu8.s4_4)+gu8.s4_5)+gu8.s4_6)<=gu8.malicious_reservoir_0))&&((((((((gu12.CstopOK_0+gu12.CstopOK_1)+gu12.CstopOK_2)+gu12.CstopOK_3)+gu12.CstopOK_4)+gu12.CstopOK_5)+gu12.CstopOK_6)>=1)||(((((((gi6.gu1.n5_0+gi6.gu1.n5_1)+gi6.gu1.n5_2)+gi6.gu1.n5_3)+gi6.gu1.n5_4)+gi6.gu1.n5_5)+gi6.gu1.n5_6)>=2))))||((((((((gi2.gu10.SstopOK_0+gi2.gu10.SstopOK_1)+gi2.gu10.SstopOK_2)+gi2.gu10.SstopOK_3)+gi2.gu10.SstopOK_4)+gi2.gu10.SstopOK_5)+gi2.gu10.SstopOK_6)>=3)&&(gi6.gu1.a3_0<=((((((gi6.gu1.s2_0+gi6.gu1.s2_1)+gi6.gu1.s2_2)+gi6.gu1.s2_3)+gi6.gu1.s2_4)+gi6.gu1.s2_5)+gi6.gu1.s2_6))))))] = FALSE
(forward)formula 12,0,307.557,3481008,1,0,277,1.49193e+07,62,119,10195,1.25346e+07,194
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589852572126

--------------------
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-COL-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-COL-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-158961390800731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;