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

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

=== Now, execution of the tool begins

BK_START 1589852244273

[2020-05-19 01:37:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-19 01:37:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 01:37:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-19 01:37:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 792 ms
[2020-05-19 01:37:26] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2020-05-19 01:37:26] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 40 ms.
[2020-05-19 01:37:26] [INFO ] Computed order based on color domains.
[2020-05-19 01:37:26] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 15 ms.
[2020-05-19 01:37:26] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9821 resets, run finished after 901 ms. (steps per millisecond=110 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 116 rows 270 cols
[2020-05-19 01:37:27] [INFO ] Computed 155 place invariants in 18 ms
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 67 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2020-05-19 01:37:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 01:37:28] [INFO ] Added : 20 causal constraints over 4 iterations in 106 ms. Result :sat
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2020-05-19 01:37:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 01:37:29] [INFO ] Added : 41 causal constraints over 9 iterations in 127 ms. Result :sat
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 61 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-05-19 01:37:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 155 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 110 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:30] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2020-05-19 01:37:30] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 17 ms.
[2020-05-19 01:37:30] [INFO ] Added : 25 causal constraints over 5 iterations in 119 ms. Result :sat
[2020-05-19 01:37:30] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 73 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:30] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2020-05-19 01:37:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 62 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:31] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2020-05-19 01:37:31] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 25 ms.
[2020-05-19 01:37:31] [INFO ] Added : 19 causal constraints over 4 iterations in 82 ms. Result :sat
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 62 ms returned sat
[2020-05-19 01:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-05-19 01:37:31] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:31] [INFO ] Added : 19 causal constraints over 4 iterations in 61 ms. Result :sat
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 61 ms returned sat
[2020-05-19 01:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-19 01:37:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 42 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:32] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2020-05-19 01:37:32] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:32] [INFO ] Added : 16 causal constraints over 4 iterations in 55 ms. Result :sat
[2020-05-19 01:37:32] [INFO ] [Real]Absence check using 11 positive place invariants in 36 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 74 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:32] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2020-05-19 01:37:32] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 17 ms.
[2020-05-19 01:37:32] [INFO ] Added : 23 causal constraints over 5 iterations in 131 ms. Result :sat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive place invariants in 83 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 65 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2020-05-19 01:37:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 62 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:33] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2020-05-19 01:37:33] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-05-19 01:37:33] [INFO ] Added : 40 causal constraints over 8 iterations in 107 ms. Result :sat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-05-19 01:37:34] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:34] [INFO ] Added : 41 causal constraints over 9 iterations in 115 ms. Result :sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 59 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-05-19 01:37:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 54 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:34] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2020-05-19 01:37:34] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:37:34] [INFO ] Added : 40 causal constraints over 8 iterations in 86 ms. Result :sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 36 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-05-19 01:37:35] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 01:37:35] [INFO ] Added : 44 causal constraints over 9 iterations in 123 ms. Result :sat
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 37 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2020-05-19 01:37:35] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 01:37:36] [INFO ] Added : 49 causal constraints over 10 iterations in 144 ms. Result :sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 34 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-05-19 01:37:36] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-05-19 01:37:36] [INFO ] Added : 47 causal constraints over 10 iterations in 108 ms. Result :sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2020-05-19 01:37:36] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:37:36] [INFO ] Added : 47 causal constraints over 10 iterations in 148 ms. Result :sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2020-05-19 01:37:37] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-05-19 01:37:37] [INFO ] Added : 46 causal constraints over 10 iterations in 149 ms. Result :sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-05-19 01:37:37] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:37] [INFO ] Added : 47 causal constraints over 10 iterations in 145 ms. Result :sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-05-19 01:37:38] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:38] [INFO ] Added : 45 causal constraints over 9 iterations in 178 ms. Result :sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 61 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-05-19 01:37:38] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-05-19 01:37:39] [INFO ] Added : 20 causal constraints over 4 iterations in 76 ms. Result :sat
[2020-05-19 01:37:39] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 78 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:39] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2020-05-19 01:37:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 70 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:39] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2020-05-19 01:37:39] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 01:37:40] [INFO ] Added : 34 causal constraints over 7 iterations in 114 ms. Result :sat
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 51 ms returned sat
[2020-05-19 01:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-05-19 01:37:40] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 01:37:40] [INFO ] Added : 24 causal constraints over 5 iterations in 76 ms. Result :sat
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 59 ms returned sat
[2020-05-19 01:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-05-19 01:37:40] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-05-19 01:37:40] [INFO ] Added : 24 causal constraints over 5 iterations in 75 ms. Result :sat
[2020-05-19 01:37:40] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-19 01:37:41] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 60 ms returned sat
[2020-05-19 01:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:41] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-05-19 01:37:41] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:37:41] [INFO ] Added : 23 causal constraints over 5 iterations in 91 ms. Result :sat
[2020-05-19 01:37:41] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-19 01:37:41] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 47 ms returned sat
[2020-05-19 01:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:41] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2020-05-19 01:37:41] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-05-19 01:37:41] [INFO ] Added : 24 causal constraints over 5 iterations in 63 ms. Result :sat
[2020-05-19 01:37:41] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-19 01:37:41] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 64 ms returned sat
[2020-05-19 01:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:42] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-05-19 01:37:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 01:37:42] [INFO ] Added : 22 causal constraints over 5 iterations in 83 ms. Result :sat
[2020-05-19 01:37:42] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-19 01:37:42] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-05-19 01:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:42] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2020-05-19 01:37:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 01:37:42] [INFO ] Added : 23 causal constraints over 5 iterations in 76 ms. Result :sat
[2020-05-19 01:37:42] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-19 01:37:42] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 60 ms returned sat
[2020-05-19 01:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:42] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-05-19 01:37:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 01:37:43] [INFO ] Added : 24 causal constraints over 5 iterations in 77 ms. Result :sat
[2020-05-19 01:37:43] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-19 01:37:43] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 68 ms returned sat
[2020-05-19 01:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:43] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2020-05-19 01:37:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-05-19 01:37:43] [INFO ] Added : 19 causal constraints over 4 iterations in 74 ms. Result :sat
[2020-05-19 01:37:43] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-19 01:37:43] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 61 ms returned sat
[2020-05-19 01:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:43] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2020-05-19 01:37:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:37:43] [INFO ] Added : 48 causal constraints over 10 iterations in 124 ms. Result :sat
[2020-05-19 01:37:44] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:44] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-05-19 01:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:44] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-19 01:37:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-19 01:37:44] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-05-19 01:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:44] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-05-19 01:37:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:37:44] [INFO ] Added : 33 causal constraints over 7 iterations in 58 ms. Result :sat
[2020-05-19 01:37:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-19 01:37:44] [INFO ] Flatten gal took : 50 ms
FORMULA QuasiCertifProtocol-COL-06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 01:37:44] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 01:37:44] [INFO ] Applying decomposition
[2020-05-19 01:37:44] [INFO ] Flatten gal took : 56 ms
[2020-05-19 01:37:45] [INFO ] Input system was already deterministic with 116 transitions.
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/graph8834984101449430258.txt, -o, /tmp/graph8834984101449430258.bin, -w, /tmp/graph8834984101449430258.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 116 rows 270 cols
[2020-05-19 01:37:45] [INFO ] Computed 155 place invariants in 6 ms
inv : n7_31 - n7_34 - Cstart_3 + Cstart_6 = 0
inv : n7_22 - n7_27 - Cstart_1 + Cstart_6 = 0
inv : n7_40 - n7_41 - Cstart_5 + Cstart_6 = 0
inv : n8_1 - n8_6 + Cstart_1 - Cstart_6 = 0
inv : n8_10 - n8_13 + Cstart_3 - Cstart_6 = 0
inv : SstopAbort_0 + n9_5 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_5 = 7
inv : n8_35 - n8_41 + Cstart_0 - Cstart_6 = 0
inv : SstopAbort_0 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 = 7
inv : n8_26 - n8_27 + Cstart_5 - Cstart_6 = 0
inv : n7_47 - n7_48 - Cstart_5 + Cstart_6 = 0
inv : n7_29 - n7_34 - Cstart_1 + Cstart_6 = 0
inv : n7_15 - n7_20 - Cstart_1 + Cstart_6 = 0
inv : n8_19 - n8_20 + Cstart_5 - Cstart_6 = 0
inv : n8_28 - n8_34 + Cstart_0 - Cstart_6 = 0
inv : n8_37 - n8_41 + Cstart_2 - Cstart_6 = 0
inv : n8_46 - n8_48 + Cstart_4 - Cstart_6 = 0
inv : AstopAbort_0 + a5_0 + a4_0 + a3_0 + a2_0 + a1_0 + Astart_0 + AstopOK_0 = 1
inv : n8_33 - n8_34 + Cstart_5 - Cstart_6 = 0
inv : n6_1 - n6_6 + n5_1 - n5_6 = 0
inv : n7_33 - n7_34 - Cstart_5 + Cstart_6 = 0
inv : n9_13 - SstopOK_1 + CstopOK_6 = 0
inv : n7_17 - n7_20 - Cstart_3 + Cstart_6 = 0
inv : n8_42 - n8_48 + Cstart_0 - Cstart_6 = 0
inv : n9_11 - SstopOK_1 + CstopOK_4 = 0
inv : n8_44 - n8_48 + Cstart_2 - Cstart_6 = 0
inv : n9_29 - SstopOK_4 + CstopOK_1 = 0
inv : n8_30 - n8_34 + Cstart_2 - Cstart_6 = 0
inv : n7_24 - n7_27 - Cstart_3 + Cstart_6 = 0
inv : n9_31 - SstopOK_4 + CstopOK_3 = 0
inv : n7_45 - n7_48 - Cstart_3 + Cstart_6 = 0
inv : n7_38 - n7_41 - Cstart_3 + Cstart_6 = 0
inv : n4_1 - n4_6 + n3_1 - n3_6 = 0
inv : n9_24 - SstopOK_3 + CstopOK_3 = 0
inv : CstopAbort_0 + c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 = 7
inv : n9_32 - SstopOK_4 + CstopOK_4 = 0
inv : n7_18 - n7_20 - Cstart_4 + Cstart_6 = 0
inv : n7_43 - n7_48 - Cstart_1 + Cstart_6 = 0
inv : n9_17 - SstopOK_2 + CstopOK_3 = 0
inv : n8_40 - n8_41 + Cstart_5 - Cstart_6 = 0
inv : n7_0 - n7_6 - Cstart_0 + Cstart_6 = 0
inv : n4_3 - n4_6 + n3_3 - n3_6 = 0
inv : n2_2 - n2_6 + n1_2 - n1_6 = 0
inv : n8_22 - n8_27 + Cstart_1 - Cstart_6 = 0
inv : n9_9 - SstopOK_1 + CstopOK_2 = 0
inv : n9_25 - SstopOK_3 + CstopOK_4 = 0
inv : n9_8 - SstopOK_1 + CstopOK_1 = 0
inv : n9_16 - SstopOK_2 + CstopOK_2 = 0
inv : n9_33 - SstopOK_4 + CstopOK_5 = 0
inv : n8_32 - n8_34 + Cstart_4 - Cstart_6 = 0
inv : n9_34 - SstopOK_4 + CstopOK_6 = 0
inv : n7_8 - n7_13 - Cstart_1 + Cstart_6 = 0
inv : n4_4 - n4_6 + n3_4 - n3_6 = 0
inv : n9_7 - SstopOK_1 + CstopOK_0 = 0
inv : n7_36 - n7_41 - Cstart_1 + Cstart_6 = 0
inv : n8_47 - n8_48 + Cstart_5 - Cstart_6 = 0
inv : n9_20 - SstopOK_2 + CstopOK_6 = 0
inv : n9_23 - SstopOK_3 + CstopOK_2 = 0
inv : n8_5 - n8_6 + Cstart_5 - Cstart_6 = 0
inv : malicious_reservoir_0 + CstopAbort_0 + SstopAbort_0 = 3
inv : n7_35 - n7_41 - Cstart_0 + Cstart_6 = 0
inv : n9_21 - SstopOK_3 + CstopOK_0 = 0
inv : n9_18 - SstopOK_2 + CstopOK_4 = 0
inv : n8_39 - n8_41 + Cstart_4 - Cstart_6 = 0
inv : n9_19 - SstopOK_2 + CstopOK_5 = 0
inv : n9_22 - SstopOK_3 + CstopOK_1 = 0
inv : n7_1 - n7_6 - Cstart_1 + Cstart_6 = 0
inv : n6_2 - n6_6 + n5_2 - n5_6 = 0
inv : n8_12 - n8_13 + Cstart_5 - Cstart_6 = 0
inv : n7_42 - n7_48 - Cstart_0 + Cstart_6 = 0
inv : n7_46 - n7_48 - Cstart_4 + Cstart_6 = 0
inv : n4_0 - n4_6 + n3_0 - n3_6 = 0
inv : n7_25 - n7_27 - Cstart_4 + Cstart_6 = 0
inv : n8_15 - n8_20 + Cstart_1 - Cstart_6 = 0
inv : n8_8 - n8_13 + Cstart_1 - Cstart_6 = 0
inv : n9_14 - SstopOK_2 + CstopOK_0 = 0
inv : n8_29 - n8_34 + Cstart_1 - Cstart_6 = 0
inv : n9_15 - SstopOK_2 + CstopOK_1 = 0
inv : n7_32 - n7_34 - Cstart_4 + Cstart_6 = 0
inv : n9_26 - SstopOK_3 + CstopOK_5 = 0
inv : n8_36 - n8_41 + Cstart_1 - Cstart_6 = 0
inv : n9_27 - SstopOK_3 + CstopOK_6 = 0
inv : n6_5 - n6_6 + n5_5 - n5_6 = 0
inv : n7_11 - n7_13 - Cstart_4 + Cstart_6 = 0
inv : n7_4 - n7_6 - Cstart_4 + Cstart_6 = 0
inv : n8_43 - n8_48 + Cstart_1 - Cstart_6 = 0
inv : n8_18 - n8_20 + Cstart_4 - Cstart_6 = 0
inv : n8_0 - n8_6 + Cstart_0 - Cstart_6 = 0
inv : n7_39 - n7_41 - Cstart_4 + Cstart_6 = 0
inv : n7_30 - n7_34 - Cstart_2 + Cstart_6 = 0
inv : n7_5 - n7_6 - Cstart_5 + Cstart_6 = 0
inv : n7_23 - n7_27 - Cstart_2 + Cstart_6 = 0
inv : SstopAbort_0 + n9_4 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_4 = 7
inv : n7_14 - n7_20 - Cstart_0 + Cstart_6 = 0
inv : n7_21 - n7_27 - Cstart_0 + Cstart_6 = 0
inv : n9_42 - SstopOK_6 + CstopOK_0 = 0
inv : n7_12 - n7_13 - Cstart_5 + Cstart_6 = 0
inv : n7_3 - n7_6 - Cstart_3 + Cstart_6 = 0
inv : n7_28 - n7_34 - Cstart_0 + Cstart_6 = 0
inv : n7_7 - n7_13 - Cstart_0 + Cstart_6 = 0
inv : n8_7 - n8_13 + Cstart_0 - Cstart_6 = 0
inv : n2_5 - n2_6 + n1_5 - n1_6 = 0
inv : n8_25 - n8_27 + Cstart_4 - Cstart_6 = 0
inv : n9_28 - SstopOK_4 + CstopOK_0 = 0
inv : n8_11 - n8_13 + Cstart_4 - Cstart_6 = 0
inv : n8_4 - n8_6 + Cstart_4 - Cstart_6 = 0
inv : n8_23 - n8_27 + Cstart_2 - Cstart_6 = 0
inv : n9_12 - SstopOK_1 + CstopOK_5 = 0
inv : n9_10 - SstopOK_1 + CstopOK_3 = 0
inv : n9_30 - SstopOK_4 + CstopOK_2 = 0
inv : n8_2 - n8_6 + Cstart_2 - Cstart_6 = 0
inv : n2_3 - n2_6 + n1_3 - n1_6 = 0
inv : n8_9 - n8_13 + Cstart_2 - Cstart_6 = 0
inv : SstopAbort_0 + n9_6 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_6 = 7
inv : n8_16 - n8_20 + Cstart_2 - Cstart_6 = 0
inv : n9_47 - SstopOK_6 + CstopOK_5 = 0
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8834984101449430258.bin, -l, -1, -v, -w, /tmp/graph8834984101449430258.weights, -q, 0, -e, 0.001], workingDir=null]
inv : n6_3 - n6_6 + n5_3 - n5_6 = 0
inv : n9_40 - SstopOK_5 + CstopOK_5 = 0
inv : n7_44 - n7_48 - Cstart_2 + Cstart_6 = 0
inv : SstopAbort_0 + n9_0 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_0 = 7
inv : n8_21 - n8_27 + Cstart_0 - Cstart_6 = 0
inv : n7_10 - n7_13 - Cstart_3 + Cstart_6 = 0
inv : n7_19 - n7_20 - Cstart_5 + Cstart_6 = 0
inv : n6_4 - n6_6 + n5_4 - n5_6 = 0
inv : n4_2 - n4_6 + n3_2 - n3_6 = 0
inv : n8_31 - n8_34 + Cstart_3 - Cstart_6 = 0
inv : n7_9 - n7_13 - Cstart_2 + Cstart_6 = 0
inv : n9_41 - SstopOK_5 + CstopOK_6 = 0
inv : n7_26 - n7_27 - Cstart_5 + Cstart_6 = 0
inv : n9_37 - SstopOK_5 + CstopOK_2 = 0
inv : n8_14 - n8_20 + Cstart_0 - Cstart_6 = 0
inv : n2_1 - n2_6 + n1_1 - n1_6 = 0
inv : n7_2 - n7_6 - Cstart_2 + Cstart_6 = 0
inv : n9_38 - SstopOK_5 + CstopOK_3 = 0
inv : n9_39 - SstopOK_5 + CstopOK_4 = 0
inv : SstopAbort_0 + n9_1 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_1 = 7
inv : n2_0 - n2_6 + n1_0 - n1_6 = 0
inv : n9_35 - SstopOK_5 + CstopOK_0 = 0
inv : n7_37 - n7_41 - Cstart_2 + Cstart_6 = 0
inv : SstopAbort_0 + n9_3 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_3 = 7
inv : n8_3 - n8_6 + Cstart_3 - Cstart_6 = 0
inv : n9_43 - SstopOK_6 + CstopOK_1 = 0
inv : n6_0 - n6_6 + n5_0 - n5_6 = 0
inv : n2_4 - n2_6 + n1_4 - n1_6 = 0
inv : n8_45 - n8_48 + Cstart_3 - Cstart_6 = 0
inv : n4_5 - n4_6 + n3_5 - n3_6 = 0
inv : n8_38 - n8_41 + Cstart_3 - Cstart_6 = 0
inv : n7_16 - n7_20 - Cstart_2 + Cstart_6 = 0
inv : n9_44 - SstopOK_6 + CstopOK_2 = 0
inv : n8_24 - n8_27 + Cstart_3 - Cstart_6 = 0
inv : n9_36 - SstopOK_5 + CstopOK_1 = 0
inv : n9_45 - SstopOK_6 + CstopOK_3 = 0
inv : SstopAbort_0 + n9_2 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_2 = 7
inv : n8_17 - n8_20 + Cstart_3 - Cstart_6 = 0
inv : n9_46 - SstopOK_6 + CstopOK_4 = 0
inv : n9_48 - SstopOK_6 + CstopOK_6 = 0
Total of 155 invariants.
[2020-05-19 01:37:45] [INFO ] Computed 155 place invariants in 29 ms
[2020-05-19 01:37:45] [INFO ] Decomposing Gal with order
[2020-05-19 01:37:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 01:37:45] [INFO ] Removed a total of 46 redundant transitions.
[2020-05-19 01:37:45] [INFO ] Flatten gal took : 81 ms
[2020-05-19 01:37:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 22 ms.
[2020-05-19 01:37:45] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
[2020-05-19 01:37:45] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !((G(!(X((((((((((!(G(F("((((((((i7.i1.u12.n3_0>=1)&&(i7.i1.u18.s2_0>=1))||((i6.i1.u14.n3_3>=1)&&(i6.i1.u23.s2_3>=1)))||((i2.i1.u15.n3_4>=1)&&(i2.i1.u21.s2_4>=1)))||((i8.u13.n3_1>=1)&&(u1.s2_1>=1)))||((i9.i0.u11.n3_2>=1)&&(i9.i0.u25.s2_2>=1)))||((i3.i1.u16.n3_5>=1)&&(i3.i1.u22.s2_5>=1)))||((i4.i1.u17.n3_6>=1)&&(i4.i1.u26.s2_6>=1)))"))))&&("(i8.u2.a1_0<1)"))U(!(X("(i8.u2.a4_0>=1)"))))||("((i7.i1.u12.n3_0>=1)&&(i7.i1.u18.s2_0>=1))"))||("((i6.i1.u14.n3_3>=1)&&(i6.i1.u23.s2_3>=1))"))||("((i2.i1.u15.n3_4>=1)&&(i2.i1.u21.s2_4>=1))"))||("((i8.u13.n3_1>=1)&&(u1.s2_1>=1))"))||("((i9.i0.u11.n3_2>=1)&&(i9.i0.u25.s2_2>=1))"))||("((i3.i1.u16.n3_5>=1)&&(i3.i1.u22.s2_5>=1))"))||("((i4.i1.u17.n3_6>=1)&&(i4.i1.u26.s2_6>=1))"))))))
Formula 0 simplified : !G!X("((i2.i1.u15.n3_4>=1)&&(i2.i1.u21.s2_4>=1))" | "((i3.i1.u16.n3_5>=1)&&(i3.i1.u22.s2_5>=1))" | "((i4.i1.u17.n3_6>=1)&&(i4.i1.u26.s2_6>=1))" | "((i6.i1.u14.n3_3>=1)&&(i6.i1.u23.s2_3>=1))" | "((i7.i1.u12.n3_0>=1)&&(i7.i1.u18.s2_0>=1))" | "((i8.u13.n3_1>=1)&&(u1.s2_1>=1))" | "((i9.i0.u11.n3_2>=1)&&(i9.i0.u25.s2_2>=1))" | (("(i8.u2.a1_0<1)" & !GF"((((((((i7.i1.u12.n3_0>=1)&&(i7.i1.u18.s2_0>=1))||((i6.i1.u14.n3_3>=1)&&(i6.i1.u23.s2_3>=1)))||((i2.i1.u15.n3_4>=1)&&(i2.i1.u21.s2_4>=1)))||((i8.u13.n3_1>=1)&&(u1.s2_1>=1)))||((i9.i0.u11.n3_2>=1)&&(i9.i0.u25.s2_2>=1)))||((i3.i1.u16.n3_5>=1)&&(i3.i1.u22.s2_5>=1)))||((i4.i1.u17.n3_6>=1)&&(i4.i1.u26.s2_6>=1)))") U !X"(i8.u2.a4_0>=1)"))
built 14 ordering constraints for composite.
built 13 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 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 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 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 17 ordering constraints for composite.
built 8 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.
[2020-05-19 01:37:46] [INFO ] Proved 270 variables to be positive in 1042 ms
[2020-05-19 01:37:46] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2020-05-19 01:37:46] [INFO ] Computation of disable matrix completed :0/116 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:37:46] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:37:46] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2020-05-19 01:37:46] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:37:49] [INFO ] Computing symmetric co enabling matrix : 116 transitions.
[2020-05-19 01:37:49] [INFO ] Computation of co-enabling matrix(1/116) took 163 ms. Total solver calls (SAT/UNSAT): 123(123/0)
[2020-05-19 01:37:52] [INFO ] Computation of co-enabling matrix(9/116) took 3184 ms. Total solver calls (SAT/UNSAT): 680(680/0)
[2020-05-19 01:37:55] [INFO ] Computation of co-enabling matrix(14/116) took 6443 ms. Total solver calls (SAT/UNSAT): 1105(1105/0)
[2020-05-19 01:37:58] [INFO ] Computation of co-enabling matrix(21/116) took 9463 ms. Total solver calls (SAT/UNSAT): 1658(1658/0)
[2020-05-19 01:38:01] [INFO ] Computation of co-enabling matrix(29/116) took 12736 ms. Total solver calls (SAT/UNSAT): 2230(2230/0)
[2020-05-19 01:38:05] [INFO ] Computation of co-enabling matrix(36/116) took 16112 ms. Total solver calls (SAT/UNSAT): 2678(2678/0)
[2020-05-19 01:38:08] [INFO ] Computation of co-enabling matrix(43/116) took 19390 ms. Total solver calls (SAT/UNSAT): 3077(3077/0)
[2020-05-19 01:38:12] [INFO ] Computation of co-enabling matrix(68/116) took 23005 ms. Total solver calls (SAT/UNSAT): 3848(3519/329)
[2020-05-19 01:38:15] [INFO ] Computation of co-enabling matrix(73/116) took 26479 ms. Total solver calls (SAT/UNSAT): 4043(3714/329)
[2020-05-19 01:38:18] [INFO ] Computation of co-enabling matrix(79/116) took 29835 ms. Total solver calls (SAT/UNSAT): 4244(3915/329)
[2020-05-19 01:38:22] [INFO ] Computation of co-enabling matrix(85/116) took 33246 ms. Total solver calls (SAT/UNSAT): 4409(4080/329)
[2020-05-19 01:38:25] [INFO ] Computation of co-enabling matrix(96/116) took 36259 ms. Total solver calls (SAT/UNSAT): 4610(4281/329)
[2020-05-19 01:38:27] [INFO ] Computation of Finished co-enabling matrix. took 38251 ms. Total solver calls (SAT/UNSAT): 4703(4359/344)
[2020-05-19 01:38:27] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2020-05-19 01:38:30] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-19 01:38:31] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:630)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-19 01:38:31] [INFO ] Built C files in 46602ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 1816 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 70 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](!( X(( ( ( ( ( ( ( (( !( [](<>((LTLAP0==true)))) ) && ( (LTLAP1==true) ))U(!( X((LTLAP2==true))) )) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ) || ( (LTLAP6==true)) ) || ( (LTLAP7==true)) ) || ( (LTLAP8==true)) ) || ( (LTLAP9==true)) )) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](!( X(( ( ( ( ( ( ( (( !( [](<>((LTLAP0==true)))) ) && ( (LTLAP1==true) ))U(!( X((LTLAP2==true))) )) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ) || ( (LTLAP6==true)) ) || ( (LTLAP7==true)) ) || ( (LTLAP8==true)) ) || ( (LTLAP9==true)) )) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](!( X(( ( ( ( ( ( ( (( !( [](<>((LTLAP0==true)))) ) && ( (LTLAP1==true) ))U(!( X((LTLAP2==true))) )) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ) || ( (LTLAP6==true)) ) || ( (LTLAP7==true)) ) || ( (LTLAP8==true)) ) || ( (LTLAP9==true)) )) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions malC1i0, malS6i6, malS4i1, malS4i2, malS4i4, malS3i0, malS2i6, malS1i3, malS1i5, u1.malS5i0, u1.malS5i1, u1.malS5i2, u1.malS5i3, u1.malS5i4, u1.malS5i5, u1.malS5i6, u1.malS3i1, u1.malS2i1, u1.malS1i1, i8.u2.malA5, i8.u2.malA3, i8.u2.malA4, i8.u2.malA2, i8.u2.malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/24/86
Computing Next relation with stutter on 4237 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
39700 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,397.174,2243628,1,0,1.70356e+06,345815,1775,2.14776e+07,345,1.50207e+06,818917
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(X("((((((((((i7.i0.u3.n5_0<1)||(i7.i1.u12.s3_0<1))&&((i2.i0.u8.n5_4<1)||(i2.i1.u15.s3_4<1)))&&((i1.u5.n5_1<1)||(u1.s3_1<1)))&&((i6.i0.u4.n5_3<1)||(i6.i1.u14.s3_3<1)))&&((i3.i0.u9.n5_5<1)||(i3.i0.u9.s3_5<1)))&&((i9.i1.u6.n5_2<1)||(i9.i1.u6.s3_2<1)))&&((i4.i0.u10.n5_6<1)||(i4.i0.u10.s3_6<1)))&&(i8.u2.a5_0<1))||((i8.u2.a5_0<1)&&(i8.u2.a5_0>=1)))")))||(X(F("((((((((i7.i0.u3.n6_0>=1)&&(i1.u5.n6_1>=1))&&(i9.i1.u6.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i3.i0.u9.n6_5>=1))&&(i4.i0.u10.n6_6>=1))&&(i8.u2.a5_0>=1))")))))
Formula 1 simplified : !(XX"((((((((((i7.i0.u3.n5_0<1)||(i7.i1.u12.s3_0<1))&&((i2.i0.u8.n5_4<1)||(i2.i1.u15.s3_4<1)))&&((i1.u5.n5_1<1)||(u1.s3_1<1)))&&((i6.i0.u4.n5_3<1)||(i6.i1.u14.s3_3<1)))&&((i3.i0.u9.n5_5<1)||(i3.i0.u9.s3_5<1)))&&((i9.i1.u6.n5_2<1)||(i9.i1.u6.s3_2<1)))&&((i4.i0.u10.n5_6<1)||(i4.i0.u10.s3_6<1)))&&(i8.u2.a5_0<1))||((i8.u2.a5_0<1)&&(i8.u2.a5_0>=1)))" | XF"((((((((i7.i0.u3.n6_0>=1)&&(i1.u5.n6_1>=1))&&(i9.i1.u6.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i3.i0.u9.n6_5>=1))&&(i4.i0.u10.n6_6>=1))&&(i8.u2.a5_0>=1))")
Computing Next relation with stutter on 4237 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
4291 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,440.092,2243628,1,0,1.70356e+06,345815,2125,2.14776e+07,433,1.50207e+06,1432801
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(X((X("((((((((i7.i0.u3.n6_0>=1)&&(i1.u5.n6_1>=1))&&(i9.i1.u6.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i3.i0.u9.n6_5>=1))&&(i4.i0.u10.n6_6>=1))&&(i8.u2.a5_0>=1))"))||(F("((((((((i7.i1.u12.n4_0>=1)&&(i8.u13.n4_1>=1))&&(i9.i0.u11.n4_2>=1))&&(i6.i1.u14.n4_3>=1))&&(i2.i1.u15.n4_4>=1))&&(i3.i1.u16.n4_5>=1))&&(i4.i1.u17.n4_6>=1))&&(i8.u2.a3_0>=1))")))))))
Formula 2 simplified : !FXX(X"((((((((i7.i0.u3.n6_0>=1)&&(i1.u5.n6_1>=1))&&(i9.i1.u6.n6_2>=1))&&(i6.i0.u4.n6_3>=1))&&(i2.i0.u8.n6_4>=1))&&(i3.i0.u9.n6_5>=1))&&(i4.i0.u10.n6_6>=1))&&(i8.u2.a5_0>=1))" | F"((((((((i7.i1.u12.n4_0>=1)&&(i8.u13.n4_1>=1))&&(i9.i0.u11.n4_2>=1))&&(i6.i1.u14.n4_3>=1))&&(i2.i1.u15.n4_4>=1))&&(i3.i1.u16.n4_5>=1))&&(i4.i1.u17.n4_6>=1))&&(i8.u2.a3_0>=1))")
Computing Next relation with stutter on 4237 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,440.145,2243628,1,0,1.70356e+06,345815,2198,2.14776e+07,433,1.50207e+06,1451319
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((!(G(X("((i8.u2.a2_0<1)&&((((((((u1.malicious_reservoir_0>=1)&&(i7.i1.u12.s3_0>=1))||((u1.malicious_reservoir_0>=1)&&(u1.s3_1>=1)))||((u1.malicious_reservoir_0>=1)&&(i9.i1.u6.s3_2>=1)))||((u1.malicious_reservoir_0>=1)&&(i6.i1.u14.s3_3>=1)))||((u1.malicious_reservoir_0>=1)&&(i2.i1.u15.s3_4>=1)))||((u1.malicious_reservoir_0>=1)&&(i3.i0.u9.s3_5>=1)))||((u1.malicious_reservoir_0>=1)&&(i4.i0.u10.s3_6>=1))))"))))&&("(i8.u2.a2_0<1)"))))
Formula 3 simplified : !F("(i8.u2.a2_0<1)" & !GX"((i8.u2.a2_0<1)&&((((((((u1.malicious_reservoir_0>=1)&&(i7.i1.u12.s3_0>=1))||((u1.malicious_reservoir_0>=1)&&(u1.s3_1>=1)))||((u1.malicious_reservoir_0>=1)&&(i9.i1.u6.s3_2>=1)))||((u1.malicious_reservoir_0>=1)&&(i6.i1.u14.s3_3>=1)))||((u1.malicious_reservoir_0>=1)&&(i2.i1.u15.s3_4>=1)))||((u1.malicious_reservoir_0>=1)&&(i3.i0.u9.s3_5>=1)))||((u1.malicious_reservoir_0>=1)&&(i4.i0.u10.s3_6>=1))))")
Computing Next relation with stutter on 4237 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,440.147,2243628,1,0,1.70356e+06,345815,2277,2.14776e+07,436,1.50207e+06,1451438
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G(("(i8.u2.a4_0>=1)")U("(((((((i6.i0.u7.s4_3>=1)||(i9.i1.u29.s4_2>=1))||(i1.u28.s4_1>=1))||(i7.i0.u27.s4_0>=1))||(i4.i0.u32.s4_6>=1))||(i3.i0.u31.s4_5>=1))||(i2.i0.u30.s4_4>=1))")))))
Formula 4 simplified : !FG("(i8.u2.a4_0>=1)" U "(((((((i6.i0.u7.s4_3>=1)||(i9.i1.u29.s4_2>=1))||(i1.u28.s4_1>=1))||(i7.i0.u27.s4_0>=1))||(i4.i0.u32.s4_6>=1))||(i3.i0.u31.s4_5>=1))||(i2.i0.u30.s4_4>=1))")
Computing Next relation with stutter on 4237 deadlock states
55 unique states visited
55 strongly connected components in search stack
55 transitions explored
55 items max in DFS search stack
43401 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,874.162,2604780,1,0,1.70356e+06,365638,1746,2.61967e+07,345,1.58879e+06,1582306
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F(G("((((((((((((((i10.i1.u34.n8_7>=1)&&(i10.i1.u34.n8_8>=1))&&(i10.i1.u34.n8_9>=1))&&(i10.i1.u34.n8_10>=1))&&(i10.i1.u34.n8_11>=1))&&(i10.i1.u34.n8_12>=1))&&(i10.i1.u34.n8_13>=1))&&(u1.s5_1>=1))||((((((((i10.i6.u39.n8_42>=1)&&(i10.i6.u39.n8_43>=1))&&(i10.i6.u39.n8_44>=1))&&(i10.i6.u39.n8_45>=1))&&(i10.i6.u39.n8_46>=1))&&(i10.i6.u39.n8_47>=1))&&(i10.i6.u39.n8_48>=1))&&(u1.s5_6>=1)))||((((((((i10.i3.u37.n8_28>=1)&&(i10.i3.u37.n8_29>=1))&&(i10.i3.u37.n8_30>=1))&&(i10.i3.u37.n8_31>=1))&&(i10.i3.u37.n8_32>=1))&&(i10.i3.u37.n8_33>=1))&&(i10.i3.u37.n8_34>=1))&&(u1.s5_4>=1)))||((((((((i10.i2.u35.n8_14>=1)&&(i10.i2.u35.n8_15>=1))&&(i10.i2.u35.n8_16>=1))&&(i10.i2.u35.n8_17>=1))&&(i10.i2.u35.n8_18>=1))&&(i10.i2.u35.n8_19>=1))&&(i10.i2.u35.n8_20>=1))&&(u1.s5_2>=1)))||((((((((i10.i5.u38.n8_35>=1)&&(i10.i5.u38.n8_36>=1))&&(i10.i5.u38.n8_37>=1))&&(i10.i5.u38.n8_38>=1))&&(i10.i5.u38.n8_39>=1))&&(i10.i5.u38.n8_40>=1))&&(i10.i5.u38.n8_41>=1))&&(u1.s5_5>=1)))||((((((((i10.i0.u33.n8_0>=1)&&(i10.i0.u33.n8_1>=1))&&(i10.i0.u33.n8_2>=1))&&(i10.i0.u33.n8_3>=1))&&(i10.i0.u33.n8_4>=1))&&(i10.i0.u33.n8_5>=1))&&(i10.i0.u33.n8_6>=1))&&(u1.s5_0>=1)))||((((((((i10.i4.u36.n8_21>=1)&&(i10.i4.u36.n8_22>=1))&&(i10.i4.u36.n8_23>=1))&&(i10.i4.u36.n8_24>=1))&&(i10.i4.u36.n8_25>=1))&&(i10.i4.u36.n8_26>=1))&&(i10.i4.u36.n8_27>=1))&&(u1.s5_3>=1)))")))U("(i8.u2.a5_0>=1)"))))
Formula 5 simplified : !X(FG"((((((((((((((i10.i1.u34.n8_7>=1)&&(i10.i1.u34.n8_8>=1))&&(i10.i1.u34.n8_9>=1))&&(i10.i1.u34.n8_10>=1))&&(i10.i1.u34.n8_11>=1))&&(i10.i1.u34.n8_12>=1))&&(i10.i1.u34.n8_13>=1))&&(u1.s5_1>=1))||((((((((i10.i6.u39.n8_42>=1)&&(i10.i6.u39.n8_43>=1))&&(i10.i6.u39.n8_44>=1))&&(i10.i6.u39.n8_45>=1))&&(i10.i6.u39.n8_46>=1))&&(i10.i6.u39.n8_47>=1))&&(i10.i6.u39.n8_48>=1))&&(u1.s5_6>=1)))||((((((((i10.i3.u37.n8_28>=1)&&(i10.i3.u37.n8_29>=1))&&(i10.i3.u37.n8_30>=1))&&(i10.i3.u37.n8_31>=1))&&(i10.i3.u37.n8_32>=1))&&(i10.i3.u37.n8_33>=1))&&(i10.i3.u37.n8_34>=1))&&(u1.s5_4>=1)))||((((((((i10.i2.u35.n8_14>=1)&&(i10.i2.u35.n8_15>=1))&&(i10.i2.u35.n8_16>=1))&&(i10.i2.u35.n8_17>=1))&&(i10.i2.u35.n8_18>=1))&&(i10.i2.u35.n8_19>=1))&&(i10.i2.u35.n8_20>=1))&&(u1.s5_2>=1)))||((((((((i10.i5.u38.n8_35>=1)&&(i10.i5.u38.n8_36>=1))&&(i10.i5.u38.n8_37>=1))&&(i10.i5.u38.n8_38>=1))&&(i10.i5.u38.n8_39>=1))&&(i10.i5.u38.n8_40>=1))&&(i10.i5.u38.n8_41>=1))&&(u1.s5_5>=1)))||((((((((i10.i0.u33.n8_0>=1)&&(i10.i0.u33.n8_1>=1))&&(i10.i0.u33.n8_2>=1))&&(i10.i0.u33.n8_3>=1))&&(i10.i0.u33.n8_4>=1))&&(i10.i0.u33.n8_5>=1))&&(i10.i0.u33.n8_6>=1))&&(u1.s5_0>=1)))||((((((((i10.i4.u36.n8_21>=1)&&(i10.i4.u36.n8_22>=1))&&(i10.i4.u36.n8_23>=1))&&(i10.i4.u36.n8_24>=1))&&(i10.i4.u36.n8_25>=1))&&(i10.i4.u36.n8_26>=1))&&(i10.i4.u36.n8_27>=1))&&(u1.s5_3>=1)))" U "(i8.u2.a5_0>=1)")
Computing Next relation with stutter on 4237 deadlock states
24 unique states visited
24 strongly connected components in search stack
24 transitions explored
24 items max in DFS search stack
4602 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,920.182,2604780,1,0,1.70356e+06,365638,2492,2.61967e+07,500,1.58879e+06,2212793
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(F("((((((((u1.malicious_reservoir_0<1)||(u1.s5_0<1))&&((u1.malicious_reservoir_0<1)||(u1.s5_1<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_2<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_3<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_4<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_5<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_6<1)))")))))
Formula 6 simplified : !GXF"((((((((u1.malicious_reservoir_0<1)||(u1.s5_0<1))&&((u1.malicious_reservoir_0<1)||(u1.s5_1<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_2<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_3<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_4<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_5<1)))&&((u1.malicious_reservoir_0<1)||(u1.s5_6<1)))"
Computing Next relation with stutter on 4237 deadlock states
Detected timeout of ITS tools.
[2020-05-19 01:57:51] [INFO ] Applying decomposition
[2020-05-19 01:57:51] [INFO ] Flatten gal took : 33 ms
[2020-05-19 01:57:51] [INFO ] Decomposing Gal with order
[2020-05-19 01:57:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 01:57:51] [INFO ] Removed a total of 104 redundant transitions.
[2020-05-19 01:57:51] [INFO ] Flatten gal took : 44 ms
[2020-05-19 01:57:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2020-05-19 01:57:51] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
[2020-05-19 01:57:51] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !((G(X(F("((((((((malicious_reservoir.malicious_reservoir_0<1)||(tsid0.s5_0<1))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid1.s5_1<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid2.s5_2<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid3.s5_3<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid4.s5_4<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid5.s5_5<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid6.s5_6<1)))")))))
Formula 0 simplified : !GXF"((((((((malicious_reservoir.malicious_reservoir_0<1)||(tsid0.s5_0<1))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid1.s5_1<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid2.s5_2<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid3.s5_3<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid4.s5_4<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid5.s5_5<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid6.s5_6<1)))"
built 39 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions malC1i0, malC1i1, malC1i2, malC1i3, malC1i4, malC1i5, malC1i6, malS6i0, malS6i1, malS6i3, malS4i6, malS3i2, malS2i5, malS1i4, malA5, malA3, malA4, malA2, malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/19/81
Computing Next relation with stutter on 4237 deadlock states
125 unique states visited
0 strongly connected components in search stack
126 transitions explored
64 items max in DFS search stack
13185 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,131.893,2956132,1,0,7.23777e+06,5062,1467,4.35194e+06,256,22945,21194360
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((((((((((G("(((((((tsid3.s4_3>=1)||(tsid2.s4_2>=1))||(tsid1.s4_1>=1))||(tsid0.s4_0>=1))||(tsid6.s4_6>=1))||(tsid5.s4_5>=1))||(tsid4.s4_4>=1))"))U(F(G("(a2.a2_0>=1)"))))||(G("((((((((tsid0.n4_0>=1)&&(tsid1.n4_1>=1))&&(tsid2.n4_2>=1))&&(tsid3.n4_3>=1))&&(tsid4.n4_4>=1))&&(tsid5.n4_5>=1))&&(tsid6.n4_6>=1))&&(a3.a3_0>=1))")))||("((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid6.s6_6>=1))"))||("((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid0.s6_0>=1))"))||("((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid1.s6_1>=1))"))||("((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid2.s6_2>=1))"))||("((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid3.s6_3>=1))"))||("((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid4.s6_4>=1))"))||("((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid5.s6_5>=1))"))))
Formula 1 simplified : !G("((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid0.s6_0>=1))" | "((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid1.s6_1>=1))" | "((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid2.s6_2>=1))" | "((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid3.s6_3>=1))" | "((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid4.s6_4>=1))" | "((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid5.s6_5>=1))" | "((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid6.s6_6>=1))" | (G"(((((((tsid3.s4_3>=1)||(tsid2.s4_2>=1))||(tsid1.s4_1>=1))||(tsid0.s4_0>=1))||(tsid6.s4_6>=1))||(tsid5.s4_5>=1))||(tsid4.s4_4>=1))" U FG"(a2.a2_0>=1)") | G"((((((((tsid0.n4_0>=1)&&(tsid1.n4_1>=1))&&(tsid2.n4_2>=1))&&(tsid3.n4_3>=1))&&(tsid4.n4_4>=1))&&(tsid5.n4_5>=1))&&(tsid6.n4_6>=1))&&(a3.a3_0>=1))")
Computing Next relation with stutter on 4237 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7231 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,204.234,3322528,1,0,9.24916e+06,5062,1352,5.86371e+06,231,22945,21477685
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X(F((F("((((((((tsid0.n2_0<1)||(tsid1.n2_1<1))||(tsid2.n2_2<1))||(tsid3.n2_3<1))||(tsid4.n2_4<1))||(tsid5.n2_5<1))||(tsid6.n2_6<1))||(a1.a1_0<1))"))U("((((((((malicious_reservoir.malicious_reservoir_0<1)||(tsid4.s4_4<1))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid5.s4_5<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid6.s4_6<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid0.s4_0<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid1.s4_1<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid2.s4_2<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid3.s4_3<1)))"))))&&(!(X(("((((((((tsid0.n2_0>=1)&&(tsid1.n2_1>=1))&&(tsid2.n2_2>=1))&&(tsid3.n2_3>=1))&&(tsid4.n2_4>=1))&&(tsid5.n2_5>=1))&&(tsid6.n2_6>=1))&&(a1.a1_0>=1))")U("((((((((tsid0.n3_0>=1)&&(tsid0.s2_0>=1))||((tsid3.n3_3>=1)&&(tsid3.s2_3>=1)))||((tsid4.n3_4>=1)&&(tsid4.s2_4>=1)))||((tsid1.n3_1>=1)&&(tsid1.s2_1>=1)))||((tsid2.n3_2>=1)&&(tsid2.s2_2>=1)))||((tsid5.n3_5>=1)&&(tsid5.s2_5>=1)))||((tsid6.n3_6>=1)&&(tsid6.s2_6>=1)))"))))))
Formula 2 simplified : !(XF(F"((((((((tsid0.n2_0<1)||(tsid1.n2_1<1))||(tsid2.n2_2<1))||(tsid3.n2_3<1))||(tsid4.n2_4<1))||(tsid5.n2_5<1))||(tsid6.n2_6<1))||(a1.a1_0<1))" U "((((((((malicious_reservoir.malicious_reservoir_0<1)||(tsid4.s4_4<1))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid5.s4_5<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid6.s4_6<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid0.s4_0<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid1.s4_1<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid2.s4_2<1)))&&((malicious_reservoir.malicious_reservoir_0<1)||(tsid3.s4_3<1)))") & !X("((((((((tsid0.n2_0>=1)&&(tsid1.n2_1>=1))&&(tsid2.n2_2>=1))&&(tsid3.n2_3>=1))&&(tsid4.n2_4>=1))&&(tsid5.n2_5>=1))&&(tsid6.n2_6>=1))&&(a1.a1_0>=1))" U "((((((((tsid0.n3_0>=1)&&(tsid0.s2_0>=1))||((tsid3.n3_3>=1)&&(tsid3.s2_3>=1)))||((tsid4.n3_4>=1)&&(tsid4.s2_4>=1)))||((tsid1.n3_1>=1)&&(tsid1.s2_1>=1)))||((tsid2.n3_2>=1)&&(tsid2.s2_2>=1)))||((tsid5.n3_5>=1)&&(tsid5.s2_5>=1)))||((tsid6.n3_6>=1)&&(tsid6.s2_6>=1)))"))
Computing Next relation with stutter on 4237 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1000 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,214.229,3322528,1,0,9.24916e+06,5062,1907,5.86371e+06,273,22945,24553121
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X(X(F(!(F((F("((((((((((((((tsidxtsid0.n7_0>=1)&&(tsidxtsid7.n7_7>=1))&&(tsidxtsid14.n7_14>=1))&&(tsidxtsid21.n7_21>=1))&&(tsidxtsid28.n7_28>=1))&&(tsidxtsid35.n7_35>=1))&&(tsidxtsid42.n7_42>=1))&&(tsid0.Cstart_0>=1))||((((((((tsidxtsid6.n7_6>=1)&&(tsidxtsid13.n7_13>=1))&&(tsidxtsid20.n7_20>=1))&&(tsidxtsid27.n7_27>=1))&&(tsidxtsid34.n7_34>=1))&&(tsidxtsid41.n7_41>=1))&&(tsidxtsid48.n7_48>=1))&&(tsid6.Cstart_6>=1)))||((((((((tsidxtsid2.n7_2>=1)&&(tsidxtsid9.n7_9>=1))&&(tsidxtsid16.n7_16>=1))&&(tsidxtsid23.n7_23>=1))&&(tsidxtsid30.n7_30>=1))&&(tsidxtsid37.n7_37>=1))&&(tsidxtsid44.n7_44>=1))&&(tsid2.Cstart_2>=1)))||((((((((tsidxtsid1.n7_1>=1)&&(tsidxtsid8.n7_8>=1))&&(tsidxtsid15.n7_15>=1))&&(tsidxtsid22.n7_22>=1))&&(tsidxtsid29.n7_29>=1))&&(tsidxtsid36.n7_36>=1))&&(tsidxtsid43.n7_43>=1))&&(tsid1.Cstart_1>=1)))||((((((((tsidxtsid3.n7_3>=1)&&(tsidxtsid10.n7_10>=1))&&(tsidxtsid17.n7_17>=1))&&(tsidxtsid24.n7_24>=1))&&(tsidxtsid31.n7_31>=1))&&(tsidxtsid38.n7_38>=1))&&(tsidxtsid45.n7_45>=1))&&(tsid3.Cstart_3>=1)))||((((((((tsidxtsid5.n7_5>=1)&&(tsidxtsid12.n7_12>=1))&&(tsidxtsid19.n7_19>=1))&&(tsidxtsid26.n7_26>=1))&&(tsidxtsid33.n7_33>=1))&&(tsidxtsid40.n7_40>=1))&&(tsidxtsid47.n7_47>=1))&&(tsid5.Cstart_5>=1)))||((((((((tsidxtsid4.n7_4>=1)&&(tsidxtsid11.n7_11>=1))&&(tsidxtsid18.n7_18>=1))&&(tsidxtsid25.n7_25>=1))&&(tsidxtsid32.n7_32>=1))&&(tsidxtsid39.n7_39>=1))&&(tsidxtsid46.n7_46>=1))&&(tsid4.Cstart_4>=1)))"))&&("((((((((((((((tsidxtsid0.n7_0>=1)&&(tsidxtsid7.n7_7>=1))&&(tsidxtsid14.n7_14>=1))&&(tsidxtsid21.n7_21>=1))&&(tsidxtsid28.n7_28>=1))&&(tsidxtsid35.n7_35>=1))&&(tsidxtsid42.n7_42>=1))&&(tsid0.Cstart_0>=1))||((((((((tsidxtsid6.n7_6>=1)&&(tsidxtsid13.n7_13>=1))&&(tsidxtsid20.n7_20>=1))&&(tsidxtsid27.n7_27>=1))&&(tsidxtsid34.n7_34>=1))&&(tsidxtsid41.n7_41>=1))&&(tsidxtsid48.n7_48>=1))&&(tsid6.Cstart_6>=1)))||((((((((tsidxtsid2.n7_2>=1)&&(tsidxtsid9.n7_9>=1))&&(tsidxtsid16.n7_16>=1))&&(tsidxtsid23.n7_23>=1))&&(tsidxtsid30.n7_30>=1))&&(tsidxtsid37.n7_37>=1))&&(tsidxtsid44.n7_44>=1))&&(tsid2.Cstart_2>=1)))||((((((((tsidxtsid1.n7_1>=1)&&(tsidxtsid8.n7_8>=1))&&(tsidxtsid15.n7_15>=1))&&(tsidxtsid22.n7_22>=1))&&(tsidxtsid29.n7_29>=1))&&(tsidxtsid36.n7_36>=1))&&(tsidxtsid43.n7_43>=1))&&(tsid1.Cstart_1>=1)))||((((((((tsidxtsid3.n7_3>=1)&&(tsidxtsid10.n7_10>=1))&&(tsidxtsid17.n7_17>=1))&&(tsidxtsid24.n7_24>=1))&&(tsidxtsid31.n7_31>=1))&&(tsidxtsid38.n7_38>=1))&&(tsidxtsid45.n7_45>=1))&&(tsid3.Cstart_3>=1)))||((((((((tsidxtsid5.n7_5>=1)&&(tsidxtsid12.n7_12>=1))&&(tsidxtsid19.n7_19>=1))&&(tsidxtsid26.n7_26>=1))&&(tsidxtsid33.n7_33>=1))&&(tsidxtsid40.n7_40>=1))&&(tsidxtsid47.n7_47>=1))&&(tsid5.Cstart_5>=1)))||((((((((tsidxtsid4.n7_4>=1)&&(tsidxtsid11.n7_11>=1))&&(tsidxtsid18.n7_18>=1))&&(tsidxtsid25.n7_25>=1))&&(tsidxtsid32.n7_32>=1))&&(tsidxtsid39.n7_39>=1))&&(tsidxtsid46.n7_46>=1))&&(tsid4.Cstart_4>=1)))")))))))))
Formula 3 simplified : XXF!F("((((((((((((((tsidxtsid0.n7_0>=1)&&(tsidxtsid7.n7_7>=1))&&(tsidxtsid14.n7_14>=1))&&(tsidxtsid21.n7_21>=1))&&(tsidxtsid28.n7_28>=1))&&(tsidxtsid35.n7_35>=1))&&(tsidxtsid42.n7_42>=1))&&(tsid0.Cstart_0>=1))||((((((((tsidxtsid6.n7_6>=1)&&(tsidxtsid13.n7_13>=1))&&(tsidxtsid20.n7_20>=1))&&(tsidxtsid27.n7_27>=1))&&(tsidxtsid34.n7_34>=1))&&(tsidxtsid41.n7_41>=1))&&(tsidxtsid48.n7_48>=1))&&(tsid6.Cstart_6>=1)))||((((((((tsidxtsid2.n7_2>=1)&&(tsidxtsid9.n7_9>=1))&&(tsidxtsid16.n7_16>=1))&&(tsidxtsid23.n7_23>=1))&&(tsidxtsid30.n7_30>=1))&&(tsidxtsid37.n7_37>=1))&&(tsidxtsid44.n7_44>=1))&&(tsid2.Cstart_2>=1)))||((((((((tsidxtsid1.n7_1>=1)&&(tsidxtsid8.n7_8>=1))&&(tsidxtsid15.n7_15>=1))&&(tsidxtsid22.n7_22>=1))&&(tsidxtsid29.n7_29>=1))&&(tsidxtsid36.n7_36>=1))&&(tsidxtsid43.n7_43>=1))&&(tsid1.Cstart_1>=1)))||((((((((tsidxtsid3.n7_3>=1)&&(tsidxtsid10.n7_10>=1))&&(tsidxtsid17.n7_17>=1))&&(tsidxtsid24.n7_24>=1))&&(tsidxtsid31.n7_31>=1))&&(tsidxtsid38.n7_38>=1))&&(tsidxtsid45.n7_45>=1))&&(tsid3.Cstart_3>=1)))||((((((((tsidxtsid5.n7_5>=1)&&(tsidxtsid12.n7_12>=1))&&(tsidxtsid19.n7_19>=1))&&(tsidxtsid26.n7_26>=1))&&(tsidxtsid33.n7_33>=1))&&(tsidxtsid40.n7_40>=1))&&(tsidxtsid47.n7_47>=1))&&(tsid5.Cstart_5>=1)))||((((((((tsidxtsid4.n7_4>=1)&&(tsidxtsid11.n7_11>=1))&&(tsidxtsid18.n7_18>=1))&&(tsidxtsid25.n7_25>=1))&&(tsidxtsid32.n7_32>=1))&&(tsidxtsid39.n7_39>=1))&&(tsidxtsid46.n7_46>=1))&&(tsid4.Cstart_4>=1)))" & F"((((((((((((((tsidxtsid0.n7_0>=1)&&(tsidxtsid7.n7_7>=1))&&(tsidxtsid14.n7_14>=1))&&(tsidxtsid21.n7_21>=1))&&(tsidxtsid28.n7_28>=1))&&(tsidxtsid35.n7_35>=1))&&(tsidxtsid42.n7_42>=1))&&(tsid0.Cstart_0>=1))||((((((((tsidxtsid6.n7_6>=1)&&(tsidxtsid13.n7_13>=1))&&(tsidxtsid20.n7_20>=1))&&(tsidxtsid27.n7_27>=1))&&(tsidxtsid34.n7_34>=1))&&(tsidxtsid41.n7_41>=1))&&(tsidxtsid48.n7_48>=1))&&(tsid6.Cstart_6>=1)))||((((((((tsidxtsid2.n7_2>=1)&&(tsidxtsid9.n7_9>=1))&&(tsidxtsid16.n7_16>=1))&&(tsidxtsid23.n7_23>=1))&&(tsidxtsid30.n7_30>=1))&&(tsidxtsid37.n7_37>=1))&&(tsidxtsid44.n7_44>=1))&&(tsid2.Cstart_2>=1)))||((((((((tsidxtsid1.n7_1>=1)&&(tsidxtsid8.n7_8>=1))&&(tsidxtsid15.n7_15>=1))&&(tsidxtsid22.n7_22>=1))&&(tsidxtsid29.n7_29>=1))&&(tsidxtsid36.n7_36>=1))&&(tsidxtsid43.n7_43>=1))&&(tsid1.Cstart_1>=1)))||((((((((tsidxtsid3.n7_3>=1)&&(tsidxtsid10.n7_10>=1))&&(tsidxtsid17.n7_17>=1))&&(tsidxtsid24.n7_24>=1))&&(tsidxtsid31.n7_31>=1))&&(tsidxtsid38.n7_38>=1))&&(tsidxtsid45.n7_45>=1))&&(tsid3.Cstart_3>=1)))||((((((((tsidxtsid5.n7_5>=1)&&(tsidxtsid12.n7_12>=1))&&(tsidxtsid19.n7_19>=1))&&(tsidxtsid26.n7_26>=1))&&(tsidxtsid33.n7_33>=1))&&(tsidxtsid40.n7_40>=1))&&(tsidxtsid47.n7_47>=1))&&(tsid5.Cstart_5>=1)))||((((((((tsidxtsid4.n7_4>=1)&&(tsidxtsid11.n7_11>=1))&&(tsidxtsid18.n7_18>=1))&&(tsidxtsid25.n7_25>=1))&&(tsidxtsid32.n7_32>=1))&&(tsidxtsid39.n7_39>=1))&&(tsidxtsid46.n7_46>=1))&&(tsid4.Cstart_4>=1)))")
Computing Next relation with stutter on 4237 deadlock states
65 unique states visited
65 strongly connected components in search stack
66 transitions explored
65 items max in DFS search stack
752 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,221.748,3322528,1,0,9.24916e+06,5062,2275,5.86371e+06,297,22945,26405567
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(X(G(X("((((((((tsid0.n6_0>=1)&&(tsid1.n6_1>=1))&&(tsid2.n6_2>=1))&&(tsid3.n6_3>=1))&&(tsid4.n6_4>=1))&&(tsid5.n6_5>=1))&&(tsid6.n6_6>=1))&&(a5.a5_0>=1))")))))U("(a4.a4_0>=1)")))
Formula 4 simplified : !(GXGX"((((((((tsid0.n6_0>=1)&&(tsid1.n6_1>=1))&&(tsid2.n6_2>=1))&&(tsid3.n6_3>=1))&&(tsid4.n6_4>=1))&&(tsid5.n6_5>=1))&&(tsid6.n6_6>=1))&&(a5.a5_0>=1))" U "(a4.a4_0>=1)")
Computing Next relation with stutter on 4237 deadlock states
23 unique states visited
23 strongly connected components in search stack
23 transitions explored
23 items max in DFS search stack
57 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,222.315,3322528,1,0,9.24916e+06,5062,2333,5.86371e+06,297,22945,26695643
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(F("((((((((((((((tsidxtsid0.n7_0>=1)&&(tsidxtsid7.n7_7>=1))&&(tsidxtsid14.n7_14>=1))&&(tsidxtsid21.n7_21>=1))&&(tsidxtsid28.n7_28>=1))&&(tsidxtsid35.n7_35>=1))&&(tsidxtsid42.n7_42>=1))&&(tsid0.Cstart_0>=1))||((((((((tsidxtsid6.n7_6>=1)&&(tsidxtsid13.n7_13>=1))&&(tsidxtsid20.n7_20>=1))&&(tsidxtsid27.n7_27>=1))&&(tsidxtsid34.n7_34>=1))&&(tsidxtsid41.n7_41>=1))&&(tsidxtsid48.n7_48>=1))&&(tsid6.Cstart_6>=1)))||((((((((tsidxtsid2.n7_2>=1)&&(tsidxtsid9.n7_9>=1))&&(tsidxtsid16.n7_16>=1))&&(tsidxtsid23.n7_23>=1))&&(tsidxtsid30.n7_30>=1))&&(tsidxtsid37.n7_37>=1))&&(tsidxtsid44.n7_44>=1))&&(tsid2.Cstart_2>=1)))||((((((((tsidxtsid1.n7_1>=1)&&(tsidxtsid8.n7_8>=1))&&(tsidxtsid15.n7_15>=1))&&(tsidxtsid22.n7_22>=1))&&(tsidxtsid29.n7_29>=1))&&(tsidxtsid36.n7_36>=1))&&(tsidxtsid43.n7_43>=1))&&(tsid1.Cstart_1>=1)))||((((((((tsidxtsid3.n7_3>=1)&&(tsidxtsid10.n7_10>=1))&&(tsidxtsid17.n7_17>=1))&&(tsidxtsid24.n7_24>=1))&&(tsidxtsid31.n7_31>=1))&&(tsidxtsid38.n7_38>=1))&&(tsidxtsid45.n7_45>=1))&&(tsid3.Cstart_3>=1)))||((((((((tsidxtsid5.n7_5>=1)&&(tsidxtsid12.n7_12>=1))&&(tsidxtsid19.n7_19>=1))&&(tsidxtsid26.n7_26>=1))&&(tsidxtsid33.n7_33>=1))&&(tsidxtsid40.n7_40>=1))&&(tsidxtsid47.n7_47>=1))&&(tsid5.Cstart_5>=1)))||((((((((tsidxtsid4.n7_4>=1)&&(tsidxtsid11.n7_11>=1))&&(tsidxtsid18.n7_18>=1))&&(tsidxtsid25.n7_25>=1))&&(tsidxtsid32.n7_32>=1))&&(tsidxtsid39.n7_39>=1))&&(tsidxtsid46.n7_46>=1))&&(tsid4.Cstart_4>=1)))")))U((F(G(X(G("((((((((((((((tsidxtsid0.n7_0>=1)&&(tsidxtsid7.n7_7>=1))&&(tsidxtsid14.n7_14>=1))&&(tsidxtsid21.n7_21>=1))&&(tsidxtsid28.n7_28>=1))&&(tsidxtsid35.n7_35>=1))&&(tsidxtsid42.n7_42>=1))&&(tsid0.Cstart_0>=1))||((((((((tsidxtsid6.n7_6>=1)&&(tsidxtsid13.n7_13>=1))&&(tsidxtsid20.n7_20>=1))&&(tsidxtsid27.n7_27>=1))&&(tsidxtsid34.n7_34>=1))&&(tsidxtsid41.n7_41>=1))&&(tsidxtsid48.n7_48>=1))&&(tsid6.Cstart_6>=1)))||((((((((tsidxtsid2.n7_2>=1)&&(tsidxtsid9.n7_9>=1))&&(tsidxtsid16.n7_16>=1))&&(tsidxtsid23.n7_23>=1))&&(tsidxtsid30.n7_30>=1))&&(tsidxtsid37.n7_37>=1))&&(tsidxtsid44.n7_44>=1))&&(tsid2.Cstart_2>=1)))||((((((((tsidxtsid1.n7_1>=1)&&(tsidxtsid8.n7_8>=1))&&(tsidxtsid15.n7_15>=1))&&(tsidxtsid22.n7_22>=1))&&(tsidxtsid29.n7_29>=1))&&(tsidxtsid36.n7_36>=1))&&(tsidxtsid43.n7_43>=1))&&(tsid1.Cstart_1>=1)))||((((((((tsidxtsid3.n7_3>=1)&&(tsidxtsid10.n7_10>=1))&&(tsidxtsid17.n7_17>=1))&&(tsidxtsid24.n7_24>=1))&&(tsidxtsid31.n7_31>=1))&&(tsidxtsid38.n7_38>=1))&&(tsidxtsid45.n7_45>=1))&&(tsid3.Cstart_3>=1)))||((((((((tsidxtsid5.n7_5>=1)&&(tsidxtsid12.n7_12>=1))&&(tsidxtsid19.n7_19>=1))&&(tsidxtsid26.n7_26>=1))&&(tsidxtsid33.n7_33>=1))&&(tsidxtsid40.n7_40>=1))&&(tsidxtsid47.n7_47>=1))&&(tsid5.Cstart_5>=1)))||((((((((tsidxtsid4.n7_4>=1)&&(tsidxtsid11.n7_11>=1))&&(tsidxtsid18.n7_18>=1))&&(tsidxtsid25.n7_25>=1))&&(tsidxtsid32.n7_32>=1))&&(tsidxtsid39.n7_39>=1))&&(tsidxtsid46.n7_46>=1))&&(tsid4.Cstart_4>=1)))")))))||("((((((((tsid0.n4_0>=1)&&(tsid1.n4_1>=1))&&(tsid2.n4_2>=1))&&(tsid3.n4_3>=1))&&(tsid4.n4_4>=1))&&(tsid5.n4_5>=1))&&(tsid6.n4_6>=1))&&(a3.a3_0>=1))"))))
Formula 5 simplified : !(!F"((((((((((((((tsidxtsid0.n7_0>=1)&&(tsidxtsid7.n7_7>=1))&&(tsidxtsid14.n7_14>=1))&&(tsidxtsid21.n7_21>=1))&&(tsidxtsid28.n7_28>=1))&&(tsidxtsid35.n7_35>=1))&&(tsidxtsid42.n7_42>=1))&&(tsid0.Cstart_0>=1))||((((((((tsidxtsid6.n7_6>=1)&&(tsidxtsid13.n7_13>=1))&&(tsidxtsid20.n7_20>=1))&&(tsidxtsid27.n7_27>=1))&&(tsidxtsid34.n7_34>=1))&&(tsidxtsid41.n7_41>=1))&&(tsidxtsid48.n7_48>=1))&&(tsid6.Cstart_6>=1)))||((((((((tsidxtsid2.n7_2>=1)&&(tsidxtsid9.n7_9>=1))&&(tsidxtsid16.n7_16>=1))&&(tsidxtsid23.n7_23>=1))&&(tsidxtsid30.n7_30>=1))&&(tsidxtsid37.n7_37>=1))&&(tsidxtsid44.n7_44>=1))&&(tsid2.Cstart_2>=1)))||((((((((tsidxtsid1.n7_1>=1)&&(tsidxtsid8.n7_8>=1))&&(tsidxtsid15.n7_15>=1))&&(tsidxtsid22.n7_22>=1))&&(tsidxtsid29.n7_29>=1))&&(tsidxtsid36.n7_36>=1))&&(tsidxtsid43.n7_43>=1))&&(tsid1.Cstart_1>=1)))||((((((((tsidxtsid3.n7_3>=1)&&(tsidxtsid10.n7_10>=1))&&(tsidxtsid17.n7_17>=1))&&(tsidxtsid24.n7_24>=1))&&(tsidxtsid31.n7_31>=1))&&(tsidxtsid38.n7_38>=1))&&(tsidxtsid45.n7_45>=1))&&(tsid3.Cstart_3>=1)))||((((((((tsidxtsid5.n7_5>=1)&&(tsidxtsid12.n7_12>=1))&&(tsidxtsid19.n7_19>=1))&&(tsidxtsid26.n7_26>=1))&&(tsidxtsid33.n7_33>=1))&&(tsidxtsid40.n7_40>=1))&&(tsidxtsid47.n7_47>=1))&&(tsid5.Cstart_5>=1)))||((((((((tsidxtsid4.n7_4>=1)&&(tsidxtsid11.n7_11>=1))&&(tsidxtsid18.n7_18>=1))&&(tsidxtsid25.n7_25>=1))&&(tsidxtsid32.n7_32>=1))&&(tsidxtsid39.n7_39>=1))&&(tsidxtsid46.n7_46>=1))&&(tsid4.Cstart_4>=1)))" U ("((((((((tsid0.n4_0>=1)&&(tsid1.n4_1>=1))&&(tsid2.n4_2>=1))&&(tsid3.n4_3>=1))&&(tsid4.n4_4>=1))&&(tsid5.n4_5>=1))&&(tsid6.n4_6>=1))&&(a3.a3_0>=1))" | FGXG"((((((((((((((tsidxtsid0.n7_0>=1)&&(tsidxtsid7.n7_7>=1))&&(tsidxtsid14.n7_14>=1))&&(tsidxtsid21.n7_21>=1))&&(tsidxtsid28.n7_28>=1))&&(tsidxtsid35.n7_35>=1))&&(tsidxtsid42.n7_42>=1))&&(tsid0.Cstart_0>=1))||((((((((tsidxtsid6.n7_6>=1)&&(tsidxtsid13.n7_13>=1))&&(tsidxtsid20.n7_20>=1))&&(tsidxtsid27.n7_27>=1))&&(tsidxtsid34.n7_34>=1))&&(tsidxtsid41.n7_41>=1))&&(tsidxtsid48.n7_48>=1))&&(tsid6.Cstart_6>=1)))||((((((((tsidxtsid2.n7_2>=1)&&(tsidxtsid9.n7_9>=1))&&(tsidxtsid16.n7_16>=1))&&(tsidxtsid23.n7_23>=1))&&(tsidxtsid30.n7_30>=1))&&(tsidxtsid37.n7_37>=1))&&(tsidxtsid44.n7_44>=1))&&(tsid2.Cstart_2>=1)))||((((((((tsidxtsid1.n7_1>=1)&&(tsidxtsid8.n7_8>=1))&&(tsidxtsid15.n7_15>=1))&&(tsidxtsid22.n7_22>=1))&&(tsidxtsid29.n7_29>=1))&&(tsidxtsid36.n7_36>=1))&&(tsidxtsid43.n7_43>=1))&&(tsid1.Cstart_1>=1)))||((((((((tsidxtsid3.n7_3>=1)&&(tsidxtsid10.n7_10>=1))&&(tsidxtsid17.n7_17>=1))&&(tsidxtsid24.n7_24>=1))&&(tsidxtsid31.n7_31>=1))&&(tsidxtsid38.n7_38>=1))&&(tsidxtsid45.n7_45>=1))&&(tsid3.Cstart_3>=1)))||((((((((tsidxtsid5.n7_5>=1)&&(tsidxtsid12.n7_12>=1))&&(tsidxtsid19.n7_19>=1))&&(tsidxtsid26.n7_26>=1))&&(tsidxtsid33.n7_33>=1))&&(tsidxtsid40.n7_40>=1))&&(tsidxtsid47.n7_47>=1))&&(tsid5.Cstart_5>=1)))||((((((((tsidxtsid4.n7_4>=1)&&(tsidxtsid11.n7_11>=1))&&(tsidxtsid18.n7_18>=1))&&(tsidxtsid25.n7_25>=1))&&(tsidxtsid32.n7_32>=1))&&(tsidxtsid39.n7_39>=1))&&(tsidxtsid46.n7_46>=1))&&(tsid4.Cstart_4>=1)))"))
Computing Next relation with stutter on 4237 deadlock states
23 unique states visited
22 strongly connected components in search stack
24 transitions explored
23 items max in DFS search stack
25 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,222.568,3322528,1,0,9.24916e+06,5062,2398,5.86371e+06,297,22945,26832608
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X(X(G("((((((((tsid0.n5_0>=1)&&(tsid0.s3_0>=1))||((tsid4.n5_4>=1)&&(tsid4.s3_4>=1)))||((tsid1.n5_1>=1)&&(tsid1.s3_1>=1)))||((tsid3.n5_3>=1)&&(tsid3.s3_3>=1)))||((tsid5.n5_5>=1)&&(tsid5.s3_5>=1)))||((tsid2.n5_2>=1)&&(tsid2.s3_2>=1)))||((tsid6.n5_6>=1)&&(tsid6.s3_6>=1)))"))))||((!(G("((((((((tsid0.n5_0>=1)&&(tsid0.s3_0>=1))||((tsid4.n5_4>=1)&&(tsid4.s3_4>=1)))||((tsid1.n5_1>=1)&&(tsid1.s3_1>=1)))||((tsid3.n5_3>=1)&&(tsid3.s3_3>=1)))||((tsid5.n5_5>=1)&&(tsid5.s3_5>=1)))||((tsid2.n5_2>=1)&&(tsid2.s3_2>=1)))||((tsid6.n5_6>=1)&&(tsid6.s3_6>=1)))")))U(G((F("((((((((tsid0.n5_0>=1)&&(tsid0.s3_0>=1))||((tsid4.n5_4>=1)&&(tsid4.s3_4>=1)))||((tsid1.n5_1>=1)&&(tsid1.s3_1>=1)))||((tsid3.n5_3>=1)&&(tsid3.s3_3>=1)))||((tsid5.n5_5>=1)&&(tsid5.s3_5>=1)))||((tsid2.n5_2>=1)&&(tsid2.s3_2>=1)))||((tsid6.n5_6>=1)&&(tsid6.s3_6>=1)))"))&&("((((((((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid0.c1_0>=1))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid1.c1_1>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid2.c1_2>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid3.c1_3>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid4.c1_4>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid5.c1_5>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid6.c1_6>=1)))")))))))
Formula 6 simplified : !X(XXG"((((((((tsid0.n5_0>=1)&&(tsid0.s3_0>=1))||((tsid4.n5_4>=1)&&(tsid4.s3_4>=1)))||((tsid1.n5_1>=1)&&(tsid1.s3_1>=1)))||((tsid3.n5_3>=1)&&(tsid3.s3_3>=1)))||((tsid5.n5_5>=1)&&(tsid5.s3_5>=1)))||((tsid2.n5_2>=1)&&(tsid2.s3_2>=1)))||((tsid6.n5_6>=1)&&(tsid6.s3_6>=1)))" | (!G"((((((((tsid0.n5_0>=1)&&(tsid0.s3_0>=1))||((tsid4.n5_4>=1)&&(tsid4.s3_4>=1)))||((tsid1.n5_1>=1)&&(tsid1.s3_1>=1)))||((tsid3.n5_3>=1)&&(tsid3.s3_3>=1)))||((tsid5.n5_5>=1)&&(tsid5.s3_5>=1)))||((tsid2.n5_2>=1)&&(tsid2.s3_2>=1)))||((tsid6.n5_6>=1)&&(tsid6.s3_6>=1)))" U G("((((((((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid0.c1_0>=1))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid1.c1_1>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid2.c1_2>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid3.c1_3>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid4.c1_4>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid5.c1_5>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid6.c1_6>=1)))" & F"((((((((tsid0.n5_0>=1)&&(tsid0.s3_0>=1))||((tsid4.n5_4>=1)&&(tsid4.s3_4>=1)))||((tsid1.n5_1>=1)&&(tsid1.s3_1>=1)))||((tsid3.n5_3>=1)&&(tsid3.s3_3>=1)))||((tsid5.n5_5>=1)&&(tsid5.s3_5>=1)))||((tsid2.n5_2>=1)&&(tsid2.s3_2>=1)))||((tsid6.n5_6>=1)&&(tsid6.s3_6>=1)))")))
Computing Next relation with stutter on 4237 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
18 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,222.75,3322528,1,0,9.24916e+06,5062,2465,5.86371e+06,299,22945,26944783
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F("((((((((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid4.s4_4>=1))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid5.s4_5>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid6.s4_6>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid0.s4_0>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid1.s4_1>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid2.s4_2>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid3.s4_3>=1)))"))))
Formula 7 simplified : F"((((((((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid4.s4_4>=1))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid5.s4_5>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid6.s4_6>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid0.s4_0>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid1.s4_1>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid2.s4_2>=1)))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid3.s4_3>=1)))"
Computing Next relation with stutter on 4237 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
65 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,223.397,3322528,1,0,9.24916e+06,5062,2515,5.86371e+06,299,22945,27241855
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589853709247

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-158961390800730"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;