fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922814800769
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DoubleExponent-PT-004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15734.460 3600000.00 3695066.00 3342.30 ????TTFFFF???TT? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 67K 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 DoubleExponent-PT-004-00
FORMULA_NAME DoubleExponent-PT-004-01
FORMULA_NAME DoubleExponent-PT-004-02
FORMULA_NAME DoubleExponent-PT-004-03
FORMULA_NAME DoubleExponent-PT-004-04
FORMULA_NAME DoubleExponent-PT-004-05
FORMULA_NAME DoubleExponent-PT-004-06
FORMULA_NAME DoubleExponent-PT-004-07
FORMULA_NAME DoubleExponent-PT-004-08
FORMULA_NAME DoubleExponent-PT-004-09
FORMULA_NAME DoubleExponent-PT-004-10
FORMULA_NAME DoubleExponent-PT-004-11
FORMULA_NAME DoubleExponent-PT-004-12
FORMULA_NAME DoubleExponent-PT-004-13
FORMULA_NAME DoubleExponent-PT-004-14
FORMULA_NAME DoubleExponent-PT-004-15

=== Now, execution of the tool begins

BK_START 1590134651100

[2020-05-22 08:04:13] [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-22 08:04:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 08:04:13] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2020-05-22 08:04:13] [INFO ] Transformed 216 places.
[2020-05-22 08:04:13] [INFO ] Transformed 198 transitions.
[2020-05-22 08:04:13] [INFO ] Parsed PT model containing 216 places and 198 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3322 resets, run finished after 241 ms. (steps per millisecond=414 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0]
// Phase 1: matrix 198 rows 216 cols
[2020-05-22 08:04:13] [INFO ] Computed 24 place invariants in 14 ms
[2020-05-22 08:04:13] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2020-05-22 08:04:13] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-05-22 08:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:14] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-05-22 08:04:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-05-22 08:04:14] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-05-22 08:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:14] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2020-05-22 08:04:14] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 22 ms.
[2020-05-22 08:04:15] [INFO ] Added : 193 causal constraints over 40 iterations in 957 ms. Result :sat
[2020-05-22 08:04:15] [INFO ] Deduced a trap composed of 40 places in 207 ms
[2020-05-22 08:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2020-05-22 08:04:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-05-22 08:04:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:04:15] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2020-05-22 08:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:15] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-05-22 08:04:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-05-22 08:04:15] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-05-22 08:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:15] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-05-22 08:04:16] [INFO ] Deduced a trap composed of 78 places in 97 ms
[2020-05-22 08:04:16] [INFO ] Deduced a trap composed of 57 places in 66 ms
[2020-05-22 08:04:16] [INFO ] Deduced a trap composed of 41 places in 59 ms
[2020-05-22 08:04:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2020-05-22 08:04:16] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 15 ms.
[2020-05-22 08:04:17] [INFO ] Added : 191 causal constraints over 39 iterations in 850 ms. Result :sat
[2020-05-22 08:04:17] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2020-05-22 08:04:17] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2020-05-22 08:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:17] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2020-05-22 08:04:17] [INFO ] Deduced a trap composed of 79 places in 108 ms
[2020-05-22 08:04:17] [INFO ] Deduced a trap composed of 90 places in 93 ms
[2020-05-22 08:04:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2020-05-22 08:04:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-05-22 08:04:17] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-05-22 08:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:17] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2020-05-22 08:04:17] [INFO ] Deduced a trap composed of 79 places in 85 ms
[2020-05-22 08:04:18] [INFO ] Deduced a trap composed of 87 places in 89 ms
[2020-05-22 08:04:18] [INFO ] Deduced a trap composed of 83 places in 71 ms
[2020-05-22 08:04:18] [INFO ] Deduced a trap composed of 88 places in 59 ms
[2020-05-22 08:04:18] [INFO ] Deduced a trap composed of 85 places in 65 ms
[2020-05-22 08:04:18] [INFO ] Deduced a trap composed of 94 places in 56 ms
[2020-05-22 08:04:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 590 ms
[2020-05-22 08:04:18] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 19 ms.
[2020-05-22 08:04:19] [INFO ] Added : 160 causal constraints over 32 iterations in 512 ms. Result :sat
[2020-05-22 08:04:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-22 08:04:19] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-05-22 08:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:19] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2020-05-22 08:04:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:04:19] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 7 ms returned sat
[2020-05-22 08:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:19] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2020-05-22 08:04:19] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 17 ms.
[2020-05-22 08:04:20] [INFO ] Added : 195 causal constraints over 39 iterations in 1161 ms. Result :sat
[2020-05-22 08:04:20] [INFO ] Deduced a trap composed of 39 places in 89 ms
[2020-05-22 08:04:20] [INFO ] Deduced a trap composed of 29 places in 67 ms
[2020-05-22 08:04:20] [INFO ] Deduced a trap composed of 62 places in 64 ms
[2020-05-22 08:04:20] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2020-05-22 08:04:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 407 ms
[2020-05-22 08:04:21] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2020-05-22 08:04:21] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-05-22 08:04:21] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-05-22 08:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:21] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-05-22 08:04:21] [INFO ] Deduced a trap composed of 35 places in 85 ms
[2020-05-22 08:04:21] [INFO ] Deduced a trap composed of 36 places in 110 ms
[2020-05-22 08:04:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2020-05-22 08:04:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:04:21] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:21] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-05-22 08:04:21] [INFO ] Deduced a trap composed of 35 places in 33 ms
[2020-05-22 08:04:21] [INFO ] Deduced a trap composed of 36 places in 39 ms
[2020-05-22 08:04:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2020-05-22 08:04:21] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2020-05-22 08:04:22] [INFO ] Added : 195 causal constraints over 39 iterations in 529 ms. Result :sat
[2020-05-22 08:04:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-05-22 08:04:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-22 08:04:22] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-05-22 08:04:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:22] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-05-22 08:04:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:04:22] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-05-22 08:04:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:22] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2020-05-22 08:04:22] [INFO ] Deduced a trap composed of 94 places in 66 ms
[2020-05-22 08:04:22] [INFO ] Deduced a trap composed of 86 places in 62 ms
[2020-05-22 08:04:23] [INFO ] Deduced a trap composed of 49 places in 192 ms
[2020-05-22 08:04:23] [INFO ] Deduced a trap composed of 83 places in 255 ms
[2020-05-22 08:04:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2020-05-22 08:04:23] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 15 ms.
[2020-05-22 08:04:24] [INFO ] Added : 188 causal constraints over 38 iterations in 724 ms. Result :sat
[2020-05-22 08:04:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-22 08:04:24] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:24] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-05-22 08:04:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:04:24] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2020-05-22 08:04:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:24] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-05-22 08:04:24] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 8 ms.
[2020-05-22 08:04:25] [INFO ] Added : 192 causal constraints over 39 iterations in 592 ms. Result :sat
[2020-05-22 08:04:25] [INFO ] Deduced a trap composed of 35 places in 43 ms
[2020-05-22 08:04:25] [INFO ] Deduced a trap composed of 36 places in 54 ms
[2020-05-22 08:04:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2020-05-22 08:04:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-22 08:04:25] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 7 ms returned sat
[2020-05-22 08:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:25] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-05-22 08:04:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:04:25] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-05-22 08:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:25] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2020-05-22 08:04:25] [INFO ] Deduced a trap composed of 82 places in 50 ms
[2020-05-22 08:04:25] [INFO ] Deduced a trap composed of 77 places in 72 ms
[2020-05-22 08:04:25] [INFO ] Deduced a trap composed of 100 places in 94 ms
[2020-05-22 08:04:25] [INFO ] Deduced a trap composed of 100 places in 55 ms
[2020-05-22 08:04:25] [INFO ] Deduced a trap composed of 29 places in 85 ms
[2020-05-22 08:04:26] [INFO ] Deduced a trap composed of 109 places in 75 ms
[2020-05-22 08:04:26] [INFO ] Deduced a trap composed of 100 places in 50 ms
[2020-05-22 08:04:26] [INFO ] Deduced a trap composed of 109 places in 101 ms
[2020-05-22 08:04:26] [INFO ] Deduced a trap composed of 70 places in 54 ms
[2020-05-22 08:04:26] [INFO ] Deduced a trap composed of 81 places in 51 ms
[2020-05-22 08:04:26] [INFO ] Deduced a trap composed of 76 places in 104 ms
[2020-05-22 08:04:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 891 ms
[2020-05-22 08:04:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-22 08:04:26] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 2 ms returned unsat
[2020-05-22 08:04:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-05-22 08:04:26] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:04:26] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 20 ms returned sat
[2020-05-22 08:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:26] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-05-22 08:04:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:04:26] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 18 ms returned sat
[2020-05-22 08:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:26] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2020-05-22 08:04:27] [INFO ] Deduced a trap composed of 74 places in 64 ms
[2020-05-22 08:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2020-05-22 08:04:27] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2020-05-22 08:04:27] [INFO ] Added : 195 causal constraints over 39 iterations in 719 ms. Result :sat
[2020-05-22 08:04:27] [INFO ] Deduced a trap composed of 91 places in 81 ms
[2020-05-22 08:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2020-05-22 08:04:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-05-22 08:04:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-05-22 08:04:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:04:28] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-05-22 08:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:28] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2020-05-22 08:04:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:04:28] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-05-22 08:04:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:28] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-05-22 08:04:28] [INFO ] Deduced a trap composed of 64 places in 81 ms
[2020-05-22 08:04:28] [INFO ] Deduced a trap composed of 76 places in 108 ms
[2020-05-22 08:04:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2020-05-22 08:04:28] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 15 ms.
[2020-05-22 08:04:29] [INFO ] Added : 146 causal constraints over 30 iterations in 485 ms. Result :sat
[2020-05-22 08:04:29] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:04:29] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-05-22 08:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:29] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2020-05-22 08:04:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:04:29] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 20 ms returned sat
[2020-05-22 08:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:29] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-05-22 08:04:29] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2020-05-22 08:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2020-05-22 08:04:29] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2020-05-22 08:04:30] [INFO ] Added : 195 causal constraints over 39 iterations in 740 ms. Result :sat
[2020-05-22 08:04:30] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:04:30] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 20 ms returned sat
[2020-05-22 08:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:30] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-05-22 08:04:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:04:30] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:30] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-05-22 08:04:31] [INFO ] Deduced a trap composed of 63 places in 99 ms
[2020-05-22 08:04:31] [INFO ] Deduced a trap composed of 87 places in 82 ms
[2020-05-22 08:04:31] [INFO ] Deduced a trap composed of 66 places in 83 ms
[2020-05-22 08:04:31] [INFO ] Deduced a trap composed of 86 places in 76 ms
[2020-05-22 08:04:31] [INFO ] Deduced a trap composed of 100 places in 77 ms
[2020-05-22 08:04:31] [INFO ] Deduced a trap composed of 77 places in 67 ms
[2020-05-22 08:04:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 550 ms
[2020-05-22 08:04:31] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2020-05-22 08:04:32] [INFO ] Added : 191 causal constraints over 39 iterations in 810 ms. Result :sat
[2020-05-22 08:04:32] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:04:32] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 95 ms returned sat
[2020-05-22 08:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:32] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2020-05-22 08:04:32] [INFO ] Deduced a trap composed of 41 places in 68 ms
[2020-05-22 08:04:32] [INFO ] Deduced a trap composed of 67 places in 74 ms
[2020-05-22 08:04:32] [INFO ] Deduced a trap composed of 43 places in 62 ms
[2020-05-22 08:04:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2020-05-22 08:04:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:04:32] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-05-22 08:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:33] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2020-05-22 08:04:33] [INFO ] Deduced a trap composed of 41 places in 60 ms
[2020-05-22 08:04:33] [INFO ] Deduced a trap composed of 77 places in 59 ms
[2020-05-22 08:04:33] [INFO ] Deduced a trap composed of 43 places in 38 ms
[2020-05-22 08:04:33] [INFO ] Deduced a trap composed of 55 places in 30 ms
[2020-05-22 08:04:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 236 ms
[2020-05-22 08:04:33] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 8 ms.
[2020-05-22 08:04:34] [INFO ] Added : 190 causal constraints over 39 iterations in 748 ms. Result :sat
[2020-05-22 08:04:34] [INFO ] Deduced a trap composed of 47 places in 108 ms
[2020-05-22 08:04:34] [INFO ] Deduced a trap composed of 89 places in 82 ms
[2020-05-22 08:04:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2020-05-22 08:04:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:04:34] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2020-05-22 08:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:34] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2020-05-22 08:04:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-05-22 08:04:34] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-05-22 08:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:34] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-05-22 08:04:34] [INFO ] Deduced a trap composed of 55 places in 104 ms
[2020-05-22 08:04:35] [INFO ] Deduced a trap composed of 84 places in 85 ms
[2020-05-22 08:04:35] [INFO ] Deduced a trap composed of 74 places in 104 ms
[2020-05-22 08:04:35] [INFO ] Deduced a trap composed of 41 places in 87 ms
[2020-05-22 08:04:35] [INFO ] Deduced a trap composed of 48 places in 49 ms
[2020-05-22 08:04:35] [INFO ] Deduced a trap composed of 77 places in 103 ms
[2020-05-22 08:04:35] [INFO ] Deduced a trap composed of 71 places in 72 ms
[2020-05-22 08:04:35] [INFO ] Deduced a trap composed of 63 places in 101 ms
[2020-05-22 08:04:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 849 ms
[2020-05-22 08:04:35] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 15 ms.
[2020-05-22 08:04:36] [INFO ] Added : 193 causal constraints over 39 iterations in 874 ms. Result :sat
[2020-05-22 08:04:36] [INFO ] Deduced a trap composed of 89 places in 92 ms
[2020-05-22 08:04:36] [INFO ] Deduced a trap composed of 107 places in 85 ms
[2020-05-22 08:04:36] [INFO ] Deduced a trap composed of 108 places in 96 ms
[2020-05-22 08:04:37] [INFO ] Deduced a trap composed of 46 places in 82 ms
[2020-05-22 08:04:37] [INFO ] Deduced a trap composed of 58 places in 94 ms
[2020-05-22 08:04:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 586 ms
[2020-05-22 08:04:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:04:37] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-05-22 08:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:37] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-05-22 08:04:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-05-22 08:04:37] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 23 ms returned sat
[2020-05-22 08:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:37] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2020-05-22 08:04:37] [INFO ] Deduced a trap composed of 47 places in 69 ms
[2020-05-22 08:04:37] [INFO ] Deduced a trap composed of 86 places in 75 ms
[2020-05-22 08:04:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2020-05-22 08:04:37] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2020-05-22 08:04:38] [INFO ] Added : 156 causal constraints over 32 iterations in 584 ms. Result :sat
[2020-05-22 08:04:38] [INFO ] Deduced a trap composed of 39 places in 65 ms
[2020-05-22 08:04:38] [INFO ] Deduced a trap composed of 25 places in 52 ms
[2020-05-22 08:04:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2020-05-22 08:04:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-05-22 08:04:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:04:38] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-05-22 08:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:38] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-05-22 08:04:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:04:38] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-05-22 08:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:38] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-05-22 08:04:39] [INFO ] Deduced a trap composed of 73 places in 63 ms
[2020-05-22 08:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2020-05-22 08:04:39] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2020-05-22 08:04:39] [INFO ] Added : 138 causal constraints over 28 iterations in 361 ms. Result :sat
[2020-05-22 08:04:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-22 08:04:39] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-05-22 08:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:39] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-05-22 08:04:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:04:39] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2020-05-22 08:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:39] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-05-22 08:04:39] [INFO ] Deduced a trap composed of 65 places in 48 ms
[2020-05-22 08:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2020-05-22 08:04:39] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2020-05-22 08:04:40] [INFO ] Added : 151 causal constraints over 31 iterations in 474 ms. Result :sat
[2020-05-22 08:04:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-22 08:04:40] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:40] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-05-22 08:04:40] [INFO ] Deduced a trap composed of 54 places in 33 ms
[2020-05-22 08:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2020-05-22 08:04:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:04:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:04:40] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 20 ms returned sat
[2020-05-22 08:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:04:40] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2020-05-22 08:04:40] [INFO ] Deduced a trap composed of 54 places in 28 ms
[2020-05-22 08:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2020-05-22 08:04:40] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2020-05-22 08:04:41] [INFO ] Added : 195 causal constraints over 39 iterations in 534 ms. Result :sat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-05-22 08:04:41] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-22 08:04:41] [INFO ] Flatten gal took : 95 ms
FORMULA DoubleExponent-PT-004-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 08:04:41] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 08:04:41] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 08:04:41] [INFO ] Flatten gal took : 25 ms
[2020-05-22 08:04:41] [INFO ] Input system was already deterministic with 198 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/graph979084748486541111.txt, -o, /tmp/graph979084748486541111.bin, -w, /tmp/graph979084748486541111.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/graph979084748486541111.bin, -l, -1, -v, -w, /tmp/graph979084748486541111.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 08:04:42] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 198 rows 216 cols
[2020-05-22 08:04:42] [INFO ] Computed 24 place invariants in 13 ms
inv : p175 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 - p188 - p190 + p201 - p203 - p204 - p205 - p206 - p207 - p208 - p209 - p210 - p211 - p212 - p213 = 0
inv : p189 + p201 - p203 - p204 - p205 - p206 - p207 - p208 - p209 - p210 - p211 - p212 - p213 = 0
inv : -p173 + p215 - p216 = 0
inv : p100 + p101 + p102 + p103 + p105 + p106 + p107 - p22 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 - p83 - p95 + p97 + p98 + p99 = 0
inv : 2*p1 + p100 + p101 + p102 + p103 + p105 + p107 + p12 + p13 + 2*p2 - p22 - p24 + p26 + p27 + p28 + p29 + 2*p3 + p30 + p31 + p32 + p33 + p35 + p37 + p38 + p39 + p4 + p40 + p41 + p42 + p43 + p44 + p45 + p47 + p49 + p5 + p50 + 2*p51 + p52 + 2*p53 + p54 + p6 - p83 - p95 + p97 + p98 + p99 = 2
inv : -p102 + p151 - p19 - p20 + p55 - p57 + p58 - p60 + p62 + p81 + p88 + p91 + p93 = 0
inv : p1 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p123 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p149 + p15 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p158 + p16 + p160 + p167 + p168 + p169 + p17 + p170 + p171 + p172 + p173 + p174 + p176 + p177 + p178 + p179 + p18 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p19 + p190 + p2 + p20 - p201 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p21 + p211 + p213 + p22 + p23 + p24 + p25 + p3 + p4 + p5 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 = 1
inv : p109 - p110 + p112 - p113 + p117 + p129 + p132 + p134 + p146 - p155 + p206 - p67 = 0
inv : -p1 - p114 - p115 - p116 - p117 - p118 - 2*p119 - 2*p120 - p121 - p123 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p137 - p138 - p139 - p14 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p149 - p15 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p158 - p16 - p160 + p161 - p163 + p164 - p166 - p167 - p169 - p17 - p170 - p171 - p172 - p173 - p174 - p176 - p178 - p179 - p18 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p188 - p19 - p190 - p191 - p192 - p193 - p195 - p196 - p198 - p2 - p20 - p200 - p202 - p203 - p204 - p205 - p206 - p207 - 2*p208 - p209 - p21 - p211 - p213 - p22 - p23 - p24 - p25 - p3 - p4 - p5 - p6 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p7 - p70 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = -1
inv : p159 + p71 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = 0
inv : p104 + p22 - p26 - p27 - p28 - p29 - p30 - p31 - p32 - p33 - p34 - p35 - p36 - p37 = 0
inv : -p124 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 - p212 = 0
inv : p108 - p110 + p111 - p113 + p115 + p134 + p141 + p144 + p146 - p155 + p204 - p66 - p67 = 0
inv : -p102 + p153 - p20 + p56 - p57 + p59 - p60 + p64 + p76 + p79 + p81 + p93 = 0
inv : -p172 - p173 + p214 - p216 = 0
inv : p157 + p69 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 = 0
inv : p36 + p48 - p50 - p51 - p52 - p53 - p54 = 0
inv : 2*p1 + p10 + p100 + p11 + p17 + 2*p2 + p29 + p3 + p32 + p4 + p5 = 2
inv : p124 + p136 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p158 - p160 + p212 + p69 + p71 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = 0
inv : p122 + p124 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p158 - p160 + p210 + p212 + p69 + p71 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = 0
inv : p100 + p101 + p102 + p103 + p105 + p107 - p22 - p24 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p49 + p50 + p51 + p52 + p53 + p54 - p83 - p95 + p97 + p98 + p99 = 0
inv : 2*p1 + p15 + p2 + p3 + p4 + p41 + p44 + p8 + p9 + p98 = 2
inv : p1 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p123 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p149 + p15 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p158 + p16 + p160 + p167 + p168 + p169 + p17 + p170 + p171 + p172 + p173 + p174 + p176 + p178 + p179 + p18 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p19 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p2 + p20 + p200 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p21 + p211 + p213 + p22 + p23 + p24 + p25 + p3 + p4 + p5 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 = 1
inv : -p1 - p114 - p115 - p116 - p117 - p118 - p119 - 2*p120 - p121 - p123 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p137 - p138 - p139 - p14 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p149 - p15 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p158 - p16 - p160 + p162 - p163 + p165 - p166 - p167 - p168 - p169 - p17 - p171 - p172 - p173 - p174 - p176 - p178 - p179 - p18 - p180 - p181 - p183 - p184 - p186 - p188 - p19 - p190 - p191 - p192 - p193 - p194 - p195 - p196 - p197 - p198 - p2 - p20 - p200 - p202 - p203 - p204 - p205 - p206 - p207 - 2*p208 - p209 - p21 - p211 - p213 - p22 - p23 - p24 - p25 - p3 - p4 - p5 - p6 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p7 - p70 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = -1
Total of 24 invariants.
[2020-05-22 08:04:42] [INFO ] Computed 24 place invariants in 16 ms
[2020-05-22 08:04:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 08:04:42] [INFO ] Removed a total of 53 redundant transitions.
[2020-05-22 08:04:42] [INFO ] Flatten gal took : 73 ms
[2020-05-22 08:04:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2020-05-22 08:04:42] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-22 08:04:42] [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 8 LTL properties
Checking formula 0 : !((((F("(gu2.p198<=gu2.p106)"))&&("(gu82.p56<=gu82.p9)"))U(G("(gu82.p56<=gu82.p9)"))))
Formula 0 simplified : !(("(gu82.p56<=gu82.p9)" & F"(gu2.p198<=gu2.p106)") U G"(gu82.p56<=gu82.p9)")
[2020-05-22 08:04:42] [INFO ] Proved 216 variables to be positive in 641 ms
[2020-05-22 08:04:42] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2020-05-22 08:04:42] [INFO ] Computation of disable matrix completed :0/198 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:04:42] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:04:42] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2020-05-22 08:04:42] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:04:44] [INFO ] Computing symmetric co enabling matrix : 198 transitions.
[2020-05-22 08:04:45] [INFO ] Computation of co-enabling matrix(6/198) took 1537 ms. Total solver calls (SAT/UNSAT): 1124(6/1118)
[2020-05-22 08:04:50] [INFO ] Computation of co-enabling matrix(17/198) took 5978 ms. Total solver calls (SAT/UNSAT): 2725(13/2712)
[2020-05-22 08:04:53] [INFO ] Computation of co-enabling matrix(45/198) took 8997 ms. Total solver calls (SAT/UNSAT): 6249(27/6222)
[2020-05-22 08:04:56] [INFO ] Computation of co-enabling matrix(103/198) took 12019 ms. Total solver calls (SAT/UNSAT): 11156(35/11121)
[2020-05-22 08:04:59] [INFO ] Computation of co-enabling matrix(146/198) took 15028 ms. Total solver calls (SAT/UNSAT): 12858(933/11925)
[2020-05-22 08:05:00] [INFO ] Computation of Finished co-enabling matrix. took 16687 ms. Total solver calls (SAT/UNSAT): 13727(1041/12686)
[2020-05-22 08:05:00] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2020-05-22 08:05:01] [INFO ] Computation of Completed DNA matrix. took 91 ms. Total solver calls (SAT/UNSAT): 108(0/108)
[2020-05-22 08:05:01] [INFO ] Built C files in 19309ms 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 2025 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 72 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (( <>((LTLAP0==true)) ) && ( (LTLAP1==true) ))U([]((LTLAP1==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, -p, --pins-guards, --when, --ltl, (( <>((LTLAP0==true)) ) && ( (LTLAP1==true) ))U([]((LTLAP1==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, -p, --pins-guards, --when, --ltl, (( <>((LTLAP0==true)) ) && ( (LTLAP1==true) ))U([]((LTLAP1==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)
Detected timeout of ITS tools.
[2020-05-22 08:24:51] [INFO ] Flatten gal took : 31 ms
[2020-05-22 08:24:51] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-22 08:24:51] [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 8 LTL properties
Checking formula 0 : !((((F("(p198<=p106)"))&&("(p56<=p9)"))U(G("(p56<=p9)"))))
Formula 0 simplified : !(("(p56<=p9)" & F"(p198<=p106)") U G"(p56<=p9)")
Detected timeout of ITS tools.
[2020-05-22 08:45:00] [INFO ] Flatten gal took : 22 ms
[2020-05-22 08:45:00] [INFO ] Input system was already deterministic with 198 transitions.
[2020-05-22 08:45:00] [INFO ] Transformed 216 places.
[2020-05-22 08:45:00] [INFO ] Transformed 198 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-22 08:45:00] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-22 08:45:00] [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, --load-order, /home/mcc/execution/model.ord, --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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 8 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((F("(p198<=p106)"))&&("(p56<=p9)"))U(G("(p56<=p9)"))))
Formula 0 simplified : !(("(p56<=p9)" & F"(p198<=p106)") U G"(p56<=p9)")

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DoubleExponent-PT-004"
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 DoubleExponent-PT-004, 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 r066-tajo-158922814800769"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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