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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.670 18873.00 34784.00 53.20 FFTFFFFFFFFTTFTF 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-158922814800756.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-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800756
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.4K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 2.8K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 33K 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-002-CTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590133959936

[2020-05-22 07:52:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 07:52:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:52:41] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-05-22 07:52:41] [INFO ] Transformed 110 places.
[2020-05-22 07:52:41] [INFO ] Transformed 98 transitions.
[2020-05-22 07:52:41] [INFO ] Parsed PT model containing 110 places and 98 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Incomplete random walk after 100000 steps, including 3338 resets, run finished after 192 ms. (steps per millisecond=520 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 98 rows 110 cols
[2020-05-22 07:52:41] [INFO ] Computed 14 place invariants in 7 ms
[2020-05-22 07:52:41] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-05-22 07:52:41] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:41] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 33 places in 64 ms
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 45 places in 44 ms
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 70 places in 47 ms
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 44 places in 42 ms
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 30 places in 21 ms
[2020-05-22 07:52:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 274 ms
[2020-05-22 07:52:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-05-22 07:52:42] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:42] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 45 places in 37 ms
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 70 places in 28 ms
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 44 places in 28 ms
[2020-05-22 07:52:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 118 ms
[2020-05-22 07:52:42] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 9 ms.
[2020-05-22 07:52:42] [INFO ] Added : 95 causal constraints over 19 iterations in 159 ms. Result :sat
[2020-05-22 07:52:42] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-22 07:52:42] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:42] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 18 places in 25 ms
[2020-05-22 07:52:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-05-22 07:52:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:52:42] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:42] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-05-22 07:52:42] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-05-22 07:52:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-05-22 07:52:42] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 14 ms.
[2020-05-22 07:52:43] [INFO ] Added : 94 causal constraints over 19 iterations in 150 ms. Result :sat
[2020-05-22 07:52:43] [INFO ] Deduced a trap composed of 46 places in 33 ms
[2020-05-22 07:52:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2020-05-22 07:52:43] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:43] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-05-22 07:52:43] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:52:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:43] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-05-22 07:52:43] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-05-22 07:52:43] [INFO ] Added : 94 causal constraints over 19 iterations in 129 ms. Result :sat
[2020-05-22 07:52:43] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:43] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-22 07:52:43] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-05-22 07:52:43] [INFO ] Deduced a trap composed of 37 places in 16 ms
[2020-05-22 07:52:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2020-05-22 07:52:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:43] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-05-22 07:52:43] [INFO ] Deduced a trap composed of 18 places in 20 ms
[2020-05-22 07:52:43] [INFO ] Deduced a trap composed of 37 places in 25 ms
[2020-05-22 07:52:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2020-05-22 07:52:43] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-05-22 07:52:43] [INFO ] Added : 95 causal constraints over 19 iterations in 143 ms. Result :sat
[2020-05-22 07:52:43] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:43] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-22 07:52:43] [INFO ] Deduced a trap composed of 30 places in 22 ms
[2020-05-22 07:52:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2020-05-22 07:52:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:52:44] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:44] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2020-05-22 07:52:44] [INFO ] Deduced a trap composed of 30 places in 25 ms
[2020-05-22 07:52:44] [INFO ] Deduced a trap composed of 18 places in 41 ms
[2020-05-22 07:52:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2020-05-22 07:52:44] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 12 ms.
[2020-05-22 07:52:44] [INFO ] Added : 95 causal constraints over 19 iterations in 183 ms. Result :sat
[2020-05-22 07:52:44] [INFO ] [Real]Absence check using 5 positive place invariants in 19 ms returned sat
[2020-05-22 07:52:44] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:44] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-05-22 07:52:44] [INFO ] Deduced a trap composed of 33 places in 51 ms
[2020-05-22 07:52:44] [INFO ] Deduced a trap composed of 45 places in 42 ms
[2020-05-22 07:52:44] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2020-05-22 07:52:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2020-05-22 07:52:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2020-05-22 07:52:44] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-05-22 07:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:44] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2020-05-22 07:52:44] [INFO ] Deduced a trap composed of 44 places in 43 ms
[2020-05-22 07:52:44] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-05-22 07:52:44] [INFO ] Deduced a trap composed of 30 places in 17 ms
[2020-05-22 07:52:44] [INFO ] Deduced a trap composed of 53 places in 35 ms
[2020-05-22 07:52:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 161 ms
[2020-05-22 07:52:44] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-05-22 07:52:45] [INFO ] Added : 89 causal constraints over 18 iterations in 192 ms. Result :sat
[2020-05-22 07:52:45] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-22 07:52:45] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:45] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-05-22 07:52:45] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2020-05-22 07:52:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2020-05-22 07:52:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-22 07:52:45] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:45] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2020-05-22 07:52:45] [INFO ] Deduced a trap composed of 18 places in 43 ms
[2020-05-22 07:52:45] [INFO ] Deduced a trap composed of 25 places in 32 ms
[2020-05-22 07:52:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2020-05-22 07:52:45] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:52:45] [INFO ] Added : 58 causal constraints over 12 iterations in 103 ms. Result :sat
[2020-05-22 07:52:45] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 07:52:45] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:45] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-05-22 07:52:45] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2020-05-22 07:52:45] [INFO ] Deduced a trap composed of 25 places in 56 ms
[2020-05-22 07:52:45] [INFO ] Deduced a trap composed of 50 places in 61 ms
[2020-05-22 07:52:45] [INFO ] Deduced a trap composed of 61 places in 58 ms
[2020-05-22 07:52:45] [INFO ] Deduced a trap composed of 52 places in 36 ms
[2020-05-22 07:52:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 294 ms
[2020-05-22 07:52:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:52:46] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:46] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 39 places in 52 ms
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 25 places in 37 ms
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 42 places in 46 ms
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 46 places in 39 ms
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 47 places in 38 ms
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 30 places in 19 ms
[2020-05-22 07:52:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 278 ms
[2020-05-22 07:52:46] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:52:46] [INFO ] Added : 95 causal constraints over 19 iterations in 216 ms. Result :sat
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 44 places in 53 ms
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 46 places in 44 ms
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 47 places in 42 ms
[2020-05-22 07:52:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 186 ms
[2020-05-22 07:52:46] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 07:52:46] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:46] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-05-22 07:52:46] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-05-22 07:52:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2020-05-22 07:52:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-05-22 07:52:46] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:47] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 18 places in 34 ms
[2020-05-22 07:52:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2020-05-22 07:52:47] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:52:47] [INFO ] Added : 95 causal constraints over 19 iterations in 178 ms. Result :sat
[2020-05-22 07:52:47] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-22 07:52:47] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:47] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 45 places in 32 ms
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 70 places in 37 ms
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 44 places in 28 ms
[2020-05-22 07:52:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 114 ms
[2020-05-22 07:52:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:52:47] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:47] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 45 places in 32 ms
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 70 places in 27 ms
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 44 places in 27 ms
[2020-05-22 07:52:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 103 ms
[2020-05-22 07:52:47] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:52:47] [INFO ] Added : 95 causal constraints over 19 iterations in 140 ms. Result :sat
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 39 places in 50 ms
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 25 places in 36 ms
[2020-05-22 07:52:47] [INFO ] Deduced a trap composed of 53 places in 29 ms
[2020-05-22 07:52:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 148 ms
[2020-05-22 07:52:47] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:52:47] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-05-22 07:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:48] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-05-22 07:52:48] [INFO ] Deduced a trap composed of 30 places in 39 ms
[2020-05-22 07:52:48] [INFO ] Deduced a trap composed of 18 places in 20 ms
[2020-05-22 07:52:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2020-05-22 07:52:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:52:48] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:48] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-05-22 07:52:48] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2020-05-22 07:52:48] [INFO ] Deduced a trap composed of 18 places in 24 ms
[2020-05-22 07:52:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2020-05-22 07:52:48] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 4 ms.
[2020-05-22 07:52:48] [INFO ] Added : 93 causal constraints over 19 iterations in 156 ms. Result :sat
[2020-05-22 07:52:48] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:52:48] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:48] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-05-22 07:52:48] [INFO ] Deduced a trap composed of 18 places in 37 ms
[2020-05-22 07:52:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2020-05-22 07:52:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-05-22 07:52:48] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-05-22 07:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:48] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-05-22 07:52:48] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-05-22 07:52:48] [INFO ] Added : 94 causal constraints over 19 iterations in 156 ms. Result :sat
[2020-05-22 07:52:48] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:52:48] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:48] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2020-05-22 07:52:48] [INFO ] Deduced a trap composed of 18 places in 34 ms
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 36 places in 25 ms
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 34 places in 24 ms
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 44 places in 29 ms
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 30 places in 19 ms
[2020-05-22 07:52:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 163 ms
[2020-05-22 07:52:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:52:49] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:49] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 36 places in 27 ms
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 44 places in 34 ms
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2020-05-22 07:52:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 210 ms
[2020-05-22 07:52:49] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:52:49] [INFO ] Added : 95 causal constraints over 19 iterations in 172 ms. Result :sat
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 45 places in 26 ms
[2020-05-22 07:52:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2020-05-22 07:52:49] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-05-22 07:52:49] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-05-22 07:52:49] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 07:52:49] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:49] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-05-22 07:52:49] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2020-05-22 07:52:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2020-05-22 07:52:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 07:52:49] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:49] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-05-22 07:52:50] [INFO ] Deduced a trap composed of 18 places in 43 ms
[2020-05-22 07:52:50] [INFO ] Deduced a trap composed of 30 places in 36 ms
[2020-05-22 07:52:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2020-05-22 07:52:50] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:52:50] [INFO ] Added : 81 causal constraints over 17 iterations in 143 ms. Result :sat
[2020-05-22 07:52:50] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:52:50] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:50] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2020-05-22 07:52:50] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-05-22 07:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2020-05-22 07:52:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-05-22 07:52:50] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:50] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2020-05-22 07:52:50] [INFO ] Deduced a trap composed of 30 places in 36 ms
[2020-05-22 07:52:50] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-05-22 07:52:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2020-05-22 07:52:50] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:52:50] [INFO ] Added : 93 causal constraints over 19 iterations in 166 ms. Result :sat
[2020-05-22 07:52:50] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-22 07:52:50] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:50] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-22 07:52:50] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-05-22 07:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2020-05-22 07:52:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:52:50] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:51] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-05-22 07:52:51] [INFO ] Deduced a trap composed of 18 places in 23 ms
[2020-05-22 07:52:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2020-05-22 07:52:51] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:52:51] [INFO ] Added : 93 causal constraints over 19 iterations in 171 ms. Result :sat
[2020-05-22 07:52:51] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-22 07:52:51] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:51] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-22 07:52:51] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-05-22 07:52:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2020-05-22 07:52:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:52:51] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:51] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-05-22 07:52:51] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2020-05-22 07:52:51] [INFO ] Deduced a trap composed of 25 places in 38 ms
[2020-05-22 07:52:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2020-05-22 07:52:51] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 10 ms.
[2020-05-22 07:52:51] [INFO ] Added : 58 causal constraints over 12 iterations in 110 ms. Result :sat
[2020-05-22 07:52:51] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
[2020-05-22 07:52:51] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-05-22 07:52:51] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-05-22 07:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:51] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-22 07:52:51] [INFO ] Deduced a trap composed of 33 places in 48 ms
[2020-05-22 07:52:51] [INFO ] Deduced a trap composed of 45 places in 39 ms
[2020-05-22 07:52:51] [INFO ] Deduced a trap composed of 70 places in 35 ms
[2020-05-22 07:52:51] [INFO ] Deduced a trap composed of 44 places in 29 ms
[2020-05-22 07:52:51] [INFO ] Deduced a trap composed of 30 places in 17 ms
[2020-05-22 07:52:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 197 ms
[2020-05-22 07:52:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-05-22 07:52:52] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-05-22 07:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:52] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 33 places in 31 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 45 places in 49 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 70 places in 36 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 44 places in 32 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 30 places in 18 ms
[2020-05-22 07:52:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 198 ms
[2020-05-22 07:52:52] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-05-22 07:52:52] [INFO ] Added : 95 causal constraints over 19 iterations in 165 ms. Result :sat
[2020-05-22 07:52:52] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 07:52:52] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:52] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 44 places in 31 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 38 places in 35 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2020-05-22 07:52:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 170 ms
[2020-05-22 07:52:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:52:52] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:52] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 44 places in 32 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 38 places in 33 ms
[2020-05-22 07:52:52] [INFO ] Deduced a trap composed of 30 places in 33 ms
[2020-05-22 07:52:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 162 ms
[2020-05-22 07:52:52] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:52:53] [INFO ] Added : 72 causal constraints over 15 iterations in 97 ms. Result :sat
[2020-05-22 07:52:53] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:52:53] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2020-05-22 07:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:53] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 45 places in 28 ms
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 70 places in 29 ms
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 44 places in 34 ms
[2020-05-22 07:52:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 151 ms
[2020-05-22 07:52:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:52:53] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:52:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:53] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 45 places in 32 ms
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 70 places in 30 ms
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 44 places in 30 ms
[2020-05-22 07:52:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 211 ms
[2020-05-22 07:52:53] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:52:53] [INFO ] Added : 95 causal constraints over 19 iterations in 155 ms. Result :sat
[2020-05-22 07:52:53] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:52:53] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2020-05-22 07:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:53] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-05-22 07:52:53] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-05-22 07:52:54] [INFO ] Deduced a trap composed of 43 places in 49 ms
[2020-05-22 07:52:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2020-05-22 07:52:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-05-22 07:52:54] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 9 ms returned sat
[2020-05-22 07:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:54] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2020-05-22 07:52:54] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-05-22 07:52:54] [INFO ] Deduced a trap composed of 43 places in 41 ms
[2020-05-22 07:52:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2020-05-22 07:52:54] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:52:54] [INFO ] Added : 85 causal constraints over 17 iterations in 154 ms. Result :sat
[2020-05-22 07:52:54] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-05-22 07:52:54] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-05-22 07:52:54] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-05-22 07:52:54] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 07:52:54] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:54] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-05-22 07:52:54] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2020-05-22 07:52:54] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-05-22 07:52:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2020-05-22 07:52:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:52:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-05-22 07:52:54] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:52:54] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-05-22 07:52:54] [INFO ] Deduced a trap composed of 30 places in 11 ms
[2020-05-22 07:52:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2020-05-22 07:52:54] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:52:55] [INFO ] Added : 93 causal constraints over 19 iterations in 187 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-05-22 07:52:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 07:52:55] [INFO ] Flatten gal took : 69 ms
[2020-05-22 07:52:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 07:52:55] [INFO ] Flatten gal took : 20 ms
FORMULA DoubleExponent-PT-002-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:52:55] [INFO ] Applying decomposition
[2020-05-22 07:52:55] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11059134434933634182.txt, -o, /tmp/graph11059134434933634182.bin, -w, /tmp/graph11059134434933634182.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/graph11059134434933634182.bin, -l, -1, -v, -w, /tmp/graph11059134434933634182.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 07:52:55] [INFO ] Decomposing Gal with order
[2020-05-22 07:52:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:52:55] [INFO ] Removed a total of 25 redundant transitions.
[2020-05-22 07:52:55] [INFO ] Flatten gal took : 44 ms
[2020-05-22 07:52:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2020-05-22 07:52:55] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2020-05-22 07:52:55] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
built 25 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 24 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.388606,14136,1064,78,18151,426,362,44499,38,1968,0


Converting to forward existential form...Done !
original formula: E((AX((i2.i0.u1.p100>=1)) + (i2.i1.u8.p18>=1)) U (AF((i7.i1.u43.p94>=1)) * ((i7.i0.u28.p58<1)||(i7.i1.u43.p90<1))))
=> equivalent forward existential formula: [((FwdU(Init,(!(EX(!((i2.i0.u1.p100>=1)))) + (i2.i1.u8.p18>=1))) * ((i7.i0.u28.p58<1)||(i7.i1.u43.p90<1))) * !(EG(!((i7.i1.u43.p94>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t25, t51, t61, t73, t85, i0.u14.t30, i3.t37, i3.u21.t42, i6.t58, i6.i2.t67, i6.i2.u38.t72, i7.i0.u13.t49, i7.i1.t79, i7.i1.u43.t84, i8.t97, i8.t94, i8.t9, i8.t88, i8.u6.t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/76/21/97
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,1.83951,45672,1,0,53429,897,1772,210225,232,3114,170765
FORMULA DoubleExponent-PT-002-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EG((((((i8.u36.p8<1)||(i8.u44.p97<1))||(i5.u39.p107<1))||(i5.u39.p83<1)) + AG(((i0.u25.p12>=1)&&(i0.u14.p50>=1))))))
=> equivalent forward existential formula: [FwdG(Init,(((((i8.u36.p8<1)||(i8.u44.p97<1))||(i5.u39.p107<1))||(i5.u39.p83<1)) + !(E(TRUE U !(((i0.u25.p12>=1)&&(i0.u14.p50>=1)))))))] = FALSE
(forward)formula 1,0,2.04627,52800,1,0,65857,1018,2197,239968,250,4079,207660
FORMULA DoubleExponent-PT-002-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG(AF(((i1.u12.p24<1)||(i5.u23.p49<1)))) + A(AF(((i2.i0.u1.p101>=1)&&(i2.i0.u27.p60>=1))) U EX((i3.u21.p47>=1))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!(EX((i3.u21.p47>=1))) U (!(!(EG(!(((i2.i0.u1.p101>=1)&&(i2.i0.u27.p60>=1)))))) * !(EX((i3.u21.p47>=1))))) + EG(!(EX((i3.u21.p47>=1)))))))),TRUE),!(((i1.u12.p24<1)||(i5.u23.p49<1))))] = FALSE
dead was empty
(forward)formula 2,1,2.42779,68376,1,0,84239,1054,2239,341045,250,4152,258425
FORMULA DoubleExponent-PT-002-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((i0.u25.p53>=1))
=> equivalent forward existential formula: [FwdG(Init,!((i0.u25.p53>=1)))] = FALSE
(forward)formula 3,0,2.43469,68640,1,0,84931,1058,2275,341597,251,4198,261422
FORMULA DoubleExponent-PT-002-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((AX((i8.u2.p103>=1)) + EF(((i7.i0.u41.p55>=1)&&(i7.i1.u40.p87>=1)))) U (AG((i2.i0.u1.p100>=1)) * EX(((i5.u39.p107>=1)&&(i5.u33.p95>=1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,(!(EX(!((i8.u2.p103>=1)))) + E(TRUE U ((i7.i0.u41.p55>=1)&&(i7.i1.u40.p87>=1))))) * !(E(TRUE U !((i2.i0.u1.p100>=1)))))) * ((i5.u39.p107>=1)&&(i5.u33.p95>=1)))] != FALSE
(forward)formula 4,0,2.43611,68640,1,0,84931,1058,2283,341601,251,4198,261630
FORMULA DoubleExponent-PT-002-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((i8.u3.p106>=1)&&(i8.u44.p42>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((i8.u3.p106>=1)&&(i8.u44.p42>=1))))] = FALSE
(forward)formula 5,0,2.45432,69168,1,0,86583,1058,2313,343305,251,4198,268275
FORMULA DoubleExponent-PT-002-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AF(((i3.u20.p40>=1)&&(i8.u36.p8>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((i3.u20.p40>=1)&&(i8.u36.p8>=1))))))] != FALSE
dead was empty
(forward)formula 6,0,2.53874,71808,1,0,91426,1058,2348,347533,251,4211,283667
FORMULA DoubleExponent-PT-002-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(EG(((i2.i0.u1.p100>=1)||(i0.u25.p53>=1)))) * !(AG(((i3.u21.p43<1)||(i8.u7.p9<1)))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U EG(((i2.i0.u1.p100>=1)||(i0.u25.p53>=1))))),TRUE) * !(((i3.u21.p43<1)||(i8.u7.p9<1))))] != FALSE
(forward)formula 7,0,2.5433,72336,1,0,91649,1058,2363,347809,251,4211,284468
FORMULA DoubleExponent-PT-002-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((EX((i6.i1.u37.p79<1)) * (i7.i1.u40.p86>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((EX((i6.i1.u37.p79<1)) * (i7.i1.u40.p86>=1))))] = FALSE
(forward)formula 8,0,2.68714,78144,1,0,102292,1065,2369,371205,251,4224,318110
FORMULA DoubleExponent-PT-002-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(((i4.u9.p2>=1) + EF(((i7.i0.u41.p55>=1)&&(i7.i0.u13.p61>=1)))) U ((i1.u12.p24>=1)&&(i5.u23.p49>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((i1.u12.p24>=1)&&(i5.u23.p49>=1)))))) * !(E(!(((i1.u12.p24>=1)&&(i5.u23.p49>=1))) U (!(((i4.u9.p2>=1) + E(TRUE U ((i7.i0.u41.p55>=1)&&(i7.i0.u13.p61>=1))))) * !(((i1.u12.p24>=1)&&(i5.u23.p49>=1)))))))] != FALSE
(forward)formula 9,0,2.88779,82896,1,0,108384,1065,2410,390502,251,4224,341100
FORMULA DoubleExponent-PT-002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AX(FALSE))
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] != FALSE
(forward)formula 10,1,2.88798,82896,1,0,108384,1065,2410,390503,251,4224,341100
FORMULA DoubleExponent-PT-002-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((((((i7.i1.u42.p91<1)||(i2.i0.u1.p101<1))||(i2.i0.u27.p60<1)) + AF(((i8.u2.p104>=1)&&(i8.u17.p30>=1)))) + ((i6.i1.u26.p56>=1)&&(i6.i2.u34.p75>=1))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !(((i6.i1.u26.p56>=1)&&(i6.i2.u34.p75>=1)))) * !((((i7.i1.u42.p91<1)||(i2.i0.u1.p101<1))||(i2.i0.u27.p60<1)))),!(((i8.u2.p104>=1)&&(i8.u17.p30>=1))))] = FALSE
(forward)formula 11,1,2.8973,83160,1,0,108445,1065,2437,390692,251,4224,341783
FORMULA DoubleExponent-PT-002-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 12,1,2.89746,83160,1,0,108445,1065,2437,390692,251,4224,341783
FORMULA DoubleExponent-PT-002-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(EG(EX(((i5.u32.p71>=1)&&(i7.i0.u41.p89>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(((i5.u32.p71>=1)&&(i7.i0.u41.p89>=1))))))] = FALSE
(forward)formula 13,0,2.90008,83160,1,0,108457,1065,2445,390702,251,4224,342075
FORMULA DoubleExponent-PT-002-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590133978809

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814800756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;