fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r036-smll-158901930900330
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for CloudDeployment-PT-6a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15739.190 71828.00 111713.00 493.20 FFFFFFFFFFFFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r036-smll-158901930900330.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudDeployment-PT-6a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r036-smll-158901930900330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:53 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:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 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 317K 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 CloudDeployment-PT-6a-00
FORMULA_NAME CloudDeployment-PT-6a-01
FORMULA_NAME CloudDeployment-PT-6a-02
FORMULA_NAME CloudDeployment-PT-6a-03
FORMULA_NAME CloudDeployment-PT-6a-04
FORMULA_NAME CloudDeployment-PT-6a-05
FORMULA_NAME CloudDeployment-PT-6a-06
FORMULA_NAME CloudDeployment-PT-6a-07
FORMULA_NAME CloudDeployment-PT-6a-08
FORMULA_NAME CloudDeployment-PT-6a-09
FORMULA_NAME CloudDeployment-PT-6a-10
FORMULA_NAME CloudDeployment-PT-6a-11
FORMULA_NAME CloudDeployment-PT-6a-12
FORMULA_NAME CloudDeployment-PT-6a-13
FORMULA_NAME CloudDeployment-PT-6a-14
FORMULA_NAME CloudDeployment-PT-6a-15

=== Now, execution of the tool begins

BK_START 1589906473818

[2020-05-19 16:41:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-19 16:41:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 16:41:17] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2020-05-19 16:41:17] [INFO ] Transformed 221 places.
[2020-05-19 16:41:17] [INFO ] Transformed 908 transitions.
[2020-05-19 16:41:17] [INFO ] Found NUPN structural information;
[2020-05-19 16:41:17] [INFO ] Parsed PT model containing 221 places and 908 transitions in 386 ms.
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1119 resets, run finished after 937 ms. (steps per millisecond=106 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
[2020-05-19 16:41:18] [INFO ] Flow matrix only has 384 transitions (discarded 410 similar events)
// Phase 1: matrix 384 rows 221 cols
[2020-05-19 16:41:18] [INFO ] Computed 36 place invariants in 26 ms
[2020-05-19 16:41:18] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 61 ms returned sat
[2020-05-19 16:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:19] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2020-05-19 16:41:19] [INFO ] State equation strengthened by 182 read => feed constraints.
[2020-05-19 16:41:19] [INFO ] [Real]Added 182 Read/Feed constraints in 52 ms returned sat
[2020-05-19 16:41:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 16:41:19] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 101 ms returned sat
[2020-05-19 16:41:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:20] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2020-05-19 16:41:20] [INFO ] [Nat]Added 182 Read/Feed constraints in 83 ms returned sat
[2020-05-19 16:41:20] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 107 ms.
[2020-05-19 16:41:22] [INFO ] Added : 193 causal constraints over 39 iterations in 2335 ms. Result :sat
[2020-05-19 16:41:22] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 38 ms returned sat
[2020-05-19 16:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:23] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2020-05-19 16:41:23] [INFO ] [Real]Added 182 Read/Feed constraints in 53 ms returned sat
[2020-05-19 16:41:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 16:41:23] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 226 ms returned sat
[2020-05-19 16:41:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:23] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2020-05-19 16:41:23] [INFO ] [Nat]Added 182 Read/Feed constraints in 56 ms returned sat
[2020-05-19 16:41:23] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 65 ms.
[2020-05-19 16:41:26] [INFO ] Added : 200 causal constraints over 40 iterations in 2409 ms. Result :sat
[2020-05-19 16:41:26] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 47 ms returned sat
[2020-05-19 16:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:26] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2020-05-19 16:41:26] [INFO ] [Real]Added 182 Read/Feed constraints in 49 ms returned sat
[2020-05-19 16:41:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 16:41:27] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 291 ms returned sat
[2020-05-19 16:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:27] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2020-05-19 16:41:27] [INFO ] [Nat]Added 182 Read/Feed constraints in 68 ms returned sat
[2020-05-19 16:41:27] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 78 ms.
[2020-05-19 16:41:29] [INFO ] Added : 191 causal constraints over 39 iterations in 1542 ms. Result :sat
[2020-05-19 16:41:29] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 25 ms returned sat
[2020-05-19 16:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:29] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2020-05-19 16:41:29] [INFO ] [Real]Added 182 Read/Feed constraints in 41 ms returned sat
[2020-05-19 16:41:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 16:41:30] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 286 ms returned sat
[2020-05-19 16:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:30] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2020-05-19 16:41:30] [INFO ] [Nat]Added 182 Read/Feed constraints in 57 ms returned sat
[2020-05-19 16:41:30] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 65 ms.
[2020-05-19 16:41:33] [INFO ] Added : 197 causal constraints over 40 iterations in 2205 ms. Result :sat
[2020-05-19 16:41:33] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 36 ms returned sat
[2020-05-19 16:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:33] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2020-05-19 16:41:33] [INFO ] [Real]Added 182 Read/Feed constraints in 87 ms returned sat
[2020-05-19 16:41:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 16:41:33] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 85 ms returned sat
[2020-05-19 16:41:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:34] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2020-05-19 16:41:34] [INFO ] [Nat]Added 182 Read/Feed constraints in 108 ms returned sat
[2020-05-19 16:41:34] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 63 ms.
[2020-05-19 16:41:36] [INFO ] Added : 203 causal constraints over 41 iterations in 2016 ms. Result :sat
[2020-05-19 16:41:36] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 34 ms returned sat
[2020-05-19 16:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:36] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2020-05-19 16:41:36] [INFO ] [Real]Added 182 Read/Feed constraints in 88 ms returned sat
[2020-05-19 16:41:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 16:41:37] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 176 ms returned sat
[2020-05-19 16:41:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:37] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2020-05-19 16:41:37] [INFO ] [Nat]Added 182 Read/Feed constraints in 55 ms returned sat
[2020-05-19 16:41:37] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 61 ms.
[2020-05-19 16:41:56] [INFO ] Added : 374 causal constraints over 125 iterations in 18710 ms. Result :sat
[2020-05-19 16:41:56] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 26 ms returned sat
[2020-05-19 16:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:56] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2020-05-19 16:41:56] [INFO ] [Real]Added 182 Read/Feed constraints in 64 ms returned sat
[2020-05-19 16:41:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 16:41:57] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 91 ms returned sat
[2020-05-19 16:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 16:41:57] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2020-05-19 16:41:57] [INFO ] [Nat]Added 182 Read/Feed constraints in 103 ms returned sat
[2020-05-19 16:41:57] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 60 ms.
[2020-05-19 16:42:00] [INFO ] Added : 202 causal constraints over 41 iterations in 2415 ms. Result :sat
[2020-05-19 16:42:00] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 37 ms returned sat
[2020-05-19 16:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 16:42:00] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2020-05-19 16:42:00] [INFO ] [Real]Added 182 Read/Feed constraints in 62 ms returned sat
[2020-05-19 16:42:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 16:42:00] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 93 ms returned sat
[2020-05-19 16:42:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 16:42:01] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2020-05-19 16:42:01] [INFO ] [Nat]Added 182 Read/Feed constraints in 83 ms returned sat
[2020-05-19 16:42:01] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 63 ms.
[2020-05-19 16:42:03] [INFO ] Added : 200 causal constraints over 40 iterations in 2166 ms. Result :sat
[2020-05-19 16:42:03] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 35 ms returned sat
[2020-05-19 16:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 16:42:04] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2020-05-19 16:42:04] [INFO ] [Real]Added 182 Read/Feed constraints in 43 ms returned sat
[2020-05-19 16:42:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 16:42:04] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 87 ms returned sat
[2020-05-19 16:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 16:42:04] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2020-05-19 16:42:04] [INFO ] [Nat]Added 182 Read/Feed constraints in 70 ms returned sat
[2020-05-19 16:42:04] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 58 ms.
[2020-05-19 16:42:07] [INFO ] Added : 197 causal constraints over 40 iterations in 2263 ms. Result :sat
[2020-05-19 16:42:07] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-19 16:42:07] [INFO ] Flatten gal took : 268 ms
FORMULA CloudDeployment-PT-6a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 16:42:07] [INFO ] Flatten gal took : 172 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 16:42:08] [INFO ] Applying decomposition
[2020-05-19 16:42:08] [INFO ] Flatten gal took : 71 ms
[2020-05-19 16:42:08] [INFO ] Input system was already deterministic with 794 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/graph16860537416641213573.txt, -o, /tmp/graph16860537416641213573.bin, -w, /tmp/graph16860537416641213573.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/graph16860537416641213573.bin, -l, -1, -v, -w, /tmp/graph16860537416641213573.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 16:42:08] [INFO ] Decomposing Gal with order
[2020-05-19 16:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 384 out of 794 initially.
// Phase 1: matrix 384 rows 221 cols
[2020-05-19 16:42:09] [INFO ] Computed 36 place invariants in 8 ms
inv : p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 - p169 - p219 - p220 = 0
inv : p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p209 + p210 - p219 - p220 = 0
inv : p57 - p169 = 0
inv : p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 - p219 - p220 = 0
inv : p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 - p169 - p219 - p220 = 0
inv : p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p211 + p212 - p219 - p220 = 0
inv : p141 - p169 = 0
inv : p3 - p169 = 0
inv : p32 - p219 - p220 = 0
inv : p85 - p169 = 0
inv : p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 - p169 - p219 - p220 = 0
inv : p116 - p219 - p220 = 0
inv : p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p215 + p216 - p219 - p220 = 0
inv : p88 - p219 - p220 = 0
inv : p60 - p219 - p220 = 0
inv : p114 - p219 - p220 = 0
inv : p31 - p169 = 0
inv : p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 - p169 - p219 - p220 = 0
inv : p113 - p169 = 0
inv : p2 - p219 - p220 = 0
inv : p86 - p219 - p220 = 0
inv : p59 - p169 = 0
inv : p30 - p219 - p220 = 0
inv : p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 - p169 - p219 - p220 = 0
inv : p1 - p169 = 0
inv : p142 - p219 - p220 = 0
inv : p87 - p169 = 0
inv : p58 - p219 - p220 = 0
inv : p143 - p169 = 0
inv : p144 - p219 - p220 = 0
inv : p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 - p169 - p219 - p220 = 0
inv : p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p213 + p214 - p219 - p220 = 0
inv : p4 - p219 - p220 = 0
inv : p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p217 + p218 - p219 - p220 = 0
inv : p115 - p169 = 0
inv : p29 - p169 = 0
Total of 36 invariants.
[2020-05-19 16:42:09] [INFO ] Computed 36 place invariants in 10 ms
[2020-05-19 16:42:09] [INFO ] Removed a total of 892 redundant transitions.
[2020-05-19 16:42:09] [INFO ] Flatten gal took : 453 ms
[2020-05-19 16:42:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 43 ms.
[2020-05-19 16:42:09] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 15 ms
[2020-05-19 16:42:09] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !(((G(X(((G("((((u59.p30==1)&&(u59.p32==1))&&(i2.u14.p56==1))&&(u59.p181==1))"))&&("(i5.i0.u22.p92==1)"))||("((u59.p60==1)&&(i3.i0.u15.p64==1))"))))&&(X(G((X("((((u59.p30==1)&&(u59.p32==1))&&(i2.u14.p56==1))&&(u59.p181==1))"))&&("(i5.i0.u22.p92==1)"))))))
Formula 0 simplified : !(GX("((u59.p60==1)&&(i3.i0.u15.p64==1))" | ("(i5.i0.u22.p92==1)" & G"((((u59.p30==1)&&(u59.p32==1))&&(i2.u14.p56==1))&&(u59.p181==1))")) & XG("(i5.i0.u22.p92==1)" & X"((((u59.p30==1)&&(u59.p32==1))&&(i2.u14.p56==1))&&(u59.p181==1))"))
built 57 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 29 ordering constraints for composite.
built 17 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
[2020-05-19 16:42:09] [INFO ] Proved 221 variables to be positive in 840 ms
[2020-05-19 16:42:09] [INFO ] Computing symmetric may disable matrix : 794 transitions.
[2020-05-19 16:42:09] [INFO ] Computation of disable matrix completed :0/794 took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t237, t806, t817, t828, t839, t850, t861, u59.t2, i0.t231, i0.t230, i0.t212, i0.i0.t221, i0.i0.t226, i0.i0.u3.t695, i0.i1.t234, i0.i1.u6.t198, i1.t187, i1.t182, i1.t173, i1.u11.t710, i2.t191, i2.t160, i2.u7.t192, i2.u14.t159, i3.t153, i3.t152, i3.t134, i3.i0.t143, i3.i0.t148, i3.i0.u18.t679, i3.i1.t156, i3.i1.u21.t120, i5.t114, i5.t113, i5.t95, i5.i0.t104, i5.i0.t109, i5.i0.u25.t743, i5.i1.t117, i5.i1.u28.t81, i6.t56, i6.i0.t65, i6.i0.t70, i6.i0.u32.t637, i6.i1.t74, i6.i1.t78, i6.i1.u34.t75, i6.i1.u36.t42, i7.t36, i7.t35, i7.t17, i7.i0.t26, i7.i0.t31, i7.i0.u40.t794, i7.i1.t4, i7.i1.u43.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/440/56/496
Computing Next relation with stutter on 2 deadlock states
[2020-05-19 16:42:10] [INFO ] Computation of Complete disable matrix. took 169 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 16:42:10] [INFO ] Computing symmetric may enable matrix : 794 transitions.
[2020-05-19 16:42:10] [INFO ] Computation of Complete enable matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
85 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,0.936778,35608,1,0,33849,1269,4806,59356,1828,4139,87189
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((G(!(G("((u59.p4==1)&&(u59.p116==1))"))))U(((F("((u59.p142==1)&&(u45.p180==1))"))&&("(u59.p2==1)"))&&("(u59.p60==1)")))&&(G(F(G("((u59.p142==1)&&(u45.p180==1))"))))))
Formula 1 simplified : !((G!G"((u59.p4==1)&&(u59.p116==1))" U ("(u59.p2==1)" & "(u59.p60==1)" & F"((u59.p142==1)&&(u45.p180==1))")) & GFG"((u59.p142==1)&&(u45.p180==1))")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5 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,0.989885,38192,1,0,36750,1269,4859,63980,1844,4172,92873
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(F(X(X(F("(((((u59.p142==1)&&(u59.p144==1))&&(i7.i1.u42.p164==1))&&(u59.p206==1))&&(u59.p219==1))"))))))))
Formula 2 simplified : !XGFXXF"(((((u59.p142==1)&&(u59.p144==1))&&(i7.i1.u42.p164==1))&&(u59.p206==1))&&(u59.p219==1))"
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,0.997433,38192,1,0,37048,1273,4906,64739,1855,4192,93558
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(("(i7.i0.u39.p154==1)")U(F(G(!(G(("((((u59.p58==1)&&(u59.p60==1))&&(i3.i1.u21.p84==1))&&(i2.u57.p215==1))")U(("(i3.i1.u19.p76==1)")U(X("(i7.i0.u39.p154==1)")))))))))))
Formula 3 simplified : !G("(i7.i0.u39.p154==1)" U FG!G("((((u59.p58==1)&&(u59.p60==1))&&(i3.i1.u21.p84==1))&&(i2.u57.p215==1))" U ("(i3.i1.u19.p76==1)" U X"(i7.i0.u39.p154==1)")))
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
4 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
25 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,1.25084,46348,1,0,53780,1453,5050,95475,1860,5655,129677
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((("(((((u59.p30!=1)||(u59.p32!=1))||(i1.u12.p45!=1))||(u59.p206!=1))||(u59.p219!=1))")U(!(F((F("(((((u59.p86==1)&&(u59.p88==1))&&(i5.i0.u22.p90==1))&&(u59.p206==1))&&(u59.p219==1))"))||("((u59.p60==1)&&(i3.i0.u15.p62==1))")))))||(G("((u59.p60==1)&&(i3.i0.u15.p62==1))")))||(F("((u59.p114==1)&&(u44.p173==1))"))))
Formula 4 simplified : !(("(((((u59.p30!=1)||(u59.p32!=1))||(i1.u12.p45!=1))||(u59.p206!=1))||(u59.p219!=1))" U !F("((u59.p60==1)&&(i3.i0.u15.p62==1))" | F"(((((u59.p86==1)&&(u59.p88==1))&&(i5.i0.u22.p90==1))&&(u59.p206==1))&&(u59.p219==1))")) | G"((u59.p60==1)&&(i3.i0.u15.p62==1))" | F"((u59.p114==1)&&(u44.p173==1))")
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
566 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,6.9172,218476,1,0,385857,1619,5285,572858,1877,8920,626053
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F((G("(((((u59.p58==1)&&(u59.p60==1))&&(i3.i0.u15.p64==1))&&(u59.p206==1))&&(u59.p219==1))"))||("(((((u59.p30==1)&&(u59.p32==1))&&(i2.u7.p50==1))&&(u59.p206==1))&&(u59.p219==1))")))&&((!(G(F("(((((u59.p58==1)&&(u59.p60==1))&&(i3.i0.u18.p72==1))&&(u59.p206==1))&&(u59.p219==1))"))))U("(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1))"))))
Formula 5 simplified : !(F("(((((u59.p30==1)&&(u59.p32==1))&&(i2.u7.p50==1))&&(u59.p206==1))&&(u59.p219==1))" | G"(((((u59.p58==1)&&(u59.p60==1))&&(i3.i0.u15.p64==1))&&(u59.p206==1))&&(u59.p219==1))") & (!GF"(((((u59.p58==1)&&(u59.p60==1))&&(i3.i0.u18.p72==1))&&(u59.p206==1))&&(u59.p219==1))" U "(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1))"))
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
142 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,8.339,257020,1,0,461856,1629,5394,695244,1887,9209,802107
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(("((((((u59.p142==1)&&(u59.p144==1))&&(i7.i1.u43.p166==1))&&(u59.p206==1))&&(u59.p219==1))||(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1)))")||((("(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1))")U(X("(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1))")))&&((G("((((u59.p58==1)&&(u59.p60==1))&&(i3.i1.u21.p84==1))&&(i2.u54.p209==1))"))||(F("((u59.p2==1)&&(u59.p144==1))")))))))
Formula 6 simplified : !X("((((((u59.p142==1)&&(u59.p144==1))&&(i7.i1.u43.p166==1))&&(u59.p206==1))&&(u59.p219==1))||(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1)))" | (("(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1))" U X"(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1))") & (G"((((u59.p58==1)&&(u59.p60==1))&&(i3.i1.u21.p84==1))&&(i2.u54.p209==1))" | F"((u59.p2==1)&&(u59.p144==1))")))
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
17 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,8.5132,262828,1,0,473948,1635,5452,713662,1893,9326,819675
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(("((((((u59.p142==1)&&(u59.p144==1))&&(i7.i0.u40.p156==1))&&(u59.p206==1))&&(u59.p219==1))&&(i3.i0.u17.p70==1))")U(F((F("(((((u59.p114==1)&&(u59.p116==1))&&(i6.i1.u36.p140==1))&&(i2.u57.p215==1))&&(i3.i0.u17.p70==1))"))||(!(X("(i3.i0.u17.p70!=1)"))))))))
Formula 7 simplified : "((((((u59.p142==1)&&(u59.p144==1))&&(i7.i0.u40.p156==1))&&(u59.p206==1))&&(u59.p219==1))&&(i3.i0.u17.p70==1))" U F(F"(((((u59.p114==1)&&(u59.p116==1))&&(i6.i1.u36.p140==1))&&(i2.u57.p215==1))&&(i3.i0.u17.p70==1))" | !X"(i3.i0.u17.p70!=1)")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
196 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,10.462,310612,1,0,570717,1702,5507,856507,1895,9787,993181
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(((((((X("(((((u59.p2==1)&&(u59.p4==1))&&(i0.i1.u4.p17==1))&&(u59.p206==1))&&(u59.p219==1))"))||("(u59.p86!=1)"))||("(u59.p88!=1)"))||("(i5.i1.u27.p109!=1)"))||("(u59.p206!=1)"))||("(u59.p219!=1)"))U("((((((u59.p2==1)&&(u59.p4==1))&&(i0.i1.u4.p17==1))&&(u59.p206==1))&&(u59.p219==1))&&(i5.i0.u22.p92==1))"))))
Formula 8 simplified : ("(i5.i1.u27.p109!=1)" | "(u59.p86!=1)" | "(u59.p88!=1)" | "(u59.p206!=1)" | "(u59.p219!=1)" | X"(((((u59.p2==1)&&(u59.p4==1))&&(i0.i1.u4.p17==1))&&(u59.p206==1))&&(u59.p219==1))") U "((((((u59.p2==1)&&(u59.p4==1))&&(i0.i1.u4.p17==1))&&(u59.p206==1))&&(u59.p219==1))&&(i5.i0.u22.p92==1))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
116 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,11.6347,350740,1,0,657262,1719,5645,958737,1919,10003,1134860
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((X("(i5.i0.u22.p90==1)"))||((X(F("(((((u59.p58==1)&&(u59.p60==1))&&(i3.i1.u20.p78==1))&&(u59.p206==1))&&(u59.p219==1))")))&&(("(i5.i0.u22.p90==1)")U(X("((((u59.p114==1)&&(u59.p116==1))&&(i6.i1.u36.p140==1))&&(i2.u54.p209==1))")))))U("((((u59.p114==1)&&(u59.p116==1))&&(i6.i1.u36.p140==1))&&(i2.u54.p209==1))")))
Formula 9 simplified : !((X"(i5.i0.u22.p90==1)" | (XF"(((((u59.p58==1)&&(u59.p60==1))&&(i3.i1.u20.p78==1))&&(u59.p206==1))&&(u59.p219==1))" & ("(i5.i0.u22.p90==1)" U X"((((u59.p114==1)&&(u59.p116==1))&&(i6.i1.u36.p140==1))&&(i2.u54.p209==1))"))) U "((((u59.p114==1)&&(u59.p116==1))&&(i6.i1.u36.p140==1))&&(i2.u54.p209==1))")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
120 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,12.8337,387964,1,0,730124,1720,5694,1.04709e+06,1919,10065,1276908
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(X(G((("(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1))")U(F("(i5.i0.u25.p99==1)")))U(!(F(!(X(G(X("(i5.i0.u25.p99==1)"))))))))))))
Formula 10 simplified : !GXG(("(((((u59.p86==1)&&(u59.p88==1))&&(i5.i1.u27.p109==1))&&(u59.p206==1))&&(u59.p219==1))" U F"(i5.i0.u25.p99==1)") U !F!XGX"(i5.i0.u25.p99==1)")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
2 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,12.8577,388492,1,0,731101,1720,5764,1.04884e+06,1919,10072,1279802
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F((G(X(F(G("(i0.i1.u5.p22==1)")))))||(X("(i0.i1.u5.p22==1)"))))))
Formula 11 simplified : !GF(GXFG"(i0.i1.u5.p22==1)" | X"(i0.i1.u5.p22==1)")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 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,12.8875,389284,1,0,732927,1720,5826,1.052e+06,1920,10076,1283617
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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-19 16:42:24] [INFO ] Built C files in 16370ms 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 1589906545646

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="CloudDeployment-PT-6a"
export BK_EXAMINATION="LTLFireability"
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 CloudDeployment-PT-6a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r036-smll-158901930900330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6a.tgz
mv CloudDeployment-PT-6a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;