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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.8K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.5K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 55K 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-PT-02-00
FORMULA_NAME QuasiCertifProtocol-PT-02-01
FORMULA_NAME QuasiCertifProtocol-PT-02-02
FORMULA_NAME QuasiCertifProtocol-PT-02-03
FORMULA_NAME QuasiCertifProtocol-PT-02-04
FORMULA_NAME QuasiCertifProtocol-PT-02-05
FORMULA_NAME QuasiCertifProtocol-PT-02-06
FORMULA_NAME QuasiCertifProtocol-PT-02-07
FORMULA_NAME QuasiCertifProtocol-PT-02-08
FORMULA_NAME QuasiCertifProtocol-PT-02-09
FORMULA_NAME QuasiCertifProtocol-PT-02-10
FORMULA_NAME QuasiCertifProtocol-PT-02-11
FORMULA_NAME QuasiCertifProtocol-PT-02-12
FORMULA_NAME QuasiCertifProtocol-PT-02-13
FORMULA_NAME QuasiCertifProtocol-PT-02-14
FORMULA_NAME QuasiCertifProtocol-PT-02-15

=== Now, execution of the tool begins

BK_START 1589857589361

[2020-05-19 03:06:31] [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 03:06:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 03:06:31] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-05-19 03:06:31] [INFO ] Transformed 86 places.
[2020-05-19 03:06:31] [INFO ] Transformed 56 transitions.
[2020-05-19 03:06:31] [INFO ] Parsed PT model containing 86 places and 56 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 16414 resets, run finished after 223 ms. (steps per millisecond=448 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 03:06:31] [INFO ] Computed 31 place invariants in 5 ms
[2020-05-19 03:06:31] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned unsat
[2020-05-19 03:06:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-05-19 03:06:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-19 03:06:31] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:31] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-19 03:06:31] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-05-19 03:06:31] [INFO ] Added : 29 causal constraints over 6 iterations in 82 ms. Result :sat
[2020-05-19 03:06:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:31] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2020-05-19 03:06:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:31] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-05-19 03:06:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:06:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:06:31] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 10 ms returned sat
[2020-05-19 03:06:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-05-19 03:06:32] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 14 ms.
[2020-05-19 03:06:32] [INFO ] Added : 18 causal constraints over 4 iterations in 101 ms. Result :sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 28 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-19 03:06:32] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 6 ms.
[2020-05-19 03:06:32] [INFO ] Added : 29 causal constraints over 6 iterations in 45 ms. Result :sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-19 03:06:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-05-19 03:06:32] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:06:32] [INFO ] Added : 18 causal constraints over 4 iterations in 24 ms. Result :sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-05-19 03:06:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using state equation in 22 ms returned unsat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-19 03:06:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-05-19 03:06:32] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 7 ms.
[2020-05-19 03:06:32] [INFO ] Added : 22 causal constraints over 5 iterations in 30 ms. Result :sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:06:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-05-19 03:06:32] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:06:32] [INFO ] Added : 29 causal constraints over 6 iterations in 33 ms. Result :sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:32] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-19 03:06:33] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:33] [INFO ] Added : 17 causal constraints over 4 iterations in 23 ms. Result :sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-05-19 03:06:33] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:33] [INFO ] Added : 23 causal constraints over 5 iterations in 24 ms. Result :sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-19 03:06:33] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 2 ms.
[2020-05-19 03:06:33] [INFO ] Added : 10 causal constraints over 2 iterations in 13 ms. Result :sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-19 03:06:33] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 2 ms.
[2020-05-19 03:06:33] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:33] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 20 simplifications.
[2020-05-19 03:06:33] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-19 03:06:33] [INFO ] Flatten gal took : 27 ms
FORMULA QuasiCertifProtocol-PT-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 03:06:33] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 03:06:33] [INFO ] Applying decomposition
[2020-05-19 03:06:33] [INFO ] Flatten gal took : 14 ms
[2020-05-19 03:06:33] [INFO ] Input system was already deterministic with 56 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/graph5331058600360556237.txt, -o, /tmp/graph5331058600360556237.bin, -w, /tmp/graph5331058600360556237.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/graph5331058600360556237.bin, -l, -1, -v, -w, /tmp/graph5331058600360556237.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 03:06:33] [INFO ] Computed 31 place invariants in 3 ms
inv : malicious_reservoir + CstopAbort + SstopAbort = 1
inv : n9_2_1 + CstopOK_1 - SstopOK_2 = 0
inv : n9_0_2 + CstopOK_2 - SstopOK_0 = 0
inv : n7_0_2 - n7_0_1 - n8_1_1 + n8_1_2 = 0
inv : n9_1_0 + CstopOK_0 - SstopOK_1 = 0
inv : n9_1_2 + CstopOK_2 - SstopOK_1 = 0
inv : n8_0_2 + n8_1_1 - n8_0_1 - n8_1_2 = 0
inv : s6_0 + s6_1 + s6_2 + SstopAbort + s5_0 + s5_1 + s5_2 + s4_0 + s4_2 + s4_1 + s3_1 + s3_0 + s2_0 + s3_2 + s2_2 + s2_1 + Sstart_1 + Sstart_0 + Sstart_2 + SstopOK_1 + SstopOK_0 + SstopOK_2 = 3
inv : c1_0 + c1_1 + c1_2 + CstopAbort + CstopOK_0 + CstopOK_1 + CstopOK_2 - n8_0_0 + 3*Cstart_2 - 2*n8_1_1 + n8_0_1 + 2*n8_1_2 = 3
inv : n9_2_2 + CstopOK_2 - SstopOK_2 = 0
inv : n7_2_0 - n7_2_2 + n8_0_0 + n8_1_1 - n8_0_1 - n8_1_2 = 0
inv : n8_2_0 - n8_0_0 - n8_1_1 + n8_0_1 + n8_1_2 - n8_2_2 = 0
inv : n4_1 - n3_0 + n3_1 - n4_0 = 0
inv : n9_0_1 + CstopOK_1 - SstopOK_0 = 0
inv : n9_0_0 + CstopOK_0 - SstopOK_0 = 0
inv : Cstart_0 + n8_0_0 - Cstart_2 + n8_1_1 - n8_0_1 - n8_1_2 = 0
inv : n8_2_1 - n8_1_1 + n8_1_2 - n8_2_2 = 0
inv : n7_1_1 - n7_1_2 + n8_1_1 - n8_1_2 = 0
inv : n9_2_0 + CstopOK_0 - SstopOK_2 = 0
inv : -n5_1 + n5_2 + n6_2 - n6_1 = 0
inv : n8_1_0 - n8_0_0 - n8_1_1 + n8_0_1 = 0
inv : -n1_2 + n2_0 - n2_2 + n1_0 = 0
inv : n7_2_1 - n7_2_2 + n8_1_1 - n8_1_2 = 0
inv : Cstart_1 - Cstart_2 + n8_1_1 - n8_1_2 = 0
inv : n7_1_0 - n7_1_2 + n8_0_0 + n8_1_1 - n8_0_1 - n8_1_2 = 0
inv : n5_0 - n5_1 + n6_0 - n6_1 = 0
inv : -n1_2 + n2_1 - n2_2 + n1_1 = 0
inv : n4_2 - n3_0 + n3_2 - n4_0 = 0
inv : a5 + a3 + AstopAbort + a2 + a4 + a1 + AstopOK + Astart = 1
inv : n9_1_1 + CstopOK_1 - SstopOK_1 = 0
inv : n7_0_0 - n7_0_1 + n8_0_0 - n8_0_1 = 0
Total of 31 invariants.
[2020-05-19 03:06:33] [INFO ] Computed 31 place invariants in 7 ms
[2020-05-19 03:06:33] [INFO ] Decomposing Gal with order
[2020-05-19 03:06:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 03:06:33] [INFO ] Removed a total of 23 redundant transitions.
[2020-05-19 03:06:33] [INFO ] Flatten gal took : 47 ms
[2020-05-19 03:06:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 14 ms.
[2020-05-19 03:06:33] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-19 03:06:33] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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 12 LTL properties
Checking formula 0 : !((G(X(G("(gu4.AstopAbort<=((gu4.Sstart_1+gu4.Sstart_0)+gu4.Sstart_2))")))))
Formula 0 simplified : !GXG"(gu4.AstopAbort<=((gu4.Sstart_1+gu4.Sstart_0)+gu4.Sstart_2))"
[2020-05-19 03:06:34] [INFO ] Proved 86 variables to be positive in 349 ms
[2020-05-19 03:06:34] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2020-05-19 03:06:34] [INFO ] Computation of disable matrix completed :0/56 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 03:06:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 03:06:34] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2020-05-19 03:06:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions gu4.malA3, gu4.malA1, gu4.malA4, gi0.gu1.malS5_0, gi0.gu1.malS4_2, gi0.gu1.malS4_1, gi0.gu1.malS5_1, gi0.gu1.malS5_2, gi0.gu1.malS2_2, gi0.gu1.malS2_0, gi0.gu1.malS2_1, gi0.malS4_0, malS6_0, malC1_0, malC1_2, malC1_1, malS3_1, malS3_2, malS3_0, malA5, malS1_1, malS1_2, malS1_0, malA2, 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
43 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.473169,36768,1,0,267,86662,137,173,2416,82933,342
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(X(F(G(F("(((gi6.gu3.s3_1+gi6.gu3.s3_0)+gi6.gu3.s3_2)>=2)"))))))))
Formula 1 simplified : !FGXFGF"(((gi6.gu3.s3_1+gi6.gu3.s3_0)+gi6.gu3.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
4 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.520146,38780,1,0,366,90641,146,315,2423,95952,684
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X("(((gu6.CstopOK_0+gu6.CstopOK_1)+gu6.CstopOK_2)<3)"))||(X((F(!(F("(((gi4.gu0.c1_0+gi4.gu0.c1_1)+gi4.gu0.c1_2)<=((gi4.gu0.s6_0+gi4.gu0.s6_1)+gi4.gu0.s6_2))"))))&&("(((gu6.CstopOK_0+gu6.CstopOK_1)+gu6.CstopOK_2)>=3)")))))
Formula 2 simplified : !(X"(((gu6.CstopOK_0+gu6.CstopOK_1)+gu6.CstopOK_2)<3)" | X("(((gu6.CstopOK_0+gu6.CstopOK_1)+gu6.CstopOK_2)>=3)" & F!F"(((gi4.gu0.c1_0+gi4.gu0.c1_1)+gi4.gu0.c1_2)<=((gi4.gu0.s6_0+gi4.gu0.s6_1)+gi4.gu0.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
1 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.521901,39128,1,0,366,90641,154,315,2433,95954,688
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(!(X(!(G((X("(gi4.gu0.a5<=((gi4.gu0.c1_0+gi4.gu0.c1_1)+gi4.gu0.c1_2))"))&&("(gi0.gu1.SstopAbort>=1)")))))))))
Formula 3 simplified : !XX!X!G("(gi0.gu1.SstopAbort>=1)" & X"(gi4.gu0.a5<=((gi4.gu0.c1_0+gi4.gu0.c1_1)+gi4.gu0.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
1 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.534734,39916,1,0,396,91785,169,354,2448,98858,792
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F("(((gi4.gu8.n2_0+gi4.gu8.n2_1)+gi4.gu8.n2_2)<=((gi4.gu0.c1_0+gi4.gu0.c1_1)+gi4.gu0.c1_2))"))))
Formula 4 simplified : !XF"(((gi4.gu8.n2_0+gi4.gu8.n2_1)+gi4.gu8.n2_2)<=((gi4.gu0.c1_0+gi4.gu0.c1_1)+gi4.gu0.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.535414,39916,1,0,396,91785,178,354,2452,98858,796
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(F("(gi0.gu1.malicious_reservoir>=1)")))))
Formula 5 simplified : !FXF"(gi0.gu1.malicious_reservoir>=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
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.540902,39916,1,0,411,92306,187,371,2453,100145,847
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G(F("(gu7.Cstart_0>gu7.n1_2)")))))
Formula 6 simplified : !FGF"(gu7.Cstart_0>gu7.n1_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
1 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.555735,40692,1,0,438,93883,196,406,2459,102783,969
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G(X(G("(gi6.gu3.s3_2<=gi6.gu3.Astart)"))))))
Formula 7 simplified : !FGXG"(gi6.gu3.s3_2<=gi6.gu3.Astart)"
Computing Next relation with stutter on 47 deadlock states
34 unique states visited
33 strongly connected components in search stack
36 transitions explored
34 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.557495,40924,1,0,439,93923,199,407,2464,102880,981
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G(!((G("(gi0.gu1.a2>gi0.gu1.SstopAbort)"))U("(gi0.gu1.a2<=gi0.gu1.SstopAbort)"))))))
Formula 8 simplified : !FG!(G"(gi0.gu1.a2>gi0.gu1.SstopAbort)" U "(gi0.gu1.a2<=gi0.gu1.SstopAbort)")
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.603434,41448,1,0,536,96126,212,533,2468,110513,1364
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F((G(F(X(G("(gi4.gu0.c1_2<=gu4.AstopAbort)")))))&&("(gi4.gu0.c1_2<=gu4.AstopAbort)")))))
Formula 9 simplified : !XF("(gi4.gu0.c1_2<=gu4.AstopAbort)" & GFXG"(gi4.gu0.c1_2<=gu4.AstopAbort)")
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
12 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.723235,46564,1,0,746,114212,225,773,2473,155749,1876
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F(X("(gu5.n9_0_0<=gu5.Cstart_2)")))))
Formula 10 simplified : FX"(gu5.n9_0_0<=gu5.Cstart_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.724524,46824,1,0,746,114212,231,773,2477,155751,1882
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(X("(gi6.gu14.n6_2<1)")))||(G(X("(gu4.a4<1)")))))
Formula 11 simplified : !(FX"(gi6.gu14.n6_2<1)" | GX"(gu4.a4<1)")
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.72542,46824,1,0,746,114212,243,773,2483,155751,1887
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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 03:06:34] [INFO ] Built C files in 1169ms 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 1589857594998

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

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-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 ;