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-158961390800721.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390800721
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 34K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-02-00
FORMULA_NAME QuasiCertifProtocol-COL-02-01
FORMULA_NAME QuasiCertifProtocol-COL-02-02
FORMULA_NAME QuasiCertifProtocol-COL-02-03
FORMULA_NAME QuasiCertifProtocol-COL-02-04
FORMULA_NAME QuasiCertifProtocol-COL-02-05
FORMULA_NAME QuasiCertifProtocol-COL-02-06
FORMULA_NAME QuasiCertifProtocol-COL-02-07
FORMULA_NAME QuasiCertifProtocol-COL-02-08
FORMULA_NAME QuasiCertifProtocol-COL-02-09
FORMULA_NAME QuasiCertifProtocol-COL-02-10
FORMULA_NAME QuasiCertifProtocol-COL-02-11
FORMULA_NAME QuasiCertifProtocol-COL-02-12
FORMULA_NAME QuasiCertifProtocol-COL-02-13
FORMULA_NAME QuasiCertifProtocol-COL-02-14
FORMULA_NAME QuasiCertifProtocol-COL-02-15

=== Now, execution of the tool begins

BK_START 1589852186491

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

[2020-05-19 01:36:28] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 30 ms.
[2020-05-19 01:36:28] [INFO ] Computed order based on color domains.
[2020-05-19 01:36:28] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions in 6 ms.
[2020-05-19 01:36:28] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 16412 resets, run finished after 279 ms. (steps per millisecond=358 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 01:36:29] [INFO ] Computed 31 place invariants in 6 ms
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned unsat
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2020-05-19 01:36:29] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 13 ms.
[2020-05-19 01:36:29] [INFO ] Added : 28 causal constraints over 6 iterations in 84 ms. Result :sat
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 7 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-19 01:36:29] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 9 ms.
[2020-05-19 01:36:29] [INFO ] Added : 27 causal constraints over 6 iterations in 49 ms. Result :sat
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-19 01:36:29] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-05-19 01:36:29] [INFO ] Added : 28 causal constraints over 6 iterations in 44 ms. Result :sat
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:29] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-05-19 01:36:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:36:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-05-19 01:36:30] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-05-19 01:36:30] [INFO ] Added : 28 causal constraints over 6 iterations in 45 ms. Result :sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-05-19 01:36:30] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 8 ms.
[2020-05-19 01:36:30] [INFO ] Added : 12 causal constraints over 3 iterations in 31 ms. Result :sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-19 01:36:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:36:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-05-19 01:36:30] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:30] [INFO ] Added : 27 causal constraints over 6 iterations in 30 ms. Result :sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-19 01:36:30] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:30] [INFO ] Added : 17 causal constraints over 4 iterations in 27 ms. Result :sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-19 01:36:30] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:30] [INFO ] Added : 27 causal constraints over 6 iterations in 32 ms. Result :sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-19 01:36:30] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:30] [INFO ] Added : 20 causal constraints over 4 iterations in 26 ms. Result :sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-19 01:36:30] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:30] [INFO ] Added : 20 causal constraints over 4 iterations in 21 ms. Result :sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-19 01:36:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:36:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:30] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-05-19 01:36:31] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:31] [INFO ] Added : 28 causal constraints over 6 iterations in 54 ms. Result :sat
Successfully simplified 12 atomic propositions for a total of 17 simplifications.
[2020-05-19 01:36:31] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-19 01:36:31] [INFO ] Flatten gal took : 35 ms
FORMULA QuasiCertifProtocol-COL-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 01:36:31] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 01:36:31] [INFO ] Applying decomposition
[2020-05-19 01:36:31] [INFO ] Flatten gal took : 14 ms
[2020-05-19 01:36:31] [INFO ] Input system was already deterministic with 56 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 01:36:31] [INFO ] Computed 31 place invariants in 3 ms
inv : n7_7 - n7_8 - Cstart_1 + Cstart_2 = 0
inv : SstopAbort_0 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_0 + SstopOK_1 + SstopOK_2 = 3
inv : CstopAbort_0 + c1_0 + c1_1 + c1_2 + Cstart_0 + Cstart_1 + Cstart_2 + CstopOK_0 + CstopOK_1 + CstopOK_2 = 3
inv : n4_1 - n4_2 + n3_1 - n3_2 = 0
inv : n8_1 - n8_2 + Cstart_1 - Cstart_2 = 0
inv : n6_1 - n6_2 + n5_1 - n5_2 = 0
inv : n7_0 - n7_2 - Cstart_0 + Cstart_2 = 0
inv : n8_3 - n8_5 + Cstart_0 - Cstart_2 = 0
inv : n7_6 - n7_8 - Cstart_0 + Cstart_2 = 0
inv : n9_3 - SstopOK_1 + CstopOK_0 = 0
inv : AstopAbort_0 + a5_0 + a4_0 + a3_0 + a2_0 + a1_0 + Astart_0 + AstopOK_0 = 1
inv : n9_6 - SstopOK_2 + CstopOK_0 = 0
inv : n8_0 - n8_2 + Cstart_0 - Cstart_2 = 0
inv : n7_1 - n7_2 - Cstart_1 + Cstart_2 = 0
inv : n6_0 - n6_2 + n5_0 - n5_2 = 0
inv : malicious_reservoir_0 + CstopAbort_0 + SstopAbort_0 = 1
inv : n9_5 - SstopOK_1 + CstopOK_2 = 0
inv : n9_8 - SstopOK_2 + CstopOK_2 = 0
inv : n8_4 - n8_5 + Cstart_1 - Cstart_2 = 0
inv : n9_7 - SstopOK_2 + CstopOK_1 = 0
inv : n9_4 - SstopOK_1 + CstopOK_1 = 0
inv : SstopAbort_0 + n9_2 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_1 + SstopOK_2 + CstopOK_2 = 3
inv : n7_3 - n7_5 - Cstart_0 + Cstart_2 = 0
inv : n2_1 - n2_2 + n1_1 - n1_2 = 0
inv : n8_7 - n8_8 + Cstart_1 - Cstart_2 = 0
inv : n2_0 - n2_2 + n1_0 - n1_2 = 0
inv : SstopAbort_0 + n9_0 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_1 + SstopOK_2 + CstopOK_0 = 3
inv : n7_4 - n7_5 - Cstart_1 + Cstart_2 = 0
inv : n4_0 - n4_2 + n3_0 - n3_2 = 0
inv : SstopAbort_0 + n9_1 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_1 + SstopOK_2 + CstopOK_1 = 3
inv : n8_6 - n8_8 + Cstart_0 - Cstart_2 = 0
Total of 31 invariants.
[2020-05-19 01:36:31] [INFO ] Computed 31 place invariants in 5 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/graph7399294085911374583.txt, -o, /tmp/graph7399294085911374583.bin, -w, /tmp/graph7399294085911374583.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/graph7399294085911374583.bin, -l, -1, -v, -w, /tmp/graph7399294085911374583.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 01:36:31] [INFO ] Decomposing Gal with order
[2020-05-19 01:36:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 01:36:31] [INFO ] Removed a total of 23 redundant transitions.
[2020-05-19 01:36:31] [INFO ] Flatten gal took : 66 ms
[2020-05-19 01:36:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2020-05-19 01:36:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-19 01:36:31] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], 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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !((G(X(G("(gi5.gu8.AstopAbort_0<=((gi5.gu8.Sstart_0+gi5.gu8.Sstart_1)+gi5.gu8.Sstart_2))")))))
Formula 0 simplified : !GXG"(gi5.gu8.AstopAbort_0<=((gi5.gu8.Sstart_0+gi5.gu8.Sstart_1)+gi5.gu8.Sstart_2))"
[2020-05-19 01:36:31] [INFO ] Proved 86 variables to be positive in 264 ms
[2020-05-19 01:36:31] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2020-05-19 01:36:31] [INFO ] Computation of disable matrix completed :0/56 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:36:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:36:31] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2020-05-19 01:36:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions gi0.gu0.malS5i0, gi0.gu0.malS5i1, gi0.gu0.malS5i2, gi0.gu0.malS2i0, gi0.gu0.malS2i1, gi0.gu0.malS2i2, gi0.malS4i2, gi0.malS4i1, gi0.malS4i0, gi5.gu8.malA3, gi5.gu8.malA4, gi5.gu8.malA2, gi5.gu8.malA1, malC1i0, malC1i1, malC1i2, malS6i0, malS3i0, malS3i1, malS3i2, malS1i0, malS1i1, malS1i2, malA5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/24/54
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
53 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,0.557303,37028,1,0,267,87232,137,173,2395,90609,342
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(X(F(G(F("(((gu9.s3_0+gu9.s3_1)+gu9.s3_2)>=2)"))))))))
Formula 1 simplified : !FGXFGF"(((gu9.s3_0+gu9.s3_1)+gu9.s3_2)>=2)"
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 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,0.735024,40888,1,0,366,101095,146,315,2402,118625,684
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X("(((gu13.CstopOK_0+gu13.CstopOK_1)+gu13.CstopOK_2)<3)"))||(X((F(!(F("(((gi3.gu6.c1_0+gi3.gu6.c1_1)+gi3.gu6.c1_2)<=((gi3.gu6.s6_0+gi3.gu6.s6_1)+gi3.gu6.s6_2))"))))&&("(((gu13.CstopOK_0+gu13.CstopOK_1)+gu13.CstopOK_2)>=3)")))))
Formula 2 simplified : !(X"(((gu13.CstopOK_0+gu13.CstopOK_1)+gu13.CstopOK_2)<3)" | X("(((gu13.CstopOK_0+gu13.CstopOK_1)+gu13.CstopOK_2)>=3)" & F!F"(((gi3.gu6.c1_0+gi3.gu6.c1_1)+gi3.gu6.c1_2)<=((gi3.gu6.s6_0+gi3.gu6.s6_1)+gi3.gu6.s6_2))"))
Computing Next relation with stutter on 47 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,0.737128,41500,1,0,366,101095,154,315,2412,118626,688
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(!(X(!(G((X("(gi3.gu6.a5_0<=((gi3.gu6.c1_0+gi3.gu6.c1_1)+gi3.gu6.c1_2))"))&&("(gi0.gu0.SstopAbort_0>=1)")))))))))
Formula 3 simplified : !XX!X!G("(gi0.gu0.SstopAbort_0>=1)" & X"(gi3.gu6.a5_0<=((gi3.gu6.c1_0+gi3.gu6.c1_1)+gi3.gu6.c1_2))")
Computing Next relation with stutter on 47 deadlock states
13 unique states visited
6 strongly connected components in search stack
14 transitions explored
11 items max in DFS search stack
3 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,0.770035,42288,1,0,396,104025,169,354,2429,127573,792
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F("(((gi3.gu4.n2_0+gi3.gu4.n2_1)+gi3.gu4.n2_2)<=((gi3.gu6.c1_0+gi3.gu6.c1_1)+gi3.gu6.c1_2))"))))
Formula 4 simplified : !XF"(((gi3.gu4.n2_0+gi3.gu4.n2_1)+gi3.gu4.n2_2)<=((gi3.gu6.c1_0+gi3.gu6.c1_1)+gi3.gu6.c1_2))"
Computing Next relation with stutter on 47 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,0.770797,42288,1,0,396,104025,178,354,2436,127573,796
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(F("(gi0.gu0.malicious_reservoir_0>=1)")))))
Formula 5 simplified : !FXF"(gi0.gu0.malicious_reservoir_0>=1)"
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 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,0.802685,42552,1,0,411,105019,187,371,2437,129964,847
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G(X(!(G((("(((gi3.gu4.n2_0+gi3.gu4.n2_1)+gi3.gu4.n2_2)>=3)")U("(gu5.Astart_0>=1)"))&&(X((!(X("(gi0.gu0.SstopAbort_0<=((gi0.gu0.n6_0+gi0.gu0.n6_1)+gi0.gu0.n6_2))")))&&("(gi0.gu0.SstopAbort_0>((gi0.gu0.n6_0+gi0.gu0.n6_1)+gi0.gu0.n6_2))"))))))))))
Formula 6 simplified : GX!G(("(((gi3.gu4.n2_0+gi3.gu4.n2_1)+gi3.gu4.n2_2)>=3)" U "(gu5.Astart_0>=1)") & X("(gi0.gu0.SstopAbort_0>((gi0.gu0.n6_0+gi0.gu0.n6_1)+gi0.gu0.n6_2))" & !X"(gi0.gu0.SstopAbort_0<=((gi0.gu0.n6_0+gi0.gu0.n6_1)+gi0.gu0.n6_2))"))
Computing Next relation with stutter on 47 deadlock states
29 unique states visited
29 strongly connected components in search stack
29 transitions explored
29 items max in DFS search stack
5 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,0.857254,45744,1,0,451,108587,203,462,2457,140136,1204
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F(G(X("(((gu7.Cstart_0+gu7.Cstart_1)+gu7.Cstart_2)<=((gu7.n5_0+gu7.n5_1)+gu7.n5_2))"))))))
Formula 7 simplified : FGX"(((gu7.Cstart_0+gu7.Cstart_1)+gu7.Cstart_2)<=((gu7.n5_0+gu7.n5_1)+gu7.n5_2))"
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 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,0.858838,46008,1,0,452,108587,212,464,2471,140139,1217
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X("(((gu5.n1_0+gu5.n1_1)+gu5.n1_2)>=2)"))))
Formula 8 simplified : X"(((gu5.n1_0+gu5.n1_1)+gu5.n1_2)>=2)"
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.860786,46008,1,0,453,108636,215,465,2477,140202,1225
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-19 01:36:32] [INFO ] Computing symmetric co enabling matrix : 56 transitions.
SMT solver raised 'unknown', retrying with same input.
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.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:492)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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:36:32] [INFO ] Built C files in 1275ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589852193276

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-02, examination is LTLCardinality"
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-158961390800721"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;