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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 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 25K 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.4K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 91K 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-08-00
FORMULA_NAME BusinessProcesses-PT-08-01
FORMULA_NAME BusinessProcesses-PT-08-02
FORMULA_NAME BusinessProcesses-PT-08-03
FORMULA_NAME BusinessProcesses-PT-08-04
FORMULA_NAME BusinessProcesses-PT-08-05
FORMULA_NAME BusinessProcesses-PT-08-06
FORMULA_NAME BusinessProcesses-PT-08-07
FORMULA_NAME BusinessProcesses-PT-08-08
FORMULA_NAME BusinessProcesses-PT-08-09
FORMULA_NAME BusinessProcesses-PT-08-10
FORMULA_NAME BusinessProcesses-PT-08-11
FORMULA_NAME BusinessProcesses-PT-08-12
FORMULA_NAME BusinessProcesses-PT-08-13
FORMULA_NAME BusinessProcesses-PT-08-14
FORMULA_NAME BusinessProcesses-PT-08-15

=== Now, execution of the tool begins

BK_START 1589251298902

[2020-05-12 02:41:41] [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:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:41:42] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2020-05-12 02:41:42] [INFO ] Transformed 393 places.
[2020-05-12 02:41:42] [INFO ] Transformed 344 transitions.
[2020-05-12 02:41:42] [INFO ] Found NUPN structural information;
[2020-05-12 02:41:42] [INFO ] Parsed PT model containing 393 places and 344 transitions in 202 ms.
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 13 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 66 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 855 resets, run finished after 343 ms. (steps per millisecond=291 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1]
// Phase 1: matrix 331 rows 380 cols
[2020-05-12 02:41:42] [INFO ] Computed 58 place invariants in 12 ms
[2020-05-12 02:41:42] [INFO ] [Real]Absence check using 44 positive place invariants in 67 ms returned sat
[2020-05-12 02:41:42] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-12 02:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:43] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2020-05-12 02:41:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:41:43] [INFO ] [Nat]Absence check using 44 positive place invariants in 58 ms returned sat
[2020-05-12 02:41:43] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-12 02:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:44] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 12 places in 84 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 26 places in 56 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 19 places in 52 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 23 places in 169 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 19 places in 48 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 16 places in 53 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 28 places in 58 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2020-05-12 02:41:45] [INFO ] Deduced a trap composed of 26 places in 39 ms
[2020-05-12 02:41:46] [INFO ] Deduced a trap composed of 16 places in 62 ms
[2020-05-12 02:41:46] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2020-05-12 02:41:46] [INFO ] Deduced a trap composed of 27 places in 55 ms
[2020-05-12 02:41:46] [INFO ] Deduced a trap composed of 29 places in 46 ms
[2020-05-12 02:41:46] [INFO ] Deduced a trap composed of 39 places in 75 ms
[2020-05-12 02:41:46] [INFO ] Deduced a trap composed of 25 places in 53 ms
[2020-05-12 02:41:46] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1525 ms
[2020-05-12 02:41:46] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 21 ms.
[2020-05-12 02:41:48] [INFO ] Added : 236 causal constraints over 48 iterations in 1536 ms. Result :sat
[2020-05-12 02:41:48] [INFO ] [Real]Absence check using 44 positive place invariants in 35 ms returned sat
[2020-05-12 02:41:48] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-12 02:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:48] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2020-05-12 02:41:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:41:48] [INFO ] [Nat]Absence check using 44 positive place invariants in 48 ms returned sat
[2020-05-12 02:41:48] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 15 ms returned sat
[2020-05-12 02:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:49] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2020-05-12 02:41:49] [INFO ] Deduced a trap composed of 22 places in 132 ms
[2020-05-12 02:41:49] [INFO ] Deduced a trap composed of 12 places in 78 ms
[2020-05-12 02:41:49] [INFO ] Deduced a trap composed of 85 places in 85 ms
[2020-05-12 02:41:49] [INFO ] Deduced a trap composed of 8 places in 304 ms
[2020-05-12 02:41:50] [INFO ] Deduced a trap composed of 14 places in 91 ms
[2020-05-12 02:41:53] [INFO ] Deduced a trap composed of 20 places in 3784 ms
[2020-05-12 02:41:54] [INFO ] Deduced a trap composed of 19 places in 278 ms
[2020-05-12 02:41:54] [INFO ] Deduced a trap composed of 92 places in 84 ms
[2020-05-12 02:41:54] [INFO ] Deduced a trap composed of 19 places in 127 ms
[2020-05-12 02:41:54] [INFO ] Deduced a trap composed of 94 places in 82 ms
[2020-05-12 02:41:54] [INFO ] Deduced a trap composed of 31 places in 93 ms
[2020-05-12 02:41:54] [INFO ] Deduced a trap composed of 25 places in 86 ms
[2020-05-12 02:41:54] [INFO ] Deduced a trap composed of 16 places in 111 ms
[2020-05-12 02:41:54] [INFO ] Deduced a trap composed of 24 places in 66 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 26 places in 70 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 28 places in 94 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 24 places in 40 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 34 places in 38 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 29 places in 55 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 22 places in 53 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 41 places in 54 ms
[2020-05-12 02:41:55] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6233 ms
[2020-05-12 02:41:55] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 25 ms.
[2020-05-12 02:41:57] [INFO ] Added : 228 causal constraints over 46 iterations in 1587 ms. Result :sat
[2020-05-12 02:41:57] [INFO ] [Real]Absence check using 44 positive place invariants in 181 ms returned sat
[2020-05-12 02:41:57] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-12 02:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:57] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-05-12 02:41:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:41:57] [INFO ] [Nat]Absence check using 44 positive place invariants in 34 ms returned sat
[2020-05-12 02:41:57] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 16 ms returned sat
[2020-05-12 02:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:58] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 13 places in 89 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 13 places in 82 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 21 places in 100 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 31 places in 137 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 27 places in 168 ms
[2020-05-12 02:41:59] [INFO ] Deduced a trap composed of 33 places in 176 ms
[2020-05-12 02:41:59] [INFO ] Deduced a trap composed of 20 places in 114 ms
[2020-05-12 02:41:59] [INFO ] Deduced a trap composed of 28 places in 127 ms
[2020-05-12 02:41:59] [INFO ] Deduced a trap composed of 24 places in 92 ms
[2020-05-12 02:41:59] [INFO ] Deduced a trap composed of 33 places in 86 ms
[2020-05-12 02:41:59] [INFO ] Deduced a trap composed of 22 places in 67 ms
[2020-05-12 02:41:59] [INFO ] Deduced a trap composed of 19 places in 68 ms
[2020-05-12 02:41:59] [INFO ] Deduced a trap composed of 16 places in 99 ms
[2020-05-12 02:42:00] [INFO ] Deduced a trap composed of 27 places in 217 ms
[2020-05-12 02:42:00] [INFO ] Deduced a trap composed of 32 places in 103 ms
[2020-05-12 02:42:00] [INFO ] Deduced a trap composed of 32 places in 58 ms
[2020-05-12 02:42:00] [INFO ] Deduced a trap composed of 34 places in 63 ms
[2020-05-12 02:42:00] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2020-05-12 02:42:00] [INFO ] Deduced a trap composed of 32 places in 391 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 30 places in 434 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 34 places in 79 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 33 places in 179 ms
[2020-05-12 02:42:01] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3547 ms
[2020-05-12 02:42:01] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 27 ms.
[2020-05-12 02:42:03] [INFO ] Added : 244 causal constraints over 49 iterations in 1403 ms. Result :sat
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 90 places in 274 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 95 places in 87 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 95 places in 121 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 95 places in 167 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 97 places in 157 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 91 places in 153 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 99 places in 218 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 96 places in 788 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 92 places in 103 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 93 places in 101 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 98 places in 652 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 98 places in 78 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 96 places in 93 ms
[2020-05-12 02:42:07] [INFO ] Deduced a trap composed of 90 places in 1003 ms
[2020-05-12 02:42:08] [INFO ] Deduced a trap composed of 97 places in 84 ms
[2020-05-12 02:42:08] [INFO ] Deduced a trap composed of 91 places in 90 ms
[2020-05-12 02:42:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5158 ms
[2020-05-12 02:42:08] [INFO ] [Real]Absence check using 44 positive place invariants in 77 ms returned sat
[2020-05-12 02:42:08] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-12 02:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:09] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-05-12 02:42:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:42:09] [INFO ] [Nat]Absence check using 44 positive place invariants in 87 ms returned unsat
[2020-05-12 02:42:09] [INFO ] [Real]Absence check using 44 positive place invariants in 202 ms returned sat
[2020-05-12 02:42:09] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-12 02:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:09] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2020-05-12 02:42:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:42:10] [INFO ] [Nat]Absence check using 44 positive place invariants in 38 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-12 02:42:10] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-12 02:42:10] [INFO ] Flatten gal took : 116 ms
FORMULA BusinessProcesses-PT-08-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:42:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-12 02:42:10] [INFO ] Flatten gal took : 37 ms
[2020-05-12 02:42:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-08-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 02:42:10] [INFO ] Applying decomposition
[2020-05-12 02:42:10] [INFO ] Flatten gal took : 81 ms
[2020-05-12 02:42:10] [INFO ] Input system was already deterministic with 331 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/graph3240041117669686527.txt, -o, /tmp/graph3240041117669686527.bin, -w, /tmp/graph3240041117669686527.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/graph3240041117669686527.bin, -l, -1, -v, -w, /tmp/graph3240041117669686527.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:42:10] [INFO ] Decomposing Gal with order
[2020-05-12 02:42:10] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 331 rows 380 cols
[2020-05-12 02:42:10] [INFO ] Computed 58 place invariants in 5 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p25 + p26 + p301 + p302 + p303 + p304 + p307 + p308 + p309 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p93 + p94 + p95 + p368 + p369 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p41 + p42 + p43 + p323 + p324 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p99 + p100 + p101 + p372 + p373 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p384 + p385 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p234 + p235 + p236 + p237 + p238 = 1
inv : p21 + p22 + p23 + p24 + p27 + p28 - p301 - p302 - p303 - p304 - p307 - p308 - p309 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p364 + p365 = 1
inv : p102 + p103 + p104 - p372 - p373 = 0
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p184 + p186 + p187 + p188 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p346 + p347 = 1
inv : p0 + p1 + p2 + p3 + p4 + p134 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p264 + p265 + p266 + p267 + p268 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p244 + p245 + p246 + p247 + p248 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p254 + p255 + p256 + p257 + p258 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p199 + p200 + p201 + p202 + p203 = 1
inv : p35 + p36 + p39 + p40 - p314 - p315 - p318 - p319 - p320 = 0
inv : p91 + p92 - p364 - p365 = 0
inv : p44 + p45 + p46 - p323 - p324 = 0
inv : p0 + p289 + p290 + p291 + p292 + p293 + p294 + 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 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p179 + p181 + p182 + p183 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p120 + p121 + p122 + p388 + p389 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p29 + p30 + p31 + p312 + p313 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p354 + p355 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p130 = 1
inv : p0 + p1 + p146 + p147 + p148 + p274 + p275 + p276 + p277 + p278 = 1
inv : p71 + p72 - p346 - p347 = 0
inv : p0 + p1 + p2 + p142 + p143 + p144 + p145 = 1
inv : p61 + p62 + p63 - p338 - p339 = 0
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p209 + p210 + p211 + p212 + p213 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p34 + p37 + p38 + p314 + p315 + p318 + p319 + p320 = 1
inv : p0 + p48 + p49 + p50 + p51 + p52 + p53 + p56 + p57 + p289 + p290 + p291 + p292 + p293 + p294 + 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 + p331 + p332 + 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 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 = 1
inv : p0 + p1 + p146 + p147 + p279 + p280 + p281 + p282 + p283 = 1
inv : p108 + p109 + p110 - p376 - p377 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p105 + p106 + p107 + p376 + p377 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p224 + p225 + p226 + p227 + p228 = 1
inv : p80 + p81 - p354 - p355 = 0
inv : p0 + p1 + p146 + p284 + p285 + p286 + p287 + p288 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p194 + p195 + p196 + p197 + p198 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p204 + p205 + p206 + p207 + p208 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p126 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p259 + p260 + p261 + p262 + p263 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p174 + p175 + p176 + p177 + p178 = 1
inv : p96 + p97 + p98 - p368 - p369 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p47 + p54 + p55 - p289 - p290 - p291 - p292 - p293 - p294 - 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 - p331 - p332 - 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 - p368 - p369 - p370 - p371 - p372 - p373 - p374 - p375 - p376 - p377 - p378 - p379 - p380 - p381 - p382 - p383 - p384 - p385 - p386 - p387 - p388 - p389 - p390 - p391 - p392 = 0
inv : p123 + p124 + p125 - p388 - p389 = 0
inv : p118 + p119 - p384 - p385 = 0
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p219 + p220 + p221 + p222 + p223 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p229 + p230 + p231 + p232 + p233 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p269 + p270 + p271 + p272 + p273 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p239 + p240 + p241 + p242 + p243 = 1
inv : p32 + p33 - p312 - p313 = 0
inv : p0 + p1 + p2 + p3 + p138 + p139 + p140 + p141 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p58 + p59 + p60 + p338 + p339 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p214 + p215 + p216 + p217 + p218 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p189 + p191 + p192 + p193 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p249 + p250 + p251 + p252 + p253 = 1
Total of 58 invariants.
[2020-05-12 02:42:10] [INFO ] Computed 58 place invariants in 6 ms
[2020-05-12 02:42:11] [INFO ] Removed a total of 83 redundant transitions.
[2020-05-12 02:42:11] [INFO ] Flatten gal took : 74 ms
[2020-05-12 02:42:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-12 02:42:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 12 ms
[2020-05-12 02:42:11] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], 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 6 LTL properties
Checking formula 0 : !((G(X(X("(((i17.u118.p306!=0)&&(i17.u118.p306!=1))||((i6.i1.u94.p240!=0)&&(i17.u132.p336!=1)))")))))
Formula 0 simplified : !GXX"(((i17.u118.p306!=0)&&(i17.u118.p306!=1))||((i6.i1.u94.p240!=0)&&(i17.u132.p336!=1)))"
built 57 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 24 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 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 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 53 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 21 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
[2020-05-12 02:42:11] [INFO ] Proved 380 variables to be positive in 843 ms
[2020-05-12 02:42:11] [INFO ] Computing symmetric may disable matrix : 331 transitions.
[2020-05-12 02:42:11] [INFO ] Computation of disable matrix completed :0/331 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:42:11] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:42:11] [INFO ] Computing symmetric may enable matrix : 331 transitions.
[2020-05-12 02:42:11] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:42:12] [INFO ] Computing symmetric co enabling matrix : 331 transitions.
[2020-05-12 02:42:14] [INFO ] Computation of co-enabling matrix(6/331) took 2501 ms. Total solver calls (SAT/UNSAT): 1252(103/1149)
[2020-05-12 02:42:20] [INFO ] Computation of co-enabling matrix(8/331) took 7748 ms. Total solver calls (SAT/UNSAT): 1566(132/1434)
[2020-05-12 02:42:23] [INFO ] Computation of co-enabling matrix(9/331) took 11615 ms. Total solver calls (SAT/UNSAT): 1718(150/1568)
Reverse transition relation is NOT exact ! Due to transitions t203, t277, i0.u41.t226, i0.u43.t222, i1.i0.u26.t256, i1.i1.t136, i1.i1.u92.t137, i2.i0.t285, i2.i0.t287, i2.i0.u13.t281, i2.i1.t276, i2.i1.u18.t272, i2.i2.u12.t283, i2.i2.u17.t274, i3.t63, i3.u122.t67, i4.u19.t270, i5.t266, i5.t264, i5.t262, i5.u24.t260, i5.u25.t258, i6.i0.t240, i6.i0.t242, i6.i0.u32.t244, i6.i1.t132, i6.i1.u94.t133, i7.i2.t152, i7.i2.u83.t153, i7.i3.t140, i7.i3.u90.t141, i7.i4.t128, i7.i4.u95.t129, i7.i5.t124, i7.i5.u98.t125, i8.i1.t168, i8.i1.u76.t169, i8.i2.t164, i8.i2.u78.t165, i8.i3.t160, i8.i3.u79.t161, i8.i4.t156, i8.i4.u81.t157, i9.i0.t187, i9.i0.u68.t188, i9.i1.t184, i9.i1.u70.t185, i10.i0.t230, i10.i0.t234, i10.i0.t236, i10.i0.u38.t232, i10.i1.t116, i10.i1.u101.t117, i11.i0.u14.t280, i11.i1.t148, i11.i1.u85.t149, i11.i2.t108, i11.i2.u105.t109, i12.i0.t248, i12.i0.t250, i12.i0.u28.t252, i12.i1.t144, i12.i1.u87.t145, i13.t120, i13.u99.t121, i14.i0.u45.t218, i14.i1.t210, i14.i1.t212, i14.i1.u47.t214, i14.i2.t112, i14.i2.u104.t113, i15.i0.t104, i15.i0.u108.t105, i15.i1.t100, i15.i1.u110.t101, i16.i0.u51.t206, i16.i1.u54.t193, i16.i2.t96, i16.i2.u112.t97, i17.t80, i17.t74, i17.t70, i17.t65, i17.t61, i17.t52, i17.t48, i17.t45, i17.t43, i17.t41, i17.t38, i17.t36, i17.t34, i17.t31, i17.t29, i17.t27, i17.t25, i17.t22, i17.t19, i17.t16, i17.t13, i17.t11, i17.t9, i17.t6, i17.t3, i17.u113.t1, i18.t76, i18.t72, i18.u116.t78, i19.t56, i19.t54, i19.t50, i19.u127.t58, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/219/112/331
Computing Next relation with stutter on 26 deadlock states
[2020-05-12 02:42:27] [INFO ] Computation of co-enabling matrix(17/331) took 15442 ms. Total solver calls (SAT/UNSAT): 2906(279/2627)
[2020-05-12 02:42:31] [INFO ] Computation of co-enabling matrix(22/331) took 18655 ms. Total solver calls (SAT/UNSAT): 3615(360/3255)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1995 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,20.0029,494700,1,0,860519,504,5276,1.736e+06,258,881,1762191
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(F("(i14.i1.u47.p111==0)"))))))
Formula 1 simplified : !XXXF"(i14.i1.u47.p111==0)"
Computing Next relation with stutter on 26 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 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,20.0047,495016,1,0,860519,504,5300,1.736e+06,259,881,1762212
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-08-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(G(!(X(X("((i8.i1.u76.p195==0)||(i8.i4.u81.p211==1))"))))))))
Formula 2 simplified : !XFG!XX"((i8.i1.u76.p195==0)||(i8.i4.u81.p211==1))"
Computing Next relation with stutter on 26 deadlock states
[2020-05-12 02:42:34] [INFO ] Computation of co-enabling matrix(27/331) took 21885 ms. Total solver calls (SAT/UNSAT): 4304(439/3865)
[2020-05-12 02:42:37] [INFO ] Computation of co-enabling matrix(29/331) took 25322 ms. Total solver calls (SAT/UNSAT): 4569(475/4094)
[2020-05-12 02:42:40] [INFO ] Computation of co-enabling matrix(34/331) took 28410 ms. Total solver calls (SAT/UNSAT): 5221(553/4668)
[2020-05-12 02:42:43] [INFO ] Computation of co-enabling matrix(43/331) took 31575 ms. Total solver calls (SAT/UNSAT): 6326(702/5624)
[2020-05-12 02:42:46] [INFO ] Computation of co-enabling matrix(60/331) took 34592 ms. Total solver calls (SAT/UNSAT): 7988(837/7151)
[2020-05-12 02:42:51] [INFO ] Computation of co-enabling matrix(79/331) took 39550 ms. Total solver calls (SAT/UNSAT): 9811(1046/8765)
[2020-05-12 02:42:55] [INFO ] Computation of co-enabling matrix(81/331) took 43406 ms. Total solver calls (SAT/UNSAT): 9972(1105/8867)
[2020-05-12 02:42:59] [INFO ] Computation of co-enabling matrix(84/331) took 46978 ms. Total solver calls (SAT/UNSAT): 10206(1160/9046)
[2020-05-12 02:43:02] [INFO ] Computation of co-enabling matrix(87/331) took 50600 ms. Total solver calls (SAT/UNSAT): 10431(1236/9195)
[2020-05-12 02:43:05] [INFO ] Computation of co-enabling matrix(97/331) took 53609 ms. Total solver calls (SAT/UNSAT): 11198(1311/9887)
[2020-05-12 02:43:09] [INFO ] Computation of co-enabling matrix(118/331) took 56629 ms. Total solver calls (SAT/UNSAT): 11807(1311/10496)
[2020-05-12 02:43:12] [INFO ] Computation of co-enabling matrix(129/331) took 60089 ms. Total solver calls (SAT/UNSAT): 12094(1311/10783)
[2020-05-12 02:43:15] [INFO ] Computation of co-enabling matrix(141/331) took 63304 ms. Total solver calls (SAT/UNSAT): 12331(1311/11020)
[2020-05-12 02:43:18] [INFO ] Computation of co-enabling matrix(157/331) took 66362 ms. Total solver calls (SAT/UNSAT): 12563(1311/11252)
[2020-05-12 02:43:21] [INFO ] Computation of co-enabling matrix(179/331) took 69401 ms. Total solver calls (SAT/UNSAT): 12729(1311/11418)
[2020-05-12 02:43:26] [INFO ] Computation of co-enabling matrix(191/331) took 73626 ms. Total solver calls (SAT/UNSAT): 13180(1340/11840)
[2020-05-12 02:43:29] [INFO ] Computation of co-enabling matrix(205/331) took 76746 ms. Total solver calls (SAT/UNSAT): 13625(1385/12240)
[2020-05-12 02:43:32] [INFO ] Computation of co-enabling matrix(245/331) took 79754 ms. Total solver calls (SAT/UNSAT): 14266(1544/12722)
[2020-05-12 02:43:35] [INFO ] Computation of co-enabling matrix(254/331) took 82803 ms. Total solver calls (SAT/UNSAT): 14659(1668/12991)
[2020-05-12 02:43:38] [INFO ] Computation of co-enabling matrix(288/331) took 86065 ms. Total solver calls (SAT/UNSAT): 14984(1738/13246)
[2020-05-12 02:43:42] [INFO ] Computation of co-enabling matrix(293/331) took 89690 ms. Total solver calls (SAT/UNSAT): 15179(1778/13401)
[2020-05-12 02:43:45] [INFO ] Computation of co-enabling matrix(299/331) took 92801 ms. Total solver calls (SAT/UNSAT): 15380(1826/13554)
[2020-05-12 02:43:48] [INFO ] Computation of co-enabling matrix(307/331) took 95862 ms. Total solver calls (SAT/UNSAT): 15592(1849/13743)
[2020-05-12 02:43:51] [INFO ] Computation of co-enabling matrix(316/331) took 99010 ms. Total solver calls (SAT/UNSAT): 15754(1898/13856)
[2020-05-12 02:43:53] [INFO ] Computation of Finished co-enabling matrix. took 101308 ms. Total solver calls (SAT/UNSAT): 15845(1943/13902)
[2020-05-12 02:43:53] [INFO ] Computing Do-Not-Accords matrix : 331 transitions.
[2020-05-12 02:43:54] [INFO ] Computation of Completed DNA matrix. took 843 ms. Total solver calls (SAT/UNSAT): 65(0/65)
[2020-05-12 02:43:54] [INFO ] Built C files in 103901ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 8566 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 558 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>([](!( X(X((LTLAP2==true)))) ))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>([](!( X(X((LTLAP2==true)))) ))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>([](!( X(X((LTLAP2==true)))) ))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
159 unique states visited
159 strongly connected components in search stack
160 transitions explored
159 items max in DFS search stack
12361 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,143.618,1405508,1,0,2.10034e+06,511,5356,5.66008e+06,260,1184,2771482
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X("((i17.u125.p321==0)||(i11.i0.u15.p32==1))"))))
Formula 3 simplified : X"((i17.u125.p321==0)||(i11.i0.u15.p32==1))"
Computing Next relation with stutter on 26 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,143.625,1405772,1,0,2.1005e+06,511,5365,5.66018e+06,261,1184,2772452
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(X(F("(i10.i0.u39.p89==0)"))))||(G("(i10.i0.u39.p89==0)"))))
Formula 4 simplified : !(XXF"(i10.i0.u39.p89==0)" | G"(i10.i0.u39.p89==0)")
Computing Next relation with stutter on 26 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,143.626,1405772,1,0,2.1005e+06,511,5388,5.66018e+06,261,1184,2772486
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-08-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((F("(i2.i1.u16.p35==1)"))U(X(F(!(G("((i16.i2.u111.p284==0)||(i3.u122.p315==1))"))))))))
Formula 5 simplified : !F(F"(i2.i1.u16.p35==1)" U XF!G"((i16.i2.u111.p284==0)||(i3.u122.p315==1))")
Computing Next relation with stutter on 26 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,143.633,1405772,1,0,2.10068e+06,511,5445,5.66046e+06,261,1184,2773777
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589251486194

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

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