Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100457.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 59K 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 BusinessProcesses-PT-02-00
FORMULA_NAME BusinessProcesses-PT-02-01
FORMULA_NAME BusinessProcesses-PT-02-02
FORMULA_NAME BusinessProcesses-PT-02-03
FORMULA_NAME BusinessProcesses-PT-02-04
FORMULA_NAME BusinessProcesses-PT-02-05
FORMULA_NAME BusinessProcesses-PT-02-06
FORMULA_NAME BusinessProcesses-PT-02-07
FORMULA_NAME BusinessProcesses-PT-02-08
FORMULA_NAME BusinessProcesses-PT-02-09
FORMULA_NAME BusinessProcesses-PT-02-10
FORMULA_NAME BusinessProcesses-PT-02-11
FORMULA_NAME BusinessProcesses-PT-02-12
FORMULA_NAME BusinessProcesses-PT-02-13
FORMULA_NAME BusinessProcesses-PT-02-14
FORMULA_NAME BusinessProcesses-PT-02-15

=== Now, execution of the tool begins

BK_START 1589249982625

[2020-05-12 02:19:44] [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-12 02:19:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:19:44] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-05-12 02:19:44] [INFO ] Transformed 262 places.
[2020-05-12 02:19:44] [INFO ] Transformed 219 transitions.
[2020-05-12 02:19:44] [INFO ] Found NUPN structural information;
[2020-05-12 02:19:44] [INFO ] Parsed PT model containing 262 places and 219 transitions in 83 ms.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1362 resets, run finished after 229 ms. (steps per millisecond=436 ) properties seen :[1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0]
// Phase 1: matrix 204 rows 245 cols
[2020-05-12 02:19:44] [INFO ] Computed 43 place invariants in 10 ms
[2020-05-12 02:19:44] [INFO ] [Real]Absence check using 30 positive place invariants in 35 ms returned sat
[2020-05-12 02:19:44] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-05-12 02:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:44] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-05-12 02:19:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 30 ms returned sat
[2020-05-12 02:19:45] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:19:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:45] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2020-05-12 02:19:45] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2020-05-12 02:19:45] [INFO ] Deduced a trap composed of 12 places in 37 ms
[2020-05-12 02:19:45] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-05-12 02:19:45] [INFO ] Deduced a trap composed of 21 places in 30 ms
[2020-05-12 02:19:45] [INFO ] Deduced a trap composed of 19 places in 24 ms
[2020-05-12 02:19:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 281 ms
[2020-05-12 02:19:45] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-05-12 02:19:46] [INFO ] Added : 136 causal constraints over 28 iterations in 595 ms. Result :sat
[2020-05-12 02:19:46] [INFO ] Deduced a trap composed of 55 places in 54 ms
[2020-05-12 02:19:46] [INFO ] Deduced a trap composed of 56 places in 50 ms
[2020-05-12 02:19:46] [INFO ] Deduced a trap composed of 57 places in 49 ms
[2020-05-12 02:19:46] [INFO ] Deduced a trap composed of 59 places in 50 ms
[2020-05-12 02:19:46] [INFO ] Deduced a trap composed of 56 places in 48 ms
[2020-05-12 02:19:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 367 ms
[2020-05-12 02:19:46] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:19:46] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:46] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-05-12 02:19:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-05-12 02:19:46] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:46] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2020-05-12 02:19:46] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-05-12 02:19:46] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2020-05-12 02:19:46] [INFO ] Deduced a trap composed of 23 places in 38 ms
[2020-05-12 02:19:47] [INFO ] Deduced a trap composed of 21 places in 38 ms
[2020-05-12 02:19:47] [INFO ] Deduced a trap composed of 14 places in 37 ms
[2020-05-12 02:19:47] [INFO ] Deduced a trap composed of 17 places in 36 ms
[2020-05-12 02:19:47] [INFO ] Deduced a trap composed of 37 places in 33 ms
[2020-05-12 02:19:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 358 ms
[2020-05-12 02:19:47] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-05-12 02:19:47] [INFO ] Added : 147 causal constraints over 30 iterations in 483 ms. Result :sat
[2020-05-12 02:19:47] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:19:47] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:47] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-05-12 02:19:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-05-12 02:19:47] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-05-12 02:19:47] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:48] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-05-12 02:19:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-05-12 02:19:48] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2020-05-12 02:19:48] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:48] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-05-12 02:19:48] [INFO ] Deduced a trap composed of 13 places in 59 ms
[2020-05-12 02:19:48] [INFO ] Deduced a trap composed of 15 places in 56 ms
[2020-05-12 02:19:48] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2020-05-12 02:19:48] [INFO ] Deduced a trap composed of 60 places in 53 ms
[2020-05-12 02:19:48] [INFO ] Deduced a trap composed of 68 places in 62 ms
[2020-05-12 02:19:48] [INFO ] Deduced a trap composed of 59 places in 53 ms
[2020-05-12 02:19:48] [INFO ] Deduced a trap composed of 58 places in 46 ms
[2020-05-12 02:19:48] [INFO ] Deduced a trap composed of 61 places in 48 ms
[2020-05-12 02:19:48] [INFO ] Deduced a trap composed of 62 places in 47 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 17 places in 49 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 59 places in 70 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 58 places in 50 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 59 places in 50 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 66 places in 65 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 65 places in 53 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 12 places in 47 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 58 places in 47 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 57 places in 53 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 27 places in 53 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 29 places in 45 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 30 places in 43 ms
[2020-05-12 02:19:49] [INFO ] Deduced a trap composed of 40 places in 42 ms
[2020-05-12 02:19:49] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1490 ms
[2020-05-12 02:19:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-05-12 02:19:49] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:19:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:50] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 13 places in 73 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 12 places in 56 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 17 places in 97 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 8 places in 65 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 41 places in 55 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 21 places in 52 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 24 places in 53 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 38 places in 79 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 56 places in 53 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 57 places in 49 ms
[2020-05-12 02:19:50] [INFO ] Deduced a trap composed of 36 places in 49 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 37 places in 51 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 30 places in 49 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 36 places in 46 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 36 places in 44 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 65 places in 52 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 61 places in 50 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 66 places in 51 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 57 places in 50 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 17 places in 48 ms
[2020-05-12 02:19:51] [INFO ] Deduced a trap composed of 31 places in 45 ms
[2020-05-12 02:19:51] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1621 ms
[2020-05-12 02:19:51] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-05-12 02:19:52] [INFO ] Added : 145 causal constraints over 30 iterations in 522 ms. Result :sat
[2020-05-12 02:19:52] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:19:52] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:52] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-05-12 02:19:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-05-12 02:19:52] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 99 ms returned sat
[2020-05-12 02:19:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:54] [INFO ] [Nat]Absence check using state equation in 1513 ms returned sat
[2020-05-12 02:19:54] [INFO ] Deduced a trap composed of 13 places in 55 ms
[2020-05-12 02:19:54] [INFO ] Deduced a trap composed of 20 places in 410 ms
[2020-05-12 02:19:54] [INFO ] Deduced a trap composed of 17 places in 302 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 27 places in 50 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 27 places in 50 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 12 places in 53 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 33 places in 52 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 26 places in 56 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 30 places in 56 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 63 places in 51 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 61 places in 50 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 58 places in 52 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 24 places in 47 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 62 places in 41 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 57 places in 42 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 61 places in 41 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 28 places in 45 ms
[2020-05-12 02:19:55] [INFO ] Deduced a trap composed of 63 places in 40 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 18 places in 41 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 66 places in 39 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 63 places in 39 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 59 places in 39 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 36 places in 45 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 40 places in 43 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 55 places in 44 ms
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 59 places in 41 ms
[2020-05-12 02:19:56] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2348 ms
[2020-05-12 02:19:56] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-05-12 02:19:56] [INFO ] Added : 146 causal constraints over 30 iterations in 511 ms. Result :sat
[2020-05-12 02:19:57] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-05-12 02:19:57] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:57] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-05-12 02:19:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-05-12 02:19:57] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:57] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 16 places in 34 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 12 places in 36 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 19 places in 33 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 15 places in 30 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 17 places in 33 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 26 places in 30 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 21 places in 36 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 21 places in 32 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 24 places in 33 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 28 places in 29 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2020-05-12 02:19:58] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 654 ms
[2020-05-12 02:19:58] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 14 ms.
[2020-05-12 02:19:58] [INFO ] Added : 150 causal constraints over 31 iterations in 475 ms. Result :sat
[2020-05-12 02:19:58] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:19:58] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:58] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-05-12 02:19:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-05-12 02:19:58] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:58] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-05-12 02:19:59] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2020-05-12 02:19:59] [INFO ] Deduced a trap composed of 11 places in 43 ms
[2020-05-12 02:19:59] [INFO ] Deduced a trap composed of 17 places in 25 ms
[2020-05-12 02:19:59] [INFO ] Deduced a trap composed of 19 places in 24 ms
[2020-05-12 02:19:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 170 ms
[2020-05-12 02:19:59] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-05-12 02:19:59] [INFO ] Added : 149 causal constraints over 31 iterations in 462 ms. Result :sat
[2020-05-12 02:19:59] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:19:59] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:59] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-05-12 02:19:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned unsat
[2020-05-12 02:19:59] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:19:59] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:00] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-05-12 02:20:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-05-12 02:20:00] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:00] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 11 places in 53 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 27 places in 56 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 56 places in 54 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 58 places in 53 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 17 places in 50 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 59 places in 49 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 19 places in 45 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 24 places in 52 ms
[2020-05-12 02:20:01] [INFO ] Deduced a trap composed of 19 places in 48 ms
[2020-05-12 02:20:01] [INFO ] Deduced a trap composed of 36 places in 47 ms
[2020-05-12 02:20:01] [INFO ] Deduced a trap composed of 59 places in 45 ms
[2020-05-12 02:20:01] [INFO ] Deduced a trap composed of 16 places in 23 ms
[2020-05-12 02:20:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 901 ms
[2020-05-12 02:20:01] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-05-12 02:20:01] [INFO ] Added : 137 causal constraints over 29 iterations in 431 ms. Result :sat
[2020-05-12 02:20:01] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:20:01] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:01] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-05-12 02:20:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-05-12 02:20:01] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:02] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 13 places in 62 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 11 places in 49 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 25 places in 53 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 8 places in 55 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 20 places in 50 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 59 places in 52 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 58 places in 51 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 56 places in 51 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 59 places in 52 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 61 places in 53 ms
[2020-05-12 02:20:02] [INFO ] Deduced a trap composed of 20 places in 26 ms
[2020-05-12 02:20:02] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 718 ms
[2020-05-12 02:20:02] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-05-12 02:20:03] [INFO ] Added : 147 causal constraints over 30 iterations in 459 ms. Result :sat
[2020-05-12 02:20:03] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:20:03] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:03] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-05-12 02:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-05-12 02:20:03] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:20:03] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:03] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-05-12 02:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-05-12 02:20:03] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:20:03] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:03] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-05-12 02:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-05-12 02:20:04] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:20:04] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:04] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-05-12 02:20:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-05-12 02:20:04] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:20:04] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:04] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-05-12 02:20:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned unsat
[2020-05-12 02:20:04] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:20:04] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:04] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-05-12 02:20:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-05-12 02:20:04] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:04] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-05-12 02:20:05] [INFO ] Deduced a trap composed of 8 places in 115 ms
[2020-05-12 02:20:05] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2020-05-12 02:20:05] [INFO ] Deduced a trap composed of 16 places in 83 ms
[2020-05-12 02:20:05] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2020-05-12 02:20:05] [INFO ] Deduced a trap composed of 17 places in 71 ms
[2020-05-12 02:20:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 497 ms
[2020-05-12 02:20:05] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-05-12 02:20:05] [INFO ] Added : 122 causal constraints over 26 iterations in 375 ms. Result :sat
[2020-05-12 02:20:05] [INFO ] Deduced a trap composed of 63 places in 140 ms
[2020-05-12 02:20:06] [INFO ] Deduced a trap composed of 67 places in 127 ms
[2020-05-12 02:20:06] [INFO ] Deduced a trap composed of 55 places in 65 ms
[2020-05-12 02:20:06] [INFO ] Deduced a trap composed of 57 places in 62 ms
[2020-05-12 02:20:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 503 ms
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-05-12 02:20:06] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:20:06] [INFO ] Flatten gal took : 76 ms
FORMULA BusinessProcesses-PT-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:20:06] [INFO ] Flatten gal took : 12 ms
[2020-05-12 02:20:06] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-12 02:20:06] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-12 02:20:06] [INFO ] Flatten gal took : 28 ms
[2020-05-12 02:20:07] [INFO ] Input system was already deterministic with 204 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/graph6899046893384441233.txt, -o, /tmp/graph6899046893384441233.bin, -w, /tmp/graph6899046893384441233.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/graph6899046893384441233.bin, -l, -1, -v, -w, /tmp/graph6899046893384441233.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:20:07] [INFO ] Decomposing Gal with order
[2020-05-12 02:20:07] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 204 rows 245 cols
[2020-05-12 02:20:07] [INFO ] Computed 43 place invariants in 3 ms
inv : p47 + p48 + p49 - p231 - p232 - p256 = 0
inv : p84 + p85 + p86 - p247 - p248 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p79 + p82 + p83 + p247 + p248 = 1
inv : p40 + p41 - p43 - p44 - p104 - p106 - p166 - p167 - p169 - p170 + p171 + p172 + p174 + p175 - p176 - p177 - p179 - p180 + p181 + p182 + p184 + p185 + p239 + p240 - p251 - p252 + p256 - p259 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p21 + p22 + p23 + p24 + p25 + p218 + p219 = 1
inv : p26 + p27 - p218 - p219 = 0
inv : p0 + p18 + p19 + p20 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p259 + p260 + p261 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p176 + p177 + p178 + p179 + p180 = 1
inv : p0 + p1 + p101 + p191 + p192 + p193 + p194 + p195 = 1
inv : p60 + p61 + p62 - p235 - p236 = 0
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p136 + p138 + p139 + p140 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p156 + p157 + p158 + p159 + p160 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p55 + p58 + p59 + p235 + p236 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p45 + p46 + p50 + p51 + p231 + p232 + p256 = 1
inv : p47 + p48 + p52 - p231 - p232 - p259 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p35 + p36 + p37 + p38 + p42 + p43 + p44 = 1
inv : p90 + p91 + p92 - p251 - p252 = 0
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p166 + p167 + p168 + p169 + p170 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p28 + p29 + p30 + p31 + p32 + p224 + p225 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p161 + p162 + p163 + p164 + p165 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p119 + p120 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p141 + p143 + p144 + p145 = 1
inv : p0 + p1 + p2 + p3 + p4 + p87 + p88 + p89 + p251 + p252 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p121 + p124 + p125 = 1
inv : p33 + p34 - p224 - p225 = 0
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p171 + p172 + p173 + p174 + p175 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p16 + p17 - p196 - p197 - p198 - p199 - p200 - p201 - p202 - p203 - p205 - p206 - p207 - p208 - p209 - p210 - p211 - p214 - p215 - p216 - p217 - p218 - p219 - p220 - p221 - p222 - p223 - p224 - p225 - p226 - p227 - p228 - p229 - p230 - p231 - p232 - p233 - p234 - p235 - p236 - p237 - p238 - p239 - p240 - p241 - p242 - p243 - p244 - p245 - p246 - p247 - p248 - p249 - p250 - p251 - p252 - p253 - p254 - p255 - p259 - p260 - p261 = 0
inv : p0 + p1 + p2 + p3 + p93 + p94 + p95 + p96 = 1
inv : p0 + p1 + p101 + p102 + p186 + p187 + p188 + p189 + p190 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p146 + p147 + p148 + p149 + p150 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p69 + p74 + p75 + p243 + p244 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p151 + p152 + p153 + p154 + p155 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p45 + p46 + p53 + p54 + p231 + p232 + p259 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p35 + p36 + p37 + p38 + p39 + p43 + p44 + p104 + p106 + p166 + p167 + p169 + p170 - p171 - p172 - p174 - p175 + p176 + p177 + p179 + p180 - p181 - p182 - p184 - p185 - p239 - p240 + p251 + p252 - p256 + p259 = 1
inv : p76 + p77 + p78 - p243 - p244 = 0
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p126 + p127 + p128 + p129 + p130 = 1
inv : p0 + p1 + p2 + p97 + p98 + p99 + p100 = 1
inv : p0 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p259 + p260 + p261 = 1
inv : p0 + p1 + p101 + p102 + p103 + p181 + p182 + p183 + p184 + p185 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p63 + p64 + p65 + p239 + p240 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p131 + p132 + p133 + p134 + p135 = 1
inv : p66 + p67 + p68 - p239 - p240 = 0
inv : p256 + p257 + p258 - p259 - p260 - p261 = 0
Total of 43 invariants.
[2020-05-12 02:20:07] [INFO ] Computed 43 place invariants in 4 ms
[2020-05-12 02:20:07] [INFO ] Removed a total of 36 redundant transitions.
[2020-05-12 02:20:07] [INFO ] Flatten gal took : 131 ms
[2020-05-12 02:20:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2020-05-12 02:20:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
[2020-05-12 02:20:07] [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], 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
Read 8 LTL properties
Checking formula 0 : !((G(("((i14.u77.p215==0)||(i5.u25.p75==1))")U(X("(i14.u70.p196==0)")))))
Formula 0 simplified : !G("((i14.u77.p215==0)||(i5.u25.p75==1))" U X"(i14.u70.p196==0)")
built 35 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 36 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-12 02:20:08] [INFO ] Proved 245 variables to be positive in 749 ms
[2020-05-12 02:20:08] [INFO ] Computing symmetric may disable matrix : 204 transitions.
[2020-05-12 02:20:08] [INFO ] Computation of disable matrix completed :0/204 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:20:08] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:20:08] [INFO ] Computing symmetric may enable matrix : 204 transitions.
[2020-05-12 02:20:08] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t156, t162, t168, t174, i0.u27.t135, i0.u29.t131, i1.t150, i1.u6.t182, i1.u21.t153, i2.t177, i2.u8.t179, i3.u14.t167, i4.u17.t161, i5.u23.t149, i5.u25.t141, i6.i0.u31.t127, i6.i1.t114, i6.i1.u44.t115, i7.i2.t66, i7.i2.u67.t67, i7.i3.t62, i7.i3.u68.t63, i8.i1.t98, i8.i1.u51.t99, i8.i2.t90, i8.i2.u55.t91, i8.i3.t86, i8.i3.u56.t87, i10.i1.t110, i10.i1.u47.t111, i11.i0.t171, i11.i0.u11.t173, i11.i1.t94, i11.i1.u53.t95, i12.t82, i12.u58.t83, i13.i1.t78, i13.i1.u61.t79, i13.i2.t74, i13.i2.u62.t75, i13.i3.t70, i13.i3.u64.t71, i14.t56, i14.t45, i14.t43, i14.t40, i14.t38, i14.t35, i14.t33, i14.t30, i14.t28, i14.t21, i14.t18, i14.t15, i14.t12, i14.t9, i14.t6, i14.u70.t4, i14.u70.t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/145/59/204
Computing Next relation with stutter on 41 deadlock states
[2020-05-12 02:20:09] [INFO ] Computing symmetric co enabling matrix : 204 transitions.
190 unique states visited
0 strongly connected components in search stack
315 transitions explored
65 items max in DFS search stack
271 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.75817,94296,1,0,159017,286,3308,244522,222,866,455513
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(X(G(X((G(!(G("((i6.i1.u7.p18==0)||(i8.i2.u55.p157==1))"))))U(F("((i4.u18.p48==0)||(i8.i3.u56.p164==1))"))))))))))
Formula 1 simplified : !XXXXGX(G!G"((i6.i1.u7.p18==0)||(i8.i2.u55.p157==1))" U F"((i4.u18.p48==0)||(i8.i3.u56.p164==1))")
Computing Next relation with stutter on 41 deadlock states
127 unique states visited
0 strongly connected components in search stack
128 transitions explored
65 items max in DFS search stack
20 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.95956,100852,1,0,173101,287,3357,258807,222,874,478518
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(("((i7.i3.u69.p195==0)||(i14.u75.p211==1))")U((G("(i1.u4.p9==1)"))&&("((i6.i1.u7.p20==0)||(i14.u81.p223==1))")))))
Formula 2 simplified : !F("((i7.i3.u69.p195==0)||(i14.u75.p211==1))" U ("((i6.i1.u7.p20==0)||(i14.u81.p223==1))" & G"(i1.u4.p9==1)"))
Computing Next relation with stutter on 41 deadlock states
59 unique states visited
59 strongly connected components in search stack
59 transitions explored
59 items max in DFS search stack
48 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.43643,115832,1,0,213895,287,3464,288324,225,887,546156
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(X(F(X(F("((i14.u80.p220==0)||(i4.u85.p259==1))"))))))||(!(G("((i9.u49.p141==0)||(i12.u24.p68==1))")))))
Formula 3 simplified : !(!XFXF"((i14.u80.p220==0)||(i4.u85.p259==1))" | !G"((i9.u49.p141==0)||(i12.u24.p68==1))")
Computing Next relation with stutter on 41 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
20 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.64197,122132,1,0,224806,289,3516,299810,226,892,565774
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(X(G((!(G("((i13.i2.u62.p177==0)||(i5.u23.p65==1))")))||(F("((i11.i0.u82.p225==0)||(i1.u76.p212==1))"))))))))
Formula 4 simplified : !GXXG(!G"((i13.i2.u62.p177==0)||(i5.u23.p65==1))" | F"((i11.i0.u82.p225==0)||(i1.u76.p212==1))")
Computing Next relation with stutter on 41 deadlock states
65 unique states visited
0 strongly connected components in search stack
128 transitions explored
65 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.75791,127196,1,0,236815,298,3560,308100,227,915,590979
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X("((i8.i0.u38.p107!=0)&&(i14.u81.p222!=1))"))))
Formula 5 simplified : !GX"((i8.i0.u38.p107!=0)&&(i14.u81.p222!=1))"
Computing Next relation with stutter on 41 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.761,127720,1,0,236849,298,3587,308158,228,915,591181
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((X("(i8.i2.u55.p159==1)"))U(F(F(X("((i11.i0.u82.p225==0)||(i9.u49.p141==1))")))))))
Formula 6 simplified : !F(X"(i8.i2.u55.p159==1)" U FX"((i11.i0.u82.p225==0)||(i9.u49.p141==1))")
Computing Next relation with stutter on 41 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.76194,127720,1,0,236849,298,3608,308158,228,915,591197
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-02-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(!(F((!(G("((i9.u49.p145!=0)&&(i4.u18.p48!=1))")))&&("((i14.u73.p203==0)||(i0.u95.p252==1))"))))))
Formula 7 simplified : !F!F("((i14.u73.p203==0)||(i0.u95.p252==1))" & !G"((i9.u49.p145!=0)&&(i4.u18.p48!=1))")
Computing Next relation with stutter on 41 deadlock states
63 unique states visited
63 strongly connected components in search stack
63 transitions explored
63 items max in DFS search stack
209 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.84884,171476,1,0,312184,308,3663,422893,229,965,735867
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-12 02:20:14] [INFO ] Computation of co-enabling matrix(3/204) took 4582 ms. Total solver calls (SAT/UNSAT): 336(34/302)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-12 02:20:14] [INFO ] Built C files in 7720ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589250014748

--------------------
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="BusinessProcesses-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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