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

--------------------
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-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589852278760

[2020-05-19 01:38:00] [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:38:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 01:38:00] [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:38:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2020-05-19 01:38:00] [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:38:01] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 54 ms.
[2020-05-19 01:38:01] [INFO ] Computed order based on color domains.
[2020-05-19 01:38:01] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 18 ms.
[2020-05-19 01:38:01] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Incomplete random walk after 100000 steps, including 9823 resets, run finished after 643 ms. (steps per millisecond=155 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 116 rows 270 cols
[2020-05-19 01:38:01] [INFO ] Computed 155 place invariants in 17 ms
[2020-05-19 01:38:01] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-05-19 01:38:01] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 61 ms returned sat
[2020-05-19 01:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:02] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2020-05-19 01:38:02] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 16 ms.
[2020-05-19 01:38:02] [INFO ] Added : 20 causal constraints over 4 iterations in 169 ms. Result :sat
[2020-05-19 01:38:02] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-19 01:38:02] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 76 ms returned sat
[2020-05-19 01:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:02] [INFO ] [Real]Absence check using state equation in 220 ms returned unsat
[2020-05-19 01:38:02] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:38:02] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 43 ms returned sat
[2020-05-19 01:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:03] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-05-19 01:38:03] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:38:03] [INFO ] Added : 24 causal constraints over 5 iterations in 66 ms. Result :sat
[2020-05-19 01:38:03] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-19 01:38:03] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 63 ms returned sat
[2020-05-19 01:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:03] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-05-19 01:38:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:38:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-19 01:38:03] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 43 ms returned sat
[2020-05-19 01:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:03] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2020-05-19 01:38:03] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-05-19 01:38:04] [INFO ] Added : 40 causal constraints over 8 iterations in 128 ms. Result :sat
[2020-05-19 01:38:04] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:38:04] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 39 ms returned sat
[2020-05-19 01:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:04] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-05-19 01:38:04] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:38:04] [INFO ] Added : 41 causal constraints over 9 iterations in 135 ms. Result :sat
[2020-05-19 01:38:04] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-19 01:38:04] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-05-19 01:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:04] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2020-05-19 01:38:04] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 01:38:04] [INFO ] Added : 41 causal constraints over 9 iterations in 120 ms. Result :sat
[2020-05-19 01:38:04] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-19 01:38:04] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 61 ms returned sat
[2020-05-19 01:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:05] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2020-05-19 01:38:05] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2020-05-19 01:38:05] [INFO ] Added : 19 causal constraints over 4 iterations in 72 ms. Result :sat
[2020-05-19 01:38:05] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-19 01:38:05] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 60 ms returned sat
[2020-05-19 01:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:05] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2020-05-19 01:38:05] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 01:38:05] [INFO ] Added : 48 causal constraints over 10 iterations in 165 ms. Result :sat
[2020-05-19 01:38:06] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-19 01:38:06] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 78 ms returned sat
[2020-05-19 01:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:06] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2020-05-19 01:38:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:38:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-19 01:38:06] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 70 ms returned sat
[2020-05-19 01:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:06] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2020-05-19 01:38:06] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 15 ms.
[2020-05-19 01:38:06] [INFO ] Added : 34 causal constraints over 7 iterations in 109 ms. Result :sat
[2020-05-19 01:38:06] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-19 01:38:07] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 60 ms returned sat
[2020-05-19 01:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:07] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-05-19 01:38:07] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2020-05-19 01:38:07] [INFO ] Added : 19 causal constraints over 4 iterations in 77 ms. Result :sat
[2020-05-19 01:38:07] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-05-19 01:38:07] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-19 01:38:07] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 110 ms returned sat
[2020-05-19 01:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:07] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2020-05-19 01:38:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:38:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-19 01:38:08] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 117 ms returned sat
[2020-05-19 01:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:08] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2020-05-19 01:38:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:38:08] [INFO ] Added : 54 causal constraints over 11 iterations in 162 ms. Result :sat
[2020-05-19 01:38:08] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:38:08] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 71 ms returned sat
[2020-05-19 01:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:08] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-05-19 01:38:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:38:08] [INFO ] Added : 41 causal constraints over 9 iterations in 131 ms. Result :sat
[2020-05-19 01:38:09] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-19 01:38:09] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-05-19 01:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:09] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-05-19 01:38:09] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:38:09] [INFO ] Added : 40 causal constraints over 8 iterations in 93 ms. Result :sat
[2020-05-19 01:38:09] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:38:09] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2020-05-19 01:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:09] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2020-05-19 01:38:09] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 16 ms.
[2020-05-19 01:38:09] [INFO ] Added : 48 causal constraints over 10 iterations in 164 ms. Result :sat
[2020-05-19 01:38:09] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:38:10] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2020-05-19 01:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:10] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-05-19 01:38:10] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-05-19 01:38:10] [INFO ] Added : 40 causal constraints over 8 iterations in 97 ms. Result :sat
[2020-05-19 01:38:10] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:38:10] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 67 ms returned sat
[2020-05-19 01:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:10] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2020-05-19 01:38:10] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2020-05-19 01:38:10] [INFO ] Added : 40 causal constraints over 8 iterations in 112 ms. Result :sat
[2020-05-19 01:38:10] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-19 01:38:10] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 61 ms returned sat
[2020-05-19 01:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:11] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-05-19 01:38:11] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:38:11] [INFO ] Added : 40 causal constraints over 8 iterations in 77 ms. Result :sat
[2020-05-19 01:38:11] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-05-19 01:38:11] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 33 ms returned sat
[2020-05-19 01:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:11] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-05-19 01:38:11] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:38:11] [INFO ] Added : 48 causal constraints over 10 iterations in 91 ms. Result :sat
[2020-05-19 01:38:11] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-19 01:38:11] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 76 ms returned sat
[2020-05-19 01:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:11] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2020-05-19 01:38:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:38:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-19 01:38:11] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-05-19 01:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:12] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2020-05-19 01:38:12] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 01:38:12] [INFO ] Added : 40 causal constraints over 8 iterations in 101 ms. Result :sat
[2020-05-19 01:38:12] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-19 01:38:12] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 75 ms returned sat
[2020-05-19 01:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:12] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2020-05-19 01:38:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:38:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-19 01:38:12] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 53 ms returned sat
[2020-05-19 01:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:12] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2020-05-19 01:38:12] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-05-19 01:38:12] [INFO ] Added : 25 causal constraints over 5 iterations in 67 ms. Result :sat
[2020-05-19 01:38:13] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-19 01:38:13] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-05-19 01:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:13] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-05-19 01:38:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:38:13] [INFO ] Added : 49 causal constraints over 10 iterations in 160 ms. Result :sat
[2020-05-19 01:38:13] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-19 01:38:13] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-05-19 01:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:13] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2020-05-19 01:38:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 01:38:14] [INFO ] Added : 47 causal constraints over 10 iterations in 144 ms. Result :sat
[2020-05-19 01:38:14] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:38:14] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-05-19 01:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:14] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-05-19 01:38:14] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-05-19 01:38:14] [INFO ] Added : 46 causal constraints over 10 iterations in 105 ms. Result :sat
[2020-05-19 01:38:14] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:38:14] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 37 ms returned sat
[2020-05-19 01:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:14] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2020-05-19 01:38:14] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:38:14] [INFO ] Added : 46 causal constraints over 10 iterations in 107 ms. Result :sat
[2020-05-19 01:38:14] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-19 01:38:14] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 55 ms returned sat
[2020-05-19 01:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:15] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2020-05-19 01:38:15] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:38:15] [INFO ] Added : 49 causal constraints over 10 iterations in 131 ms. Result :sat
[2020-05-19 01:38:15] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-19 01:38:15] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 44 ms returned sat
[2020-05-19 01:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:15] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2020-05-19 01:38:15] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 01:38:15] [INFO ] Added : 47 causal constraints over 10 iterations in 115 ms. Result :sat
[2020-05-19 01:38:15] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:38:15] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 56 ms returned sat
[2020-05-19 01:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:16] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2020-05-19 01:38:16] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-05-19 01:38:16] [INFO ] Added : 46 causal constraints over 10 iterations in 145 ms. Result :sat
[2020-05-19 01:38:16] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:38:16] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-05-19 01:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:16] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2020-05-19 01:38:16] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-05-19 01:38:16] [INFO ] Added : 41 causal constraints over 9 iterations in 95 ms. Result :sat
[2020-05-19 01:38:16] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-19 01:38:16] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 63 ms returned sat
[2020-05-19 01:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:17] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2020-05-19 01:38:17] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:38:17] [INFO ] Added : 20 causal constraints over 4 iterations in 72 ms. Result :sat
[2020-05-19 01:38:17] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-19 01:38:17] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 91 ms returned sat
[2020-05-19 01:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:17] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2020-05-19 01:38:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:38:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-19 01:38:17] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 73 ms returned sat
[2020-05-19 01:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:18] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2020-05-19 01:38:18] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:38:18] [INFO ] Added : 17 causal constraints over 4 iterations in 64 ms. Result :sat
[2020-05-19 01:38:18] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-19 01:38:18] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 73 ms returned sat
[2020-05-19 01:38:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:38:18] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2020-05-19 01:38:18] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-05-19 01:38:18] [INFO ] Added : 11 causal constraints over 3 iterations in 77 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-19 01:38:18] [INFO ] Flatten gal took : 68 ms
[2020-05-19 01:38:18] [INFO ] Flatten gal took : 23 ms
[2020-05-19 01:38:18] [INFO ] Applying decomposition
[2020-05-19 01:38:18] [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/graph8913518979103881433.txt, -o, /tmp/graph8913518979103881433.bin, -w, /tmp/graph8913518979103881433.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/graph8913518979103881433.bin, -l, -1, -v, -w, /tmp/graph8913518979103881433.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 01:38:19] [INFO ] Decomposing Gal with order
[2020-05-19 01:38:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 01:38:19] [INFO ] Removed a total of 50 redundant transitions.
[2020-05-19 01:38:19] [INFO ] Flatten gal took : 64 ms
[2020-05-19 01:38:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 49 ms.
[2020-05-19 01:38:19] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 23 ms
[2020-05-19 01:38:19] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 12 ordering constraints for composite.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 22 ordering constraints for composite.
built 9 ordering constraints for composite.
built 18 ordering constraints for composite.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 71 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.27196e+06,53.116,457708,31686,4132,724502,53842,620,3.08973e+06,101,244210,0


Converting to forward existential form...Done !
original formula: !(AF((i3.i0.u36.a2_0>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((i3.i0.u36.a2_0>=1)))] != FALSE
(forward)formula 0,1,274.799,1771428,1,0,1.16635e+06,126172,2318,1.8594e+07,651,511891,2269255
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG(AF((i3.i0.u36.a4_0>=1))) * AX((((((((((((((((i6.i0.u26.s4_3<1)&&(i7.i1.u25.s4_2<1))&&(i5.u3.s4_1<1))&&(i3.i1.u24.s4_0<1))&&(i4.i0.u9.s4_6<1))&&(i8.i1.u28.s4_5<1))&&(i2.i0.u27.s4_4<1))||((u0.malicious_reservoir_0>=1)&&(u0.s5_0>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_1>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_2>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_3>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_4>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_5>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_6>=1)))||((((((((i3.i1.u2.n6_0>=1)&&(i5.u3.n6_1>=1))&&(i7.i1.u7.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i8.i1.u5.n6_5>=1))&&(i4.i0.u6.n6_6>=1))&&(i3.i0.u36.a5_0>=1)))))
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!((i3.i0.u36.a4_0>=1)))))))] = FALSE * [(EY(Init) * !((((((((((((((((i6.i0.u26.s4_3<1)&&(i7.i1.u25.s4_2<1))&&(i5.u3.s4_1<1))&&(i3.i1.u24.s4_0<1))&&(i4.i0.u9.s4_6<1))&&(i8.i1.u28.s4_5<1))&&(i2.i0.u27.s4_4<1))||((u0.malicious_reservoir_0>=1)&&(u0.s5_0>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_1>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_2>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_3>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_4>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_5>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_6>=1)))||((((((((i3.i1.u2.n6_0>=1)&&(i5.u3.n6_1>=1))&&(i7.i1.u7.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i8.i1.u5.n6_5>=1))&&(i4.i0.u6.n6_6>=1))&&(i3.i0.u36.a5_0>=1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions malC1i3, malS6i3, malS4i2, malS4i3, malS4i4, malS3i0, malS2i1, malS1i5, malS1i6, u0.malS5i0, u0.malS5i1, u0.malS5i2, u0.malS5i3, u0.malS5i4, u0.malS5i5, u0.malS5i6, i3.i0.u36.malA5, i3.i0.u36.malA3, i3.i0.u36.malA4, i3.i0.u36.malA2, i3.i0.u36.malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/21/83
(forward)formula 1,0,348.782,2218380,1,0,1.57235e+06,150976,3431,2.23637e+07,791,602887,3307576
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EF(((((((((((((((i9.i0.u29.n8_7>=1)&&(i9.i0.u29.n8_8>=1))&&(i9.i0.u29.n8_9>=1))&&(i9.i0.u29.n8_10>=1))&&(i9.i0.u29.n8_11>=1))&&(i9.i0.u29.n8_12>=1))&&(i9.i0.u29.n8_13>=1))&&(u0.s5_1>=1))||((((((((i9.i4.u35.n8_42>=1)&&(i9.i4.u35.n8_43>=1))&&(i9.i4.u35.n8_44>=1))&&(i9.i4.u35.n8_45>=1))&&(i9.i4.u35.n8_46>=1))&&(i9.i4.u35.n8_47>=1))&&(i9.i4.u35.n8_48>=1))&&(u0.s5_6>=1)))||((((((((i9.i3.u32.n8_28>=1)&&(i9.i3.u32.n8_29>=1))&&(i9.i3.u32.n8_30>=1))&&(i9.i3.u32.n8_31>=1))&&(i9.i3.u32.n8_32>=1))&&(i9.i3.u32.n8_33>=1))&&(i9.i3.u32.n8_34>=1))&&(u0.s5_4>=1)))||((((((((i9.i1.u30.n8_14>=1)&&(i9.i1.u30.n8_15>=1))&&(i9.i1.u30.n8_16>=1))&&(i9.i1.u30.n8_17>=1))&&(i9.i1.u30.n8_18>=1))&&(i9.i1.u30.n8_19>=1))&&(i9.i1.u30.n8_20>=1))&&(u0.s5_2>=1)))||((((((((i9.i5.u33.n8_35>=1)&&(i9.i5.u33.n8_36>=1))&&(i9.i5.u33.n8_37>=1))&&(i9.i5.u33.n8_38>=1))&&(i9.i5.u33.n8_39>=1))&&(i9.i5.u33.n8_40>=1))&&(i9.i5.u33.n8_41>=1))&&(u0.s5_5>=1)))||((((((((i9.i6.u34.n8_0>=1)&&(i9.i6.u34.n8_1>=1))&&(i9.i6.u34.n8_2>=1))&&(i9.i6.u34.n8_3>=1))&&(i9.i6.u34.n8_4>=1))&&(i9.i6.u34.n8_5>=1))&&(i9.i6.u34.n8_6>=1))&&(u0.s5_0>=1)))||((((((((i9.i2.u31.n8_21>=1)&&(i9.i2.u31.n8_22>=1))&&(i9.i2.u31.n8_23>=1))&&(i9.i2.u31.n8_24>=1))&&(i9.i2.u31.n8_25>=1))&&(i9.i2.u31.n8_26>=1))&&(i9.i2.u31.n8_27>=1))&&(u0.s5_3>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((((i9.i0.u29.n8_7>=1)&&(i9.i0.u29.n8_8>=1))&&(i9.i0.u29.n8_9>=1))&&(i9.i0.u29.n8_10>=1))&&(i9.i0.u29.n8_11>=1))&&(i9.i0.u29.n8_12>=1))&&(i9.i0.u29.n8_13>=1))&&(u0.s5_1>=1))||((((((((i9.i4.u35.n8_42>=1)&&(i9.i4.u35.n8_43>=1))&&(i9.i4.u35.n8_44>=1))&&(i9.i4.u35.n8_45>=1))&&(i9.i4.u35.n8_46>=1))&&(i9.i4.u35.n8_47>=1))&&(i9.i4.u35.n8_48>=1))&&(u0.s5_6>=1)))||((((((((i9.i3.u32.n8_28>=1)&&(i9.i3.u32.n8_29>=1))&&(i9.i3.u32.n8_30>=1))&&(i9.i3.u32.n8_31>=1))&&(i9.i3.u32.n8_32>=1))&&(i9.i3.u32.n8_33>=1))&&(i9.i3.u32.n8_34>=1))&&(u0.s5_4>=1)))||((((((((i9.i1.u30.n8_14>=1)&&(i9.i1.u30.n8_15>=1))&&(i9.i1.u30.n8_16>=1))&&(i9.i1.u30.n8_17>=1))&&(i9.i1.u30.n8_18>=1))&&(i9.i1.u30.n8_19>=1))&&(i9.i1.u30.n8_20>=1))&&(u0.s5_2>=1)))||((((((((i9.i5.u33.n8_35>=1)&&(i9.i5.u33.n8_36>=1))&&(i9.i5.u33.n8_37>=1))&&(i9.i5.u33.n8_38>=1))&&(i9.i5.u33.n8_39>=1))&&(i9.i5.u33.n8_40>=1))&&(i9.i5.u33.n8_41>=1))&&(u0.s5_5>=1)))||((((((((i9.i6.u34.n8_0>=1)&&(i9.i6.u34.n8_1>=1))&&(i9.i6.u34.n8_2>=1))&&(i9.i6.u34.n8_3>=1))&&(i9.i6.u34.n8_4>=1))&&(i9.i6.u34.n8_5>=1))&&(i9.i6.u34.n8_6>=1))&&(u0.s5_0>=1)))||((((((((i9.i2.u31.n8_21>=1)&&(i9.i2.u31.n8_22>=1))&&(i9.i2.u31.n8_23>=1))&&(i9.i2.u31.n8_24>=1))&&(i9.i2.u31.n8_25>=1))&&(i9.i2.u31.n8_26>=1))&&(i9.i2.u31.n8_27>=1))&&(u0.s5_3>=1))))))] = FALSE
(forward)formula 2,0,395.319,2246032,1,0,1.60723e+06,152692,1736,2.23792e+07,329,607288,596888
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(AX(EF((i3.i0.u36.a5_0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E(TRUE U (i3.i0.u36.a5_0>=1)))))))] = FALSE
dead was empty
(forward)formula 3,1,408.08,2246032,1,0,1.60723e+06,152692,1802,2.23792e+07,329,607288,992359
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG(((EG(((((((((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.Sstart_0>=1))||((u0.malicious_reservoir_0>=1)&&(i5.u20.Sstart_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u21.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.Sstart_6>=1)))) + (i3.i0.u36.a5_0<1)) + ((((((((u0.malicious_reservoir_0<1)||(i7.i0.u11.s2_2<1))&&((u0.malicious_reservoir_0<1)||(i6.i1.u22.s2_3<1)))&&((u0.malicious_reservoir_0<1)||(i2.i1.u18.s2_4<1)))&&((u0.malicious_reservoir_0<1)||(i8.i0.u23.s2_5<1)))&&((u0.malicious_reservoir_0<1)||(i4.i1.u19.s2_6<1)))&&((u0.malicious_reservoir_0<1)||(i3.i1.u17.s2_0<1)))&&((u0.malicious_reservoir_0<1)||(i5.u20.s2_1<1))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((((((((u0.malicious_reservoir_0<1)||(i7.i0.u11.s2_2<1))&&((u0.malicious_reservoir_0<1)||(i6.i1.u22.s2_3<1)))&&((u0.malicious_reservoir_0<1)||(i2.i1.u18.s2_4<1)))&&((u0.malicious_reservoir_0<1)||(i8.i0.u23.s2_5<1)))&&((u0.malicious_reservoir_0<1)||(i4.i1.u19.s2_6<1)))&&((u0.malicious_reservoir_0<1)||(i3.i1.u17.s2_0<1)))&&((u0.malicious_reservoir_0<1)||(i5.u20.s2_1<1))))) * !((i3.i0.u36.a5_0<1))) * !(EG(((((((((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.Sstart_0>=1))||((u0.malicious_reservoir_0>=1)&&(i5.u20.Sstart_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u21.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.Sstart_6>=1))))))] != FALSE
(forward)formula 4,0,409.035,2246032,1,0,1.60723e+06,152692,1911,2.23792e+07,333,607288,1094426
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((((((i3.i1.u2.n5_0>=1)&&(i3.i1.u2.s3_0>=1))||((i2.i0.u8.n5_4>=1)&&(i2.i1.u15.s3_4>=1)))||((i5.u3.n5_1>=1)&&(i5.u3.s3_1>=1)))||((i6.i0.u4.n5_3>=1)&&(i6.i1.u12.s3_3>=1)))||((i8.i1.u5.n5_5>=1)&&(i8.i1.u5.s3_5>=1)))||((i7.i1.u7.n5_2>=1)&&(i7.i0.u11.s3_2>=1)))||((i4.i0.u6.n5_6>=1)&&(i4.i1.u16.s3_6>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((i3.i1.u2.n5_0>=1)&&(i3.i1.u2.s3_0>=1))||((i2.i0.u8.n5_4>=1)&&(i2.i1.u15.s3_4>=1)))||((i5.u3.n5_1>=1)&&(i5.u3.s3_1>=1)))||((i6.i0.u4.n5_3>=1)&&(i6.i1.u12.s3_3>=1)))||((i8.i1.u5.n5_5>=1)&&(i8.i1.u5.s3_5>=1)))||((i7.i1.u7.n5_2>=1)&&(i7.i0.u11.s3_2>=1)))||((i4.i0.u6.n5_6>=1)&&(i4.i1.u16.s3_6>=1)))))] = FALSE
(forward)formula 5,0,409.13,2246032,1,0,1.60723e+06,152692,2241,2.23792e+07,388,607288,1140309
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(E(EF(((((((((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.Sstart_0>=1))||((u0.malicious_reservoir_0>=1)&&(i5.u20.Sstart_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u21.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.Sstart_6>=1)))) U ((((((((i3.i1.u17.n2_0>=1)&&(i5.u20.n2_1>=1))&&(i7.i0.u21.n2_2>=1))&&(i6.i1.u22.n2_3>=1))&&(i2.i1.u18.n2_4>=1))&&(i8.i0.u23.n2_5>=1))&&(i4.i1.u19.n2_6>=1))&&(i3.i0.u36.a1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((((((((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.Sstart_0>=1))||((u0.malicious_reservoir_0>=1)&&(i5.u20.Sstart_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u21.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.Sstart_6>=1))))) * ((((((((i3.i1.u17.n2_0>=1)&&(i5.u20.n2_1>=1))&&(i7.i0.u21.n2_2>=1))&&(i6.i1.u22.n2_3>=1))&&(i2.i1.u18.n2_4>=1))&&(i8.i0.u23.n2_5>=1))&&(i4.i1.u19.n2_6>=1))&&(i3.i0.u36.a1_0>=1)))] = FALSE
(forward)formula 6,0,409.144,2246032,1,0,1.60723e+06,152692,2287,2.23792e+07,392,607288,1145926
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(A(AF((((((((i9.i1.u30.s6_2>=1)||(i9.i2.u31.s6_3>=1))||(i9.i3.u32.s6_4>=1))||(i9.i5.u33.s6_5>=1))||(i9.i6.u34.s6_0>=1))||(i9.i0.u29.s6_1>=1))||(i9.i4.u35.s6_6>=1))) U (((((((i9.i1.u30.s6_2>=1)||(i9.i2.u31.s6_3>=1))||(i9.i3.u32.s6_4>=1))||(i9.i5.u33.s6_5>=1))||(i9.i6.u34.s6_0>=1))||(i9.i0.u29.s6_1>=1))||(i9.i4.u35.s6_6>=1))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!((((((((i9.i1.u30.s6_2>=1)||(i9.i2.u31.s6_3>=1))||(i9.i3.u32.s6_4>=1))||(i9.i5.u33.s6_5>=1))||(i9.i6.u34.s6_0>=1))||(i9.i0.u29.s6_1>=1))||(i9.i4.u35.s6_6>=1)))) * !((((((((i9.i1.u30.s6_2>=1)||(i9.i2.u31.s6_3>=1))||(i9.i3.u32.s6_4>=1))||(i9.i5.u33.s6_5>=1))||(i9.i6.u34.s6_0>=1))||(i9.i0.u29.s6_1>=1))||(i9.i4.u35.s6_6>=1)))),!((((((((i9.i1.u30.s6_2>=1)||(i9.i2.u31.s6_3>=1))||(i9.i3.u32.s6_4>=1))||(i9.i5.u33.s6_5>=1))||(i9.i6.u34.s6_0>=1))||(i9.i0.u29.s6_1>=1))||(i9.i4.u35.s6_6>=1))))] != FALSE + [FwdG(Init,!((((((((i9.i1.u30.s6_2>=1)||(i9.i2.u31.s6_3>=1))||(i9.i3.u32.s6_4>=1))||(i9.i5.u33.s6_5>=1))||(i9.i6.u34.s6_0>=1))||(i9.i0.u29.s6_1>=1))||(i9.i4.u35.s6_6>=1))))] != FALSE)
(forward)formula 7,1,412.847,2246032,1,0,1.60723e+06,152692,2599,2.23792e+07,424,607288,1391227
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((AF(((((((((((((((i3.i1.u24.n7_0>=1)&&(i5.u3.n7_7>=1))&&(i7.i1.u25.n7_14>=1))&&(i6.i0.u26.n7_21>=1))&&(i2.i0.u27.n7_28>=1))&&(i8.i1.u28.n7_35>=1))&&(i4.i0.u9.n7_42>=1))&&(i9.i6.u34.Cstart_0>=1))||((((((((i3.i1.u24.n7_6>=1)&&(i5.u3.n7_13>=1))&&(i7.i1.u25.n7_20>=1))&&(i6.i0.u26.n7_27>=1))&&(i2.i0.u27.n7_34>=1))&&(i8.i1.u28.n7_41>=1))&&(i4.i0.u9.n7_48>=1))&&(i9.i5.u33.Cstart_6>=1)))||((((((((i3.i1.u24.n7_2>=1)&&(i5.u3.n7_9>=1))&&(i7.i1.u25.n7_16>=1))&&(i6.i0.u26.n7_23>=1))&&(i2.i0.u27.n7_30>=1))&&(i8.i1.u28.n7_37>=1))&&(i4.i0.u9.n7_44>=1))&&(i9.i3.u32.Cstart_2>=1)))||((((((((i3.i1.u24.n7_1>=1)&&(i5.u3.n7_8>=1))&&(i7.i1.u25.n7_15>=1))&&(i6.i0.u26.n7_22>=1))&&(i2.i0.u27.n7_29>=1))&&(i8.i1.u28.n7_36>=1))&&(i4.i0.u9.n7_43>=1))&&(i9.i2.u31.Cstart_1>=1)))||((((((((i3.i1.u24.n7_3>=1)&&(i5.u3.n7_10>=1))&&(i7.i1.u25.n7_17>=1))&&(i6.i0.u26.n7_24>=1))&&(i2.i0.u27.n7_31>=1))&&(i8.i1.u28.n7_38>=1))&&(i4.i0.u9.n7_45>=1))&&(i9.i4.u35.Cstart_3>=1)))||((((((((i3.i1.u24.n7_5>=1)&&(i5.u3.n7_12>=1))&&(i7.i1.u25.n7_19>=1))&&(i6.i0.u26.n7_26>=1))&&(i2.i0.u27.n7_33>=1))&&(i8.i1.u28.n7_40>=1))&&(i4.i0.u9.n7_47>=1))&&(i9.i0.u29.Cstart_5>=1)))||((((((((i3.i1.u24.n7_4>=1)&&(i5.u3.n7_11>=1))&&(i7.i1.u25.n7_18>=1))&&(i6.i0.u26.n7_25>=1))&&(i2.i0.u27.n7_32>=1))&&(i8.i1.u28.n7_39>=1))&&(i4.i0.u9.n7_46>=1))&&(i9.i1.u30.Cstart_4>=1)))) + EF(((((((((i3.i0.u10.n4_0>=1)&&(i5.u14.n4_1>=1))&&(i7.i0.u11.n4_2>=1))&&(i6.i1.u12.n4_3>=1))&&(i2.i1.u15.n4_4>=1))&&(i8.i0.u13.n4_5>=1))&&(i4.i1.u16.n4_6>=1))&&(i3.i0.u36.a3_0>=1)))) + ((((((((i3.i0.u10.n4_0>=1)&&(i5.u14.n4_1>=1))&&(i7.i0.u11.n4_2>=1))&&(i6.i1.u12.n4_3>=1))&&(i2.i1.u15.n4_4>=1))&&(i8.i0.u13.n4_5>=1))&&(i4.i1.u16.n4_6>=1))&&(i3.i0.u36.a3_0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(((((((((((((((i3.i1.u24.n7_0>=1)&&(i5.u3.n7_7>=1))&&(i7.i1.u25.n7_14>=1))&&(i6.i0.u26.n7_21>=1))&&(i2.i0.u27.n7_28>=1))&&(i8.i1.u28.n7_35>=1))&&(i4.i0.u9.n7_42>=1))&&(i9.i6.u34.Cstart_0>=1))||((((((((i3.i1.u24.n7_6>=1)&&(i5.u3.n7_13>=1))&&(i7.i1.u25.n7_20>=1))&&(i6.i0.u26.n7_27>=1))&&(i2.i0.u27.n7_34>=1))&&(i8.i1.u28.n7_41>=1))&&(i4.i0.u9.n7_48>=1))&&(i9.i5.u33.Cstart_6>=1)))||((((((((i3.i1.u24.n7_2>=1)&&(i5.u3.n7_9>=1))&&(i7.i1.u25.n7_16>=1))&&(i6.i0.u26.n7_23>=1))&&(i2.i0.u27.n7_30>=1))&&(i8.i1.u28.n7_37>=1))&&(i4.i0.u9.n7_44>=1))&&(i9.i3.u32.Cstart_2>=1)))||((((((((i3.i1.u24.n7_1>=1)&&(i5.u3.n7_8>=1))&&(i7.i1.u25.n7_15>=1))&&(i6.i0.u26.n7_22>=1))&&(i2.i0.u27.n7_29>=1))&&(i8.i1.u28.n7_36>=1))&&(i4.i0.u9.n7_43>=1))&&(i9.i2.u31.Cstart_1>=1)))||((((((((i3.i1.u24.n7_3>=1)&&(i5.u3.n7_10>=1))&&(i7.i1.u25.n7_17>=1))&&(i6.i0.u26.n7_24>=1))&&(i2.i0.u27.n7_31>=1))&&(i8.i1.u28.n7_38>=1))&&(i4.i0.u9.n7_45>=1))&&(i9.i4.u35.Cstart_3>=1)))||((((((((i3.i1.u24.n7_5>=1)&&(i5.u3.n7_12>=1))&&(i7.i1.u25.n7_19>=1))&&(i6.i0.u26.n7_26>=1))&&(i2.i0.u27.n7_33>=1))&&(i8.i1.u28.n7_40>=1))&&(i4.i0.u9.n7_47>=1))&&(i9.i0.u29.Cstart_5>=1)))||((((((((i3.i1.u24.n7_4>=1)&&(i5.u3.n7_11>=1))&&(i7.i1.u25.n7_18>=1))&&(i6.i0.u26.n7_25>=1))&&(i2.i0.u27.n7_32>=1))&&(i8.i1.u28.n7_39>=1))&&(i4.i0.u9.n7_46>=1))&&(i9.i1.u30.Cstart_4>=1)))))) + E(TRUE U ((((((((i3.i0.u10.n4_0>=1)&&(i5.u14.n4_1>=1))&&(i7.i0.u11.n4_2>=1))&&(i6.i1.u12.n4_3>=1))&&(i2.i1.u15.n4_4>=1))&&(i8.i0.u13.n4_5>=1))&&(i4.i1.u16.n4_6>=1))&&(i3.i0.u36.a3_0>=1)))) + ((((((((i3.i0.u10.n4_0>=1)&&(i5.u14.n4_1>=1))&&(i7.i0.u11.n4_2>=1))&&(i6.i1.u12.n4_3>=1))&&(i2.i1.u15.n4_4>=1))&&(i8.i0.u13.n4_5>=1))&&(i4.i1.u16.n4_6>=1))&&(i3.i0.u36.a3_0>=1)))))] = FALSE
(forward)formula 8,1,656.671,2246032,1,0,1.60723e+06,152692,2881,2.23792e+07,424,607288,2374601
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EG((i3.i0.u36.a3_0>=1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i3.i0.u36.a3_0>=1))] != FALSE
dead was empty
(forward)formula 9,0,656.678,2246032,1,0,1.60723e+06,152692,2881,2.23792e+07,424,607288,2383331
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AF(((((((((((((((((i9.i0.u37.n9_0>=1)&&(i9.i0.u37.n9_7>=1))&&(i9.i0.u37.n9_14>=1))&&(i9.i0.u37.n9_21>=1))&&(i9.i0.u37.n9_28>=1))&&(i9.i0.u37.n9_35>=1))&&(i9.i0.u37.n9_42>=1))&&(u1.c1_0>=1))||((((((((i9.i6.u43.n9_6>=1)&&(i9.i6.u43.n9_13>=1))&&(i9.i6.u43.n9_20>=1))&&(i9.i6.u43.n9_27>=1))&&(i9.i6.u43.n9_34>=1))&&(i9.i6.u43.n9_41>=1))&&(i9.i6.u43.n9_48>=1))&&(u1.c1_6>=1)))||((((((((i9.i1.u42.n9_5>=1)&&(i9.i1.u42.n9_12>=1))&&(i9.i1.u42.n9_19>=1))&&(i9.i1.u42.n9_26>=1))&&(i9.i1.u42.n9_33>=1))&&(i9.i1.u42.n9_40>=1))&&(i9.i1.u42.n9_47>=1))&&(u1.c1_5>=1)))||((((((((i9.i3.u41.n9_4>=1)&&(i9.i3.u41.n9_11>=1))&&(i9.i3.u41.n9_18>=1))&&(i9.i3.u41.n9_25>=1))&&(i9.i3.u41.n9_32>=1))&&(i9.i3.u41.n9_39>=1))&&(i9.i3.u41.n9_46>=1))&&(u1.c1_4>=1)))||((((((((i9.i2.u40.n9_3>=1)&&(i9.i2.u40.n9_10>=1))&&(i9.i2.u40.n9_17>=1))&&(i9.i2.u40.n9_24>=1))&&(i9.i2.u40.n9_31>=1))&&(i9.i2.u40.n9_38>=1))&&(i9.i2.u40.n9_45>=1))&&(u1.c1_3>=1)))||((((((((i9.i5.u39.n9_2>=1)&&(i9.i5.u39.n9_9>=1))&&(i9.i5.u39.n9_16>=1))&&(i9.i5.u39.n9_23>=1))&&(i9.i5.u39.n9_30>=1))&&(i9.i5.u39.n9_37>=1))&&(i9.i5.u39.n9_44>=1))&&(u1.c1_2>=1)))||((((((((i9.i4.u38.n9_1>=1)&&(i9.i4.u38.n9_8>=1))&&(i9.i4.u38.n9_15>=1))&&(i9.i4.u38.n9_22>=1))&&(i9.i4.u38.n9_29>=1))&&(i9.i4.u38.n9_36>=1))&&(i9.i4.u38.n9_43>=1))&&(u1.c1_1>=1)))||(i3.i0.u36.a2_0>=1))&&(i3.i0.u36.a2_0<1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((((((((i9.i0.u37.n9_0>=1)&&(i9.i0.u37.n9_7>=1))&&(i9.i0.u37.n9_14>=1))&&(i9.i0.u37.n9_21>=1))&&(i9.i0.u37.n9_28>=1))&&(i9.i0.u37.n9_35>=1))&&(i9.i0.u37.n9_42>=1))&&(u1.c1_0>=1))||((((((((i9.i6.u43.n9_6>=1)&&(i9.i6.u43.n9_13>=1))&&(i9.i6.u43.n9_20>=1))&&(i9.i6.u43.n9_27>=1))&&(i9.i6.u43.n9_34>=1))&&(i9.i6.u43.n9_41>=1))&&(i9.i6.u43.n9_48>=1))&&(u1.c1_6>=1)))||((((((((i9.i1.u42.n9_5>=1)&&(i9.i1.u42.n9_12>=1))&&(i9.i1.u42.n9_19>=1))&&(i9.i1.u42.n9_26>=1))&&(i9.i1.u42.n9_33>=1))&&(i9.i1.u42.n9_40>=1))&&(i9.i1.u42.n9_47>=1))&&(u1.c1_5>=1)))||((((((((i9.i3.u41.n9_4>=1)&&(i9.i3.u41.n9_11>=1))&&(i9.i3.u41.n9_18>=1))&&(i9.i3.u41.n9_25>=1))&&(i9.i3.u41.n9_32>=1))&&(i9.i3.u41.n9_39>=1))&&(i9.i3.u41.n9_46>=1))&&(u1.c1_4>=1)))||((((((((i9.i2.u40.n9_3>=1)&&(i9.i2.u40.n9_10>=1))&&(i9.i2.u40.n9_17>=1))&&(i9.i2.u40.n9_24>=1))&&(i9.i2.u40.n9_31>=1))&&(i9.i2.u40.n9_38>=1))&&(i9.i2.u40.n9_45>=1))&&(u1.c1_3>=1)))||((((((((i9.i5.u39.n9_2>=1)&&(i9.i5.u39.n9_9>=1))&&(i9.i5.u39.n9_16>=1))&&(i9.i5.u39.n9_23>=1))&&(i9.i5.u39.n9_30>=1))&&(i9.i5.u39.n9_37>=1))&&(i9.i5.u39.n9_44>=1))&&(u1.c1_2>=1)))||((((((((i9.i4.u38.n9_1>=1)&&(i9.i4.u38.n9_8>=1))&&(i9.i4.u38.n9_15>=1))&&(i9.i4.u38.n9_22>=1))&&(i9.i4.u38.n9_29>=1))&&(i9.i4.u38.n9_36>=1))&&(i9.i4.u38.n9_43>=1))&&(u1.c1_1>=1)))||(i3.i0.u36.a2_0>=1))&&(i3.i0.u36.a2_0<1))))] != FALSE
(forward)formula 10,1,775.299,2763740,1,0,1.80685e+06,152692,3218,2.95253e+07,441,623025,3459719
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AF((i3.i0.u36.a3_0>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((i3.i0.u36.a3_0>=1)))] != FALSE
(forward)formula 11,1,775.319,2764796,1,0,1.80689e+06,152692,3242,2.95254e+07,441,623025,3468969
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(AF(((((((((u0.malicious_reservoir_0>=1)&&(u0.s5_0>=1))||((u0.malicious_reservoir_0>=1)&&(u0.s5_1>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_2>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_3>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_4>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_5>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_6>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((((((((u0.malicious_reservoir_0>=1)&&(u0.s5_0>=1))||((u0.malicious_reservoir_0>=1)&&(u0.s5_1>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_2>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_3>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_4>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_5>=1)))||((u0.malicious_reservoir_0>=1)&&(u0.s5_6>=1)))))] = FALSE
(forward)formula 12,0,783.109,2864060,1,0,2.01914e+06,152692,3435,3.00383e+07,477,634457,3954546
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(!(AX(((((((((i3.i1.u17.n2_0>=1)&&(i5.u20.n2_1>=1))&&(i7.i0.u21.n2_2>=1))&&(i6.i1.u22.n2_3>=1))&&(i2.i1.u18.n2_4>=1))&&(i8.i0.u23.n2_5>=1))&&(i4.i1.u19.n2_6>=1))&&(i3.i0.u36.a1_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((((((((i3.i1.u17.n2_0>=1)&&(i5.u20.n2_1>=1))&&(i7.i0.u21.n2_2>=1))&&(i6.i1.u22.n2_3>=1))&&(i2.i1.u18.n2_4>=1))&&(i8.i0.u23.n2_5>=1))&&(i4.i1.u19.n2_6>=1))&&(i3.i0.u36.a1_0>=1))))))] = FALSE
(forward)formula 13,0,784.777,2871188,1,0,2.02108e+06,152692,3436,3.00428e+07,477,634537,3962906
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AF(((((((((u0.malicious_reservoir_0>=1)&&(i2.i0.u27.s4_4>=1))||((u0.malicious_reservoir_0>=1)&&(i8.i1.u28.s4_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i0.u9.s4_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u24.s4_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u3.s4_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i1.u25.s4_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i0.u26.s4_3>=1))))) * (EG((((((((((((((((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.Sstart_0>=1))||((u0.malicious_reservoir_0>=1)&&(i5.u20.Sstart_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u21.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.Sstart_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u11.s2_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.s2_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.s2_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.s2_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.s2_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.s2_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u20.s2_1>=1)))) + (EG((((((((((u0.malicious_reservoir_0>=1)&&(i3.i1.u2.s3_0>=1))||((u0.malicious_reservoir_0>=1)&&(i5.u3.s3_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u11.s3_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u12.s3_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u15.s3_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i1.u5.s3_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u16.s3_6>=1)))&&(i3.i0.u36.a4_0>=1))) * AX((((((((((((((((i3.i1.u17.n2_0>=1)&&(i5.u20.n2_1>=1))&&(i7.i0.u21.n2_2>=1))&&(i6.i1.u22.n2_3>=1))&&(i2.i1.u18.n2_4>=1))&&(i8.i0.u23.n2_5>=1))&&(i4.i1.u19.n2_6>=1))&&(i3.i0.u36.a1_0>=1))||((i3.i1.u2.n5_0>=1)&&(i3.i1.u2.s3_0>=1)))||((i2.i0.u8.n5_4>=1)&&(i2.i1.u15.s3_4>=1)))||((i5.u3.n5_1>=1)&&(i5.u3.s3_1>=1)))||((i6.i0.u4.n5_3>=1)&&(i6.i1.u12.s3_3>=1)))||((i8.i1.u5.n5_5>=1)&&(i8.i1.u5.s3_5>=1)))||((i7.i1.u7.n5_2>=1)&&(i7.i0.u11.s3_2>=1)))||((i4.i0.u6.n5_6>=1)&&(i4.i1.u16.s3_6>=1)))))))
=> equivalent forward existential formula: ([(Init * !(EG(!(((((((((u0.malicious_reservoir_0>=1)&&(i2.i0.u27.s4_4>=1))||((u0.malicious_reservoir_0>=1)&&(i8.i1.u28.s4_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i0.u9.s4_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u24.s4_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u3.s4_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i1.u25.s4_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i0.u26.s4_3>=1)))))))] = FALSE * ([((Init * !(EG((((((((((((((((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.Sstart_0>=1))||((u0.malicious_reservoir_0>=1)&&(i5.u20.Sstart_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u21.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.Sstart_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u11.s2_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.s2_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.s2_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.s2_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.s2_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.s2_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u20.s2_1>=1)))))) * !(EG((((((((((u0.malicious_reservoir_0>=1)&&(i3.i1.u2.s3_0>=1))||((u0.malicious_reservoir_0>=1)&&(i5.u3.s3_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u11.s3_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u12.s3_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u15.s3_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i1.u5.s3_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u16.s3_6>=1)))&&(i3.i0.u36.a4_0>=1)))))] = FALSE * [(EY((Init * !(EG((((((((((((((((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.Sstart_0>=1))||((u0.malicious_reservoir_0>=1)&&(i5.u20.Sstart_1>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u21.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.Sstart_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i0.u11.s2_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u22.s2_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u18.s2_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i0.u23.s2_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u19.s2_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u17.s2_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u20.s2_1>=1))))))) * !((((((((((((((((i3.i1.u17.n2_0>=1)&&(i5.u20.n2_1>=1))&&(i7.i0.u21.n2_2>=1))&&(i6.i1.u22.n2_3>=1))&&(i2.i1.u18.n2_4>=1))&&(i8.i0.u23.n2_5>=1))&&(i4.i1.u19.n2_6>=1))&&(i3.i0.u36.a1_0>=1))||((i3.i1.u2.n5_0>=1)&&(i3.i1.u2.s3_0>=1)))||((i2.i0.u8.n5_4>=1)&&(i2.i1.u15.s3_4>=1)))||((i5.u3.n5_1>=1)&&(i5.u3.s3_1>=1)))||((i6.i0.u4.n5_3>=1)&&(i6.i1.u12.s3_3>=1)))||((i8.i1.u5.n5_5>=1)&&(i8.i1.u5.s3_5>=1)))||((i7.i1.u7.n5_2>=1)&&(i7.i0.u11.s3_2>=1)))||((i4.i0.u6.n5_6>=1)&&(i4.i1.u16.s3_6>=1)))))] = FALSE))
(forward)formula 14,0,784.828,2875940,1,0,2.02113e+06,152692,3516,3.00429e+07,478,634537,4005938
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EG(((i3.i0.u36.a2_0>=1)||(i3.i0.u36.a5_0>=1))) U AF(((((((((i3.i1.u2.n6_0>=1)&&(i5.u3.n6_1>=1))&&(i7.i1.u7.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i8.i1.u5.n6_5>=1))&&(i4.i0.u6.n6_6>=1))&&(i3.i0.u36.a5_0>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((((((((i3.i1.u2.n6_0>=1)&&(i5.u3.n6_1>=1))&&(i7.i1.u7.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i8.i1.u5.n6_5>=1))&&(i4.i0.u6.n6_6>=1))&&(i3.i0.u36.a5_0>=1))))))))) * !(E(!(!(EG(!(((((((((i3.i1.u2.n6_0>=1)&&(i5.u3.n6_1>=1))&&(i7.i1.u7.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i8.i1.u5.n6_5>=1))&&(i4.i0.u6.n6_6>=1))&&(i3.i0.u36.a5_0>=1)))))) U (!(EG(((i3.i0.u36.a2_0>=1)||(i3.i0.u36.a5_0>=1)))) * !(!(EG(!(((((((((i3.i1.u2.n6_0>=1)&&(i5.u3.n6_1>=1))&&(i7.i1.u7.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i8.i1.u5.n6_5>=1))&&(i4.i0.u6.n6_6>=1))&&(i3.i0.u36.a5_0>=1))))))))))] != FALSE
(forward)formula 15,0,1117.96,2927948,1,0,2.12776e+06,152692,1496,3.01725e+07,316,647851,2072420
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589853419260

--------------------
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-06"
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-06, 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-158961390800732"
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 [ "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 ;