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-158961390800724.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-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390800724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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.6K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 34K 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-02-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589852206269

[2020-05-19 01:36:47] [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-19 01:36:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 01:36:47] [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:36:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 498 ms
[2020-05-19 01:36:48] [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:36:48] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 17 ms.
[2020-05-19 01:36:48] [INFO ] Computed order based on color domains.
[2020-05-19 01:36:48] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions in 5 ms.
[2020-05-19 01:36:48] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Incomplete random walk after 100000 steps, including 16425 resets, run finished after 319 ms. (steps per millisecond=313 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0]
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 01:36:48] [INFO ] Computed 31 place invariants in 5 ms
[2020-05-19 01:36:48] [INFO ] [Real]Absence check using 7 positive place invariants in 19 ms returned unsat
[2020-05-19 01:36:48] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-05-19 01:36:48] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-05-19 01:36:48] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-19 01:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:48] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-05-19 01:36:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:36:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-05-19 01:36:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:49] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 7 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using state equation in 43 ms returned unsat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-19 01:36:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 9 ms.
[2020-05-19 01:36:49] [INFO ] Added : 8 causal constraints over 2 iterations in 24 ms. Result :sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-19 01:36:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 6 ms.
[2020-05-19 01:36:49] [INFO ] Added : 16 causal constraints over 4 iterations in 29 ms. Result :sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-05-19 01:36:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 8 ms.
[2020-05-19 01:36:49] [INFO ] Added : 22 causal constraints over 5 iterations in 37 ms. Result :sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-19 01:36:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-05-19 01:36:49] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-05-19 01:36:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-05-19 01:36:49] [INFO ] Added : 19 causal constraints over 4 iterations in 25 ms. Result :sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-05-19 01:36:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:49] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:49] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-19 01:36:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:36:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:50] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-05-19 01:36:50] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:50] [INFO ] Added : 14 causal constraints over 3 iterations in 17 ms. Result :sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-19 01:36:50] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 6 ms.
[2020-05-19 01:36:50] [INFO ] Added : 24 causal constraints over 5 iterations in 32 ms. Result :sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 13 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-19 01:36:50] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:50] [INFO ] Added : 21 causal constraints over 5 iterations in 58 ms. Result :sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-19 01:36:50] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:50] [INFO ] Added : 22 causal constraints over 5 iterations in 50 ms. Result :sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 8 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-19 01:36:50] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 12 ms.
[2020-05-19 01:36:50] [INFO ] Added : 9 causal constraints over 2 iterations in 26 ms. Result :sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 9 ms returned sat
[2020-05-19 01:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:50] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-19 01:36:50] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 2 ms.
[2020-05-19 01:36:50] [INFO ] Added : 19 causal constraints over 4 iterations in 21 ms. Result :sat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-19 01:36:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-19 01:36:50] [INFO ] Flatten gal took : 43 ms
[2020-05-19 01:36:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-19 01:36:50] [INFO ] Flatten gal took : 18 ms
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 01:36:50] [INFO ] Applying decomposition
[2020-05-19 01:36:50] [INFO ] Flatten gal took : 15 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/graph17845796033823096892.txt, -o, /tmp/graph17845796033823096892.bin, -w, /tmp/graph17845796033823096892.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/graph17845796033823096892.bin, -l, -1, -v, -w, /tmp/graph17845796033823096892.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 01:36:50] [INFO ] Decomposing Gal with order
[2020-05-19 01:36:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 01:36:51] [INFO ] Removed a total of 17 redundant transitions.
[2020-05-19 01:36:51] [INFO ] Flatten gal took : 49 ms
[2020-05-19 01:36:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 7 ms.
[2020-05-19 01:36:51] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 4 ms
[2020-05-19 01:36:51] [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 14 CTL formulae.
built 14 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 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,1029,0.054651,6164,651,144,3096,476,273,3219,73,1600,0


Converting to forward existential form...Done !
original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.174874,10508,1,0,11417,1470,935,16434,334,6222,32255
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((((i0.i1.u5.n5_1>=1)&&(u1.s3_1>=1))||((i0.i1.u6.n5_2>=1)&&(u1.s3_2>=1)))||((i0.i1.u7.n5_0>=1)&&(i4.i1.u15.s3_0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((i0.i1.u5.n5_1>=1)&&(u1.s3_1>=1))||((i0.i1.u6.n5_2>=1)&&(u1.s3_2>=1)))||((i0.i1.u7.n5_0>=1)&&(i4.i1.u15.s3_0>=1)))))] = FALSE
(forward)formula 1,0,0.183763,10772,1,0,12250,1470,987,17381,334,6263,35273
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(AF((i0.i0.u2.a2_0>=1))) * EF(((((((i0.i0.u2.a1_0>=1)||(i0.i0.u2.a4_0>=1))||(i4.i1.u8.n4_0<1))||(i0.i0.u10.n4_1<1))||(i0.i0.u9.n4_2<1))||(i0.i0.u2.a3_0<1))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!((i0.i0.u2.a2_0>=1)))] = FALSE * [(Init * !(E(TRUE U ((((((i0.i0.u2.a1_0>=1)||(i0.i0.u2.a4_0>=1))||(i4.i1.u8.n4_0<1))||(i0.i0.u10.n4_1<1))||(i0.i0.u9.n4_2<1))||(i0.i0.u2.a3_0<1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions malC1i0, malS6i0, malS6i1, malS4i2, malS3i0, malS1i0, u1.malS3i1, u1.malS3i2, u1.malS2i1, u1.malS2i2, u1.malS1i1, u1.malS1i2, i0.i0.u2.malA5, i0.i0.u2.malA3, i0.i0.u2.malA4, i0.i0.u2.malA2, i0.i0.u2.malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/17/47
(forward)formula 2,0,0.234341,12884,1,0,15795,1584,1481,22168,426,6953,49305
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(EG(((((u1.malicious_reservoir_0<1)||(i4.i1.u14.Sstart_0<1))&&((u1.malicious_reservoir_0<1)||(u1.Sstart_1<1)))&&((u1.malicious_reservoir_0<1)||(u1.Sstart_2<1))))) + EG(((((i4.i1.u14.n2_0>=1)&&(i4.i0.u11.n2_1>=1))&&(i4.i0.u12.n2_2>=1))&&(i0.i0.u2.a1_0>=1))))
=> equivalent forward existential formula: ([FwdG(EY(Init),((((u1.malicious_reservoir_0<1)||(i4.i1.u14.Sstart_0<1))&&((u1.malicious_reservoir_0<1)||(u1.Sstart_1<1)))&&((u1.malicious_reservoir_0<1)||(u1.Sstart_2<1))))] != FALSE + [FwdG(Init,((((i4.i1.u14.n2_0>=1)&&(i4.i0.u11.n2_1>=1))&&(i4.i0.u12.n2_2>=1))&&(i0.i0.u2.a1_0>=1)))] != FALSE)
(forward)formula 3,1,0.23788,13148,1,0,15939,1584,1525,22307,433,6954,50198
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((((i4.i1.u14.n2_0>=1)&&(i4.i0.u11.n2_1>=1))&&(i4.i0.u12.n2_2>=1))&&(i0.i0.u2.a1_0>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((i4.i1.u14.n2_0>=1)&&(i4.i0.u11.n2_1>=1))&&(i4.i0.u12.n2_2>=1))&&(i0.i0.u2.a1_0>=1))))] = FALSE
(forward)formula 4,0,0.241186,13148,1,0,16131,1584,1567,22468,433,6957,51237
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF(EG((((i5.u16.s4_1>=1)||(i2.u4.s4_0>=1))||(i6.u17.s4_2>=1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((((i5.u16.s4_1>=1)||(i2.u4.s4_0>=1))||(i6.u17.s4_2>=1)))))] = FALSE
(forward)formula 5,0,0.245769,13412,1,0,16198,1585,1583,22599,433,6958,51852
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((!(E((i0.i0.u2.a1_0>=1) U (i0.i0.u2.a3_0>=1))) * EX(((((u1.malicious_reservoir_0>=1)&&(i4.i1.u14.Sstart_0>=1))||((u1.malicious_reservoir_0>=1)&&(u1.Sstart_1>=1)))||((u1.malicious_reservoir_0>=1)&&(u1.Sstart_2>=1))))) * (AG(((((u1.malicious_reservoir_0>=1)&&(i2.u18.s6_0>=1))||((u1.malicious_reservoir_0>=1)&&(i5.u19.s6_1>=1)))||((u1.malicious_reservoir_0>=1)&&(i6.u20.s6_2>=1)))) + AF(((((u1.malicious_reservoir_0>=1)&&(i6.u17.s4_2>=1))||((u1.malicious_reservoir_0>=1)&&(i2.u4.s4_0>=1)))||((u1.malicious_reservoir_0>=1)&&(i5.u16.s4_1>=1))))))
=> equivalent forward existential formula: (([(FwdU(Init,(i0.i0.u2.a1_0>=1)) * (i0.i0.u2.a3_0>=1))] = FALSE * [(Init * !(EX(((((u1.malicious_reservoir_0>=1)&&(i4.i1.u14.Sstart_0>=1))||((u1.malicious_reservoir_0>=1)&&(u1.Sstart_1>=1)))||((u1.malicious_reservoir_0>=1)&&(u1.Sstart_2>=1))))))] = FALSE) * [FwdG((Init * !(!(E(TRUE U !(((((u1.malicious_reservoir_0>=1)&&(i2.u18.s6_0>=1))||((u1.malicious_reservoir_0>=1)&&(i5.u19.s6_1>=1)))||((u1.malicious_reservoir_0>=1)&&(i6.u20.s6_2>=1)))))))),!(((((u1.malicious_reservoir_0>=1)&&(i6.u17.s4_2>=1))||((u1.malicious_reservoir_0>=1)&&(i2.u4.s4_0>=1)))||((u1.malicious_reservoir_0>=1)&&(i5.u16.s4_1>=1)))))] = FALSE)
(forward)formula 6,0,0.259175,13412,1,0,16704,1592,1629,23015,433,7076,54356
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(((((i0.i1.u7.n6_0<1)||(i0.i1.u5.n6_1<1))||(i0.i1.u6.n6_2<1))||(i0.i0.u2.a5_0<1)))
=> equivalent forward existential formula: [FwdG(Init,((((i0.i1.u7.n6_0<1)||(i0.i1.u5.n6_1<1))||(i0.i1.u6.n6_2<1))||(i0.i0.u2.a5_0<1)))] != FALSE
(forward)formula 7,1,0.272174,13676,1,0,17974,1592,1654,23880,433,7101,59181
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (((EX(EF((i0.i0.u2.a3_0>=1))) * !(AG((i0.i0.u2.a2_0>=1)))) * !(AF(((((i4.i1.u8.n4_0>=1)&&(i0.i0.u10.n4_1>=1))&&(i0.i0.u9.n4_2>=1))&&(i0.i0.u2.a3_0>=1))))) * EG(((((((i0.i1.u5.n5_1>=1)&&(u1.s3_1>=1))||((i0.i1.u6.n5_2>=1)&&(u1.s3_2>=1)))||((i0.i1.u7.n5_0>=1)&&(i4.i1.u15.s3_0>=1)))&&(((i5.u16.s4_1>=1)||(i2.u4.s4_0>=1))||(i6.u17.s4_2>=1)))||((((u1.malicious_reservoir_0<1)||(i6.u17.s4_2<1))&&((u1.malicious_reservoir_0<1)||(i2.u4.s4_0<1)))&&((u1.malicious_reservoir_0<1)||(i5.u16.s4_1<1))))))
=> equivalent forward existential formula: [FwdG((Init * ((EX(E(TRUE U (i0.i0.u2.a3_0>=1))) * !(!(E(TRUE U !((i0.i0.u2.a2_0>=1)))))) * !(!(EG(!(((((i4.i1.u8.n4_0>=1)&&(i0.i0.u10.n4_1>=1))&&(i0.i0.u9.n4_2>=1))&&(i0.i0.u2.a3_0>=1)))))))),((((((i0.i1.u5.n5_1>=1)&&(u1.s3_1>=1))||((i0.i1.u6.n5_2>=1)&&(u1.s3_2>=1)))||((i0.i1.u7.n5_0>=1)&&(i4.i1.u15.s3_0>=1)))&&(((i5.u16.s4_1>=1)||(i2.u4.s4_0>=1))||(i6.u17.s4_2>=1)))||((((u1.malicious_reservoir_0<1)||(i6.u17.s4_2<1))&&((u1.malicious_reservoir_0<1)||(i2.u4.s4_0<1)))&&((u1.malicious_reservoir_0<1)||(i5.u16.s4_1<1)))))] != FALSE
(forward)formula 8,1,0.326569,15788,1,0,22028,1725,1732,28763,433,8553,71789
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(AF((((i5.u16.s4_1>=1)||(i2.u4.s4_0>=1))||(i6.u17.s4_2>=1)))) + AG(((((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_1>=1))||((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_2>=1)))||((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_0>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(!(EG(!((((i5.u16.s4_1>=1)||(i2.u4.s4_0>=1))||(i6.u17.s4_2>=1)))))))),TRUE) * !(((((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_1>=1))||((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_2>=1)))||((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_0>=1)))))] = FALSE
(forward)formula 9,1,0.350788,16580,1,0,23923,1759,1764,30706,435,8705,76492
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 10,1,0.350913,16580,1,0,23923,1759,1764,30706,435,8705,76492
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((((i0.i0.u2.a2_0>=1) * EX(((((((i2.u18.n8_0>=1)&&(i2.u18.n8_1>=1))&&(i2.u18.n8_2>=1))&&(i2.u4.s5_0>=1))||((((i5.u19.n8_3>=1)&&(i5.u19.n8_4>=1))&&(i5.u19.n8_5>=1))&&(i5.u16.s5_1>=1)))||((((i6.u20.n8_6>=1)&&(i6.u20.n8_7>=1))&&(i6.u20.n8_8>=1))&&(i6.u17.s5_2>=1))))) * A((((i5.u16.s4_1>=1)||(i2.u4.s4_0>=1))||(i6.u17.s4_2>=1)) U ((((i4.i0.u12.n1_2>=1)&&(u1.Sstart_2>=1))||((i4.i0.u13.n1_0>=1)&&(i4.i1.u14.Sstart_0>=1)))||((i4.i0.u11.n1_1>=1)&&(u1.Sstart_1>=1))))) * (((((((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_1>=1))||((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_2>=1)))||((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_0>=1)))||((u1.malicious_reservoir_0>=1)&&(i2.u18.s6_0>=1)))||((u1.malicious_reservoir_0>=1)&&(i5.u19.s6_1>=1)))||((u1.malicious_reservoir_0>=1)&&(i6.u20.s6_2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((i0.i0.u2.a2_0>=1) * EX(((((((i2.u18.n8_0>=1)&&(i2.u18.n8_1>=1))&&(i2.u18.n8_2>=1))&&(i2.u4.s5_0>=1))||((((i5.u19.n8_3>=1)&&(i5.u19.n8_4>=1))&&(i5.u19.n8_5>=1))&&(i5.u16.s5_1>=1)))||((((i6.u20.n8_6>=1)&&(i6.u20.n8_7>=1))&&(i6.u20.n8_8>=1))&&(i6.u17.s5_2>=1))))) * !((E(!(((((i4.i0.u12.n1_2>=1)&&(u1.Sstart_2>=1))||((i4.i0.u13.n1_0>=1)&&(i4.i1.u14.Sstart_0>=1)))||((i4.i0.u11.n1_1>=1)&&(u1.Sstart_1>=1)))) U (!((((i5.u16.s4_1>=1)||(i2.u4.s4_0>=1))||(i6.u17.s4_2>=1))) * !(((((i4.i0.u12.n1_2>=1)&&(u1.Sstart_2>=1))||((i4.i0.u13.n1_0>=1)&&(i4.i1.u14.Sstart_0>=1)))||((i4.i0.u11.n1_1>=1)&&(u1.Sstart_1>=1)))))) + EG(!(((((i4.i0.u12.n1_2>=1)&&(u1.Sstart_2>=1))||((i4.i0.u13.n1_0>=1)&&(i4.i1.u14.Sstart_0>=1)))||((i4.i0.u11.n1_1>=1)&&(u1.Sstart_1>=1)))))))) * (((((((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_1>=1))||((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_2>=1)))||((u1.malicious_reservoir_0>=1)&&(i1.u0.c1_0>=1)))||((u1.malicious_reservoir_0>=1)&&(i2.u18.s6_0>=1)))||((u1.malicious_reservoir_0>=1)&&(i5.u19.s6_1>=1)))||((u1.malicious_reservoir_0>=1)&&(i6.u20.s6_2>=1))))))] = FALSE
(forward)formula 11,0,0.377919,17636,1,0,25145,1812,1879,32461,449,9180,80513
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((((i0.i0.u2.a4_0<1)||(i0.i0.u2.a2_0>=1))||(i0.i0.u2.a3_0>=1)))
=> equivalent forward existential formula: [FwdG(Init,(((i0.i0.u2.a4_0<1)||(i0.i0.u2.a2_0>=1))||(i0.i0.u2.a3_0>=1)))] != FALSE
(forward)formula 12,1,0.379745,17636,1,0,25164,1812,1899,32498,453,9183,80916
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(A(((((i0.i0.u2.a5_0<1)&&(i5.u16.s4_1<1))&&(i2.u4.s4_0<1))&&(i6.u17.s4_2<1)) U (i0.i0.u2.a2_0>=1)))
=> equivalent forward existential formula: ([(FwdU(Init,!((i0.i0.u2.a2_0>=1))) * (!(((((i0.i0.u2.a5_0<1)&&(i5.u16.s4_1<1))&&(i2.u4.s4_0<1))&&(i6.u17.s4_2<1))) * !((i0.i0.u2.a2_0>=1))))] != FALSE + [FwdG(Init,!((i0.i0.u2.a2_0>=1)))] != FALSE)
(forward)formula 13,1,0.382968,17900,1,0,25213,1812,1917,32862,453,9183,81242
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589852211722

--------------------
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="QuasiCertifProtocol-COL-02"
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 QuasiCertifProtocol-COL-02, 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 r126-tajo-158961390800724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;