fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699100481
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.080 75150.00 149580.00 147.70 FFTFTFFFTTFFFTFF normal

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-158897699100481.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-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100481
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:43 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 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 85K 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-05-00
FORMULA_NAME BusinessProcesses-PT-05-01
FORMULA_NAME BusinessProcesses-PT-05-02
FORMULA_NAME BusinessProcesses-PT-05-03
FORMULA_NAME BusinessProcesses-PT-05-04
FORMULA_NAME BusinessProcesses-PT-05-05
FORMULA_NAME BusinessProcesses-PT-05-06
FORMULA_NAME BusinessProcesses-PT-05-07
FORMULA_NAME BusinessProcesses-PT-05-08
FORMULA_NAME BusinessProcesses-PT-05-09
FORMULA_NAME BusinessProcesses-PT-05-10
FORMULA_NAME BusinessProcesses-PT-05-11
FORMULA_NAME BusinessProcesses-PT-05-12
FORMULA_NAME BusinessProcesses-PT-05-13
FORMULA_NAME BusinessProcesses-PT-05-14
FORMULA_NAME BusinessProcesses-PT-05-15

=== Now, execution of the tool begins

BK_START 1589250675822

[2020-05-12 02:31:18] [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:31:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:31:18] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2020-05-12 02:31:18] [INFO ] Transformed 368 places.
[2020-05-12 02:31:18] [INFO ] Transformed 319 transitions.
[2020-05-12 02:31:18] [INFO ] Found NUPN structural information;
[2020-05-12 02:31:18] [INFO ] Parsed PT model containing 368 places and 319 transitions in 131 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 924 resets, run finished after 234 ms. (steps per millisecond=427 ) properties seen :[1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 318 rows 367 cols
[2020-05-12 02:31:18] [INFO ] Computed 57 place invariants in 15 ms
[2020-05-12 02:31:19] [INFO ] [Real]Absence check using 41 positive place invariants in 221 ms returned sat
[2020-05-12 02:31:19] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 21 ms returned sat
[2020-05-12 02:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:19] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2020-05-12 02:31:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:31:20] [INFO ] [Nat]Absence check using 41 positive place invariants in 65 ms returned sat
[2020-05-12 02:31:20] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:20] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2020-05-12 02:31:20] [INFO ] Deduced a trap composed of 95 places in 177 ms
[2020-05-12 02:31:20] [INFO ] Deduced a trap composed of 94 places in 156 ms
[2020-05-12 02:31:21] [INFO ] Deduced a trap composed of 8 places in 201 ms
[2020-05-12 02:31:21] [INFO ] Deduced a trap composed of 16 places in 99 ms
[2020-05-12 02:31:21] [INFO ] Deduced a trap composed of 32 places in 92 ms
[2020-05-12 02:31:21] [INFO ] Deduced a trap composed of 29 places in 89 ms
[2020-05-12 02:31:21] [INFO ] Deduced a trap composed of 32 places in 109 ms
[2020-05-12 02:31:21] [INFO ] Deduced a trap composed of 28 places in 104 ms
[2020-05-12 02:31:21] [INFO ] Deduced a trap composed of 38 places in 168 ms
[2020-05-12 02:31:22] [INFO ] Deduced a trap composed of 40 places in 178 ms
[2020-05-12 02:31:22] [INFO ] Deduced a trap composed of 30 places in 173 ms
[2020-05-12 02:31:22] [INFO ] Deduced a trap composed of 15 places in 200 ms
[2020-05-12 02:31:22] [INFO ] Deduced a trap composed of 86 places in 170 ms
[2020-05-12 02:31:22] [INFO ] Deduced a trap composed of 14 places in 177 ms
[2020-05-12 02:31:23] [INFO ] Deduced a trap composed of 21 places in 157 ms
[2020-05-12 02:31:23] [INFO ] Deduced a trap composed of 92 places in 580 ms
[2020-05-12 02:31:23] [INFO ] Deduced a trap composed of 89 places in 283 ms
[2020-05-12 02:31:24] [INFO ] Deduced a trap composed of 87 places in 558 ms
[2020-05-12 02:31:24] [INFO ] Deduced a trap composed of 18 places in 84 ms
[2020-05-12 02:31:24] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2020-05-12 02:31:24] [INFO ] Deduced a trap composed of 28 places in 158 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 92 places in 87 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 89 places in 68 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 21 places in 66 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 91 places in 81 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 23 places in 68 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 88 places in 68 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 93 places in 87 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 96 places in 63 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 26 places in 98 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 18 places in 84 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 29 places in 114 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 95 places in 86 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 90 places in 96 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 27 places in 70 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 90 places in 88 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 16 places in 114 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 91 places in 62 ms
[2020-05-12 02:31:27] [INFO ] Deduced a trap composed of 41 places in 1237 ms
[2020-05-12 02:31:27] [INFO ] Deduced a trap composed of 91 places in 167 ms
[2020-05-12 02:31:28] [INFO ] Deduced a trap composed of 39 places in 131 ms
[2020-05-12 02:31:28] [INFO ] Deduced a trap composed of 36 places in 131 ms
[2020-05-12 02:31:28] [INFO ] Deduced a trap composed of 48 places in 125 ms
[2020-05-12 02:31:28] [INFO ] Deduced a trap composed of 87 places in 127 ms
[2020-05-12 02:31:28] [INFO ] Deduced a trap composed of 27 places in 125 ms
[2020-05-12 02:31:28] [INFO ] Deduced a trap composed of 19 places in 88 ms
[2020-05-12 02:31:28] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 8325 ms
[2020-05-12 02:31:28] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2020-05-12 02:31:29] [INFO ] Added : 207 causal constraints over 42 iterations in 1151 ms. Result :sat
[2020-05-12 02:31:30] [INFO ] [Real]Absence check using 41 positive place invariants in 100 ms returned sat
[2020-05-12 02:31:30] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 79 ms returned sat
[2020-05-12 02:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:30] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2020-05-12 02:31:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:31:31] [INFO ] [Nat]Absence check using 41 positive place invariants in 25 ms returned unsat
[2020-05-12 02:31:31] [INFO ] [Real]Absence check using 41 positive place invariants in 69 ms returned sat
[2020-05-12 02:31:31] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 33 ms returned sat
[2020-05-12 02:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:31] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2020-05-12 02:31:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:31:31] [INFO ] [Nat]Absence check using 41 positive place invariants in 25 ms returned unsat
[2020-05-12 02:31:31] [INFO ] [Real]Absence check using 41 positive place invariants in 82 ms returned sat
[2020-05-12 02:31:31] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:32] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2020-05-12 02:31:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:31:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned unsat
[2020-05-12 02:31:32] [INFO ] [Real]Absence check using 41 positive place invariants in 38 ms returned sat
[2020-05-12 02:31:32] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 51 ms returned sat
[2020-05-12 02:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:33] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2020-05-12 02:31:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:31:33] [INFO ] [Nat]Absence check using 41 positive place invariants in 93 ms returned sat
[2020-05-12 02:31:33] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:33] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2020-05-12 02:31:34] [INFO ] Deduced a trap composed of 9 places in 267 ms
[2020-05-12 02:31:35] [INFO ] Deduced a trap composed of 86 places in 1008 ms
[2020-05-12 02:31:35] [INFO ] Deduced a trap composed of 17 places in 82 ms
[2020-05-12 02:31:35] [INFO ] Deduced a trap composed of 19 places in 207 ms
[2020-05-12 02:31:35] [INFO ] Deduced a trap composed of 17 places in 204 ms
[2020-05-12 02:31:35] [INFO ] Deduced a trap composed of 91 places in 160 ms
[2020-05-12 02:31:36] [INFO ] Deduced a trap composed of 30 places in 191 ms
[2020-05-12 02:31:36] [INFO ] Deduced a trap composed of 49 places in 369 ms
[2020-05-12 02:31:36] [INFO ] Deduced a trap composed of 24 places in 174 ms
[2020-05-12 02:31:36] [INFO ] Deduced a trap composed of 29 places in 188 ms
[2020-05-12 02:31:37] [INFO ] Deduced a trap composed of 88 places in 142 ms
[2020-05-12 02:31:37] [INFO ] Deduced a trap composed of 52 places in 166 ms
[2020-05-12 02:31:37] [INFO ] Deduced a trap composed of 48 places in 118 ms
[2020-05-12 02:31:37] [INFO ] Deduced a trap composed of 27 places in 82 ms
[2020-05-12 02:31:37] [INFO ] Deduced a trap composed of 89 places in 69 ms
[2020-05-12 02:31:37] [INFO ] Deduced a trap composed of 92 places in 151 ms
[2020-05-12 02:31:38] [INFO ] Deduced a trap composed of 27 places in 222 ms
[2020-05-12 02:31:38] [INFO ] Deduced a trap composed of 45 places in 143 ms
[2020-05-12 02:31:42] [INFO ] Deduced a trap composed of 92 places in 3799 ms
[2020-05-12 02:31:42] [INFO ] Deduced a trap composed of 87 places in 162 ms
[2020-05-12 02:31:42] [INFO ] Deduced a trap composed of 88 places in 116 ms
[2020-05-12 02:31:42] [INFO ] Deduced a trap composed of 86 places in 86 ms
[2020-05-12 02:31:42] [INFO ] Deduced a trap composed of 90 places in 87 ms
[2020-05-12 02:31:42] [INFO ] Deduced a trap composed of 86 places in 72 ms
[2020-05-12 02:31:42] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2020-05-12 02:31:42] [INFO ] Deduced a trap composed of 40 places in 78 ms
[2020-05-12 02:31:43] [INFO ] Deduced a trap composed of 91 places in 95 ms
[2020-05-12 02:31:43] [INFO ] Deduced a trap composed of 42 places in 85 ms
[2020-05-12 02:31:43] [INFO ] Deduced a trap composed of 95 places in 168 ms
[2020-05-12 02:31:43] [INFO ] Deduced a trap composed of 91 places in 124 ms
[2020-05-12 02:31:43] [INFO ] Deduced a trap composed of 92 places in 85 ms
[2020-05-12 02:31:43] [INFO ] Deduced a trap composed of 90 places in 177 ms
[2020-05-12 02:31:43] [INFO ] Deduced a trap composed of 88 places in 158 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 90 places in 138 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 93 places in 64 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 92 places in 69 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 93 places in 66 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 96 places in 75 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 95 places in 70 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 18 places in 66 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 91 places in 63 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 96 places in 83 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 38 places in 128 ms
[2020-05-12 02:31:45] [INFO ] Deduced a trap composed of 41 places in 95 ms
[2020-05-12 02:31:45] [INFO ] Deduced a trap composed of 47 places in 80 ms
[2020-05-12 02:31:45] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 11170 ms
[2020-05-12 02:31:45] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 15 ms.
[2020-05-12 02:31:46] [INFO ] Added : 137 causal constraints over 28 iterations in 966 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-12 02:31:46] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-05-12 02:31:46] [INFO ] Flatten gal took : 81 ms
FORMULA BusinessProcesses-PT-05-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:31:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-12 02:31:46] [INFO ] Flatten gal took : 40 ms
[2020-05-12 02:31:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-05-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 02:31:46] [INFO ] Applying decomposition
[2020-05-12 02:31:46] [INFO ] Flatten gal took : 41 ms
[2020-05-12 02:31:46] [INFO ] Input system was already deterministic with 318 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/graph16622457015549306395.txt, -o, /tmp/graph16622457015549306395.bin, -w, /tmp/graph16622457015549306395.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/graph16622457015549306395.bin, -l, -1, -v, -w, /tmp/graph16622457015549306395.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:31:46] [INFO ] Decomposing Gal with order
[2020-05-12 02:31:46] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 318 rows 367 cols
[2020-05-12 02:31:46] [INFO ] Computed 57 place invariants in 27 ms
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p59 + p66 + p67 - p266 - p267 - p268 - p269 - p270 - p271 - p273 - p274 - p275 - p276 - p277 - p278 - p279 - p280 - p281 - p282 - p283 - p284 - p285 - p286 - p287 - p288 - p289 - p290 - p291 - p292 - p293 - p294 - p295 - p296 - p297 - p298 - p299 - p300 - p301 - p302 - p303 - p304 - p305 - p306 - p307 - p308 - p309 - p310 - p311 - p318 - p319 - p323 - p324 - p325 - p326 - p327 - p328 - p329 - p330 - p331 - p332 - p333 - p334 - p335 - p336 - p337 - p338 - p339 - p340 - p341 - p342 - p343 - p344 - p345 - p346 - p347 - p348 - p349 - p350 - p351 - p352 - p353 - p354 - p355 - p356 - p357 - p358 - p359 - p360 - p361 - p362 - p363 - p364 - p365 - p366 - p367 = 0
inv : p0 + p1 + p2 + p3 + p127 + p128 + p129 + p130 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p25 + p26 + p27 + p28 + p29 + p286 + p287 = 1
inv : p118 + p119 + p120 - p359 - p360 = 0
inv : p100 + p101 + p102 - p347 - p348 = 0
inv : p30 + p31 - p286 - p287 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p236 + p237 + p238 + p239 + p240 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p161 + p162 + p163 + p164 + p165 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p186 + p187 + p188 + p189 + p190 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p211 + p212 + p213 + p214 + p215 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p70 + p71 + p72 + p325 + p326 = 1
inv : p47 + p48 + p51 + p52 - p301 - p302 - p305 - p306 - p307 = 0
inv : p106 + p107 + p108 - p351 - p352 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p32 + p35 + p36 + p288 + p289 + p292 + p293 + p294 = 1
inv : p0 + p1 + p2 + p131 + p132 + p133 + p134 = 1
inv : p44 + p45 - p299 - p300 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p226 + p227 + p228 + p229 + p230 = 1
inv : p81 + p82 - p331 - p332 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p46 + p49 + p50 + p301 + p302 + p305 + p306 + p307 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p166 + p167 + p168 + p169 + p170 = 1
inv : p88 + p89 - p337 - p338 = 0
inv : p95 + p96 - p343 - p344 = 0
inv : p0 + p1 + p2 + p3 + p4 + p121 + p122 + p123 + p363 + p364 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p241 + p242 + p243 + p244 + p245 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p231 + p232 + p233 + p234 + p235 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p196 + p197 + p198 + p199 + p200 = 1
inv : p73 + p74 + p75 - p325 - p326 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 1
inv : p33 + p34 + p37 + p38 - p288 - p289 - p292 - p293 - p294 = 0
inv : p124 + p125 + p126 - p363 - p364 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p206 + p207 + p208 + p209 + p210 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p115 + p116 + p117 + p359 + p360 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p90 + p91 + p92 + p93 + p94 + p343 + p344 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p109 + p110 + p111 + p355 + p356 = 1
inv : p112 + p113 + p114 - p355 - p356 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p181 + p182 + p183 + p184 + p185 = 1
inv : p0 + p1 + p135 + p136 + p256 + p257 + p258 + p259 + p260 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p53 + p54 + p55 + p310 + p311 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p103 + p104 + p105 + p351 + p352 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p201 + p202 + p203 + p204 + p205 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p246 + p247 + p248 + p249 + p250 = 1
inv : p0 + p1 + p135 + p261 + p262 + p263 + p264 + p265 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p191 + p192 + p193 + p194 + p195 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p171 + p172 + p173 + p174 + p175 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p39 + p40 + p41 + p42 + p43 + p299 + p300 = 1
inv : p0 + p60 + p61 + p62 + p63 + p64 + p65 + p68 + p69 + p266 + p267 + p268 + p269 + p270 + p271 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p318 + p319 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p176 + p177 + p178 + p179 + p180 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p221 + p222 + p223 + p224 + p225 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p97 + p98 + p99 + p347 + p348 = 1
inv : p0 + p1 + p135 + p136 + p137 + p251 + p252 + p253 + p254 + p255 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p216 + p217 + p218 + p219 + p220 = 1
inv : p56 + p57 + p58 - p310 - p311 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p280 + p281 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p83 + p84 + p85 + p86 + p87 + p337 + p338 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p76 + p77 + p78 + p79 + p80 + p331 + p332 = 1
inv : p22 + p23 + p24 - p280 - p281 = 0
inv : p0 + p266 + p267 + p268 + p269 + p270 + p271 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 = 1
Total of 57 invariants.
[2020-05-12 02:31:47] [INFO ] Computed 57 place invariants in 35 ms
[2020-05-12 02:31:47] [INFO ] Removed a total of 70 redundant transitions.
[2020-05-12 02:31:47] [INFO ] Flatten gal took : 88 ms
[2020-05-12 02:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-12 02:31:47] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 7 ms
[2020-05-12 02:31:47] [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 5 LTL properties
Checking formula 0 : !((F(G(F(X(X(G(((X("((i11.i0.u62.p153==0)||(i3.i0.u11.p29==1))"))||("(i11.i0.u62.p153==0)"))||("(i3.i0.u11.p29==1)")))))))))
Formula 0 simplified : !FGFXXG("(i3.i0.u11.p29==1)" | "(i11.i0.u62.p153==0)" | X"((i11.i0.u62.p153==0)||(i3.i0.u11.p29==1))")
built 60 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 19 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 49 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-12 02:31:48] [INFO ] Proved 367 variables to be positive in 1440 ms
[2020-05-12 02:31:48] [INFO ] Computing symmetric may disable matrix : 318 transitions.
[2020-05-12 02:31:48] [INFO ] Computation of disable matrix completed :0/318 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:31:48] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:31:48] [INFO ] Computing symmetric may enable matrix : 318 transitions.
[2020-05-12 02:31:48] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:31:50] [INFO ] Computing symmetric co enabling matrix : 318 transitions.
[2020-05-12 02:31:59] [INFO ] Computation of co-enabling matrix(1/318) took 9142 ms. Total solver calls (SAT/UNSAT): 440(15/425)
Reverse transition relation is NOT exact ! Due to transitions t244, t256, i0.t182, i0.u40.t201, i0.u44.t193, i0.u48.t185, i1.i0.u46.t189, i1.i1.t92, i1.i1.u106.t93, i2.t62, i2.u116.t66, i3.i0.t259, i3.i0.u10.t261, i3.i1.t172, i3.i1.u67.t173, i4.t233, i4.t231, i4.t229, i4.u27.t227, i4.u28.t225, i5.t217, i5.u31.t219, i6.t205, i6.u37.t207, i7.i0.u42.t197, i7.i1.t108, i7.i1.u99.t109, i8.i1.u50.t181, i9.i1.t104, i9.i1.u100.t105, i9.i2.t100, i9.i2.u102.t101, i9.i3.t96, i9.i3.u105.t97, i10.i1.t124, i10.i1.u90.t125, i10.i2.t116, i10.i2.u94.t117, i10.i3.t112, i10.i3.u97.t113, i11.i1.t175, i11.i1.u65.t176, i11.i2.t168, i11.i2.u69.t169, i11.i3.t160, i11.i3.u72.t161, i11.i4.t156, i11.i4.u75.t157, i12.i0.t249, i12.i0.u17.t247, i12.i1.t164, i12.i1.u70.t165, i13.i0.t250, i13.i0.u8.t264, i13.i0.u14.t253, i13.i1.t255, i13.i1.u15.t251, i14.t152, i14.u76.t153, i15.i1.t148, i15.i1.u79.t149, i15.i2.t136, i15.i2.u84.t137, i15.i3.t132, i15.i3.u87.t133, i16.i0.u20.t241, i16.i0.u22.t237, i16.i1.t243, i16.i1.u21.t239, i16.i2.t144, i16.i2.u81.t145, i17.t140, i17.u83.t141, i18.t51, i18.u122.t55, i19.i0.u29.t223, i19.i1.t128, i19.i1.u89.t129, i20.i0.t211, i20.i0.u34.t213, i20.i1.t120, i20.i1.u93.t121, i21.t76, i21.t74, i21.t71, i21.t69, i21.t64, i21.t60, i21.t58, i21.t53, i21.t49, i21.t40, i21.t36, i21.t33, i21.t31, i21.t28, i21.t26, i21.t23, i21.t21, i21.t18, i21.t15, i21.t12, i21.t9, i21.t6, i21.t3, i21.u108.t1, i22.t44, i22.t42, i22.t38, i22.u127.t46, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/208/110/318
[2020-05-12 02:32:03] [INFO ] Computation of co-enabling matrix(2/318) took 13620 ms. Total solver calls (SAT/UNSAT): 591(30/561)
Computing Next relation with stutter on 24 deadlock states
[2020-05-12 02:32:07] [INFO ] Computation of co-enabling matrix(3/318) took 17906 ms. Total solver calls (SAT/UNSAT): 741(45/696)
[2020-05-12 02:32:11] [INFO ] Computation of co-enabling matrix(4/318) took 21336 ms. Total solver calls (SAT/UNSAT): 894(58/836)
[2020-05-12 02:32:15] [INFO ] Computation of co-enabling matrix(5/318) took 25517 ms. Total solver calls (SAT/UNSAT): 1042(73/969)
89 unique states visited
88 strongly connected components in search stack
91 transitions explored
89 items max in DFS search stack
3171 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,31.7627,710656,1,0,1.19363e+06,556,4995,2.17389e+06,245,1033,2389373
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((F((("((i19.i1.u88.p216==0)||(i9.i3.u105.p257==1))")U(F("(i21.u141.p342==1)")))&&(X("((i15.i2.u85.p210==0)||(i13.i0.u9.p22==1))"))))&&((X("((i15.i2.u85.p210!=0)&&(i13.i0.u9.p22!=1))"))||("(i21.u141.p342==1)")))))
Formula 1 simplified : !X(F(("((i19.i1.u88.p216==0)||(i9.i3.u105.p257==1))" U F"(i21.u141.p342==1)") & X"((i15.i2.u85.p210==0)||(i13.i0.u9.p22==1))") & ("(i21.u141.p342==1)" | X"((i15.i2.u85.p210!=0)&&(i13.i0.u9.p22!=1))"))
Computing Next relation with stutter on 24 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
55 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,32.3188,733668,1,0,1.24394e+06,584,5048,2.23334e+06,246,1305,2527390
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(!(G(F(G(!(X("((i12.i0.u121.p300==0)||(i16.i2.u80.p200==1))")))))))))
Formula 2 simplified : !G!GFG!X"((i12.i0.u121.p300==0)||(i16.i2.u80.p200==1))"
Computing Next relation with stutter on 24 deadlock states
173 unique states visited
0 strongly connected components in search stack
174 transitions explored
88 items max in DFS search stack
23 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,32.5584,739708,1,0,1.25994e+06,584,5085,2.24352e+06,246,1305,2561733
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-05-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X((G("((i10.i2.u94.p234==0)||(i21.u110.p276==1))"))&&("((i11.i3.u73.p176==0)||(i20.i0.u34.p83==1))")))))
Formula 3 simplified : X("((i11.i3.u73.p176==0)||(i20.i0.u34.p83==1))" & G"((i10.i2.u94.p234==0)||(i21.u110.p276==1))")
Computing Next relation with stutter on 24 deadlock states
[2020-05-12 02:32:19] [INFO ] Computation of co-enabling matrix(6/318) took 29922 ms. Total solver calls (SAT/UNSAT): 1189(88/1101)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
487 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,37.4254,877516,1,0,1.53069e+06,586,5150,2.49719e+06,249,1339,3187111
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(X("((i21.u114.p284==0)||(i0.u48.p121==1))")))U(((X("((i0.u3.p9==0)||(i21.u140.p339==1))"))U("((i0.u3.p9!=0)&&(i21.u140.p339!=1))"))&&("((i21.u114.p284==0)||(i0.u48.p121==1))"))))
Formula 4 simplified : !(FX"((i21.u114.p284==0)||(i0.u48.p121==1))" U ("((i21.u114.p284==0)||(i0.u48.p121==1))" & (X"((i0.u3.p9==0)||(i21.u140.p339==1))" U "((i0.u3.p9!=0)&&(i21.u140.p339!=1))")))
Computing Next relation with stutter on 24 deadlock states
77 unique states visited
77 strongly connected components in search stack
77 transitions explored
77 items max in DFS search stack
60 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,38.022,896452,1,0,1.5797e+06,601,5243,2.54315e+06,250,1440,3292823
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-12 02:32:27] [INFO ] Computation of co-enabling matrix(8/318) took 36993 ms. Total solver calls (SAT/UNSAT): 1484(115/1369)
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:32:30] [INFO ] Built C files in 44078ms 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 1589250750972

--------------------
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-05"
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-05, 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-158897699100481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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