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.r156-oct2-158972913800266.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 RwMutex-PT-r0010w0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913800266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 3.7K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 12:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 12:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 9 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 23:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 172K Mar 24 05:38 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 RwMutex-PT-r0010w0100-00
FORMULA_NAME RwMutex-PT-r0010w0100-01
FORMULA_NAME RwMutex-PT-r0010w0100-02
FORMULA_NAME RwMutex-PT-r0010w0100-03
FORMULA_NAME RwMutex-PT-r0010w0100-04
FORMULA_NAME RwMutex-PT-r0010w0100-05
FORMULA_NAME RwMutex-PT-r0010w0100-06
FORMULA_NAME RwMutex-PT-r0010w0100-07
FORMULA_NAME RwMutex-PT-r0010w0100-08
FORMULA_NAME RwMutex-PT-r0010w0100-09
FORMULA_NAME RwMutex-PT-r0010w0100-10
FORMULA_NAME RwMutex-PT-r0010w0100-11
FORMULA_NAME RwMutex-PT-r0010w0100-12
FORMULA_NAME RwMutex-PT-r0010w0100-13
FORMULA_NAME RwMutex-PT-r0010w0100-14
FORMULA_NAME RwMutex-PT-r0010w0100-15

=== Now, execution of the tool begins

BK_START 1589887644458

[2020-05-19 11:27:25] [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 11:27:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 11:27:26] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2020-05-19 11:27:26] [INFO ] Transformed 230 places.
[2020-05-19 11:27:26] [INFO ] Transformed 220 transitions.
[2020-05-19 11:27:26] [INFO ] Parsed PT model containing 230 places and 220 transitions in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 41130 steps, including 0 resets, run visited all 55 properties in 242 ms. (steps per millisecond=169 )
[2020-05-19 11:27:26] [INFO ] Flatten gal took : 72 ms
[2020-05-19 11:27:26] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 11:27:26] [INFO ] Applying decomposition
[2020-05-19 11:27:26] [INFO ] Flatten gal took : 32 ms
[2020-05-19 11:27:26] [INFO ] Input system was already deterministic with 220 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/graph4688039496727805172.txt, -o, /tmp/graph4688039496727805172.bin, -w, /tmp/graph4688039496727805172.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/graph4688039496727805172.bin, -l, -1, -v, -w, /tmp/graph4688039496727805172.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 11:27:26] [INFO ] Decomposing Gal with order
[2020-05-19 11:27:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 11:27:27] [INFO ] Removed a total of 1980 redundant transitions.
[2020-05-19 11:27:27] [INFO ] Flatten gal took : 91 ms
[2020-05-19 11:27:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 28 ms.
[2020-05-19 11:27:27] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-19 11:27:27] [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]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 220 rows 230 cols

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 16 LTL properties
[2020-05-19 11:27:27] [INFO ] Computed 120 place invariants in 20 ms
inv : p101 + p221 = 1
inv : p196 + p76 = 1
inv : p187 + p67 = 1
inv : p110 + p230 = 1
inv : p191 + p71 = 1
inv : p106 + p226 = 1
inv : p173 + p53 = 1
inv : p216 + p96 = 1
inv : p169 + p49 = 1
inv : p1 + p113 + p123 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p1 + p117 + p127 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p164 + p44 = 1
inv : p140 + p20 = 1
inv : p204 + p84 = 1
inv : p1 + p112 + p122 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p213 + p93 = 1
inv : p142 + p22 = 1
inv : p170 + p50 = 1
inv : p161 + p41 = 1
inv : p139 + p19 = 1
inv : p115 + p5 = 1
inv : p1 + p118 + p128 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p148 + p28 = 1
inv : p207 + p87 = 1
inv : p150 + p30 = 1
inv : p194 + p74 = 1
inv : p182 + p62 = 1
inv : p214 + p94 = 1
inv : p143 + p23 = 1
inv : p185 + p65 = 1
inv : p167 + p47 = 1
inv : p149 + p29 = 1
inv : p200 + p80 = 1
inv : p1 + p114 + p124 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p112 + p2 = 1
inv : p180 + p60 = 1
inv : p11 + p121 = 1
inv : p199 + p79 = 1
inv : p162 + p42 = 1
inv : p193 + p73 = 1
inv : p12 + p132 = 1
inv : p1 + p120 + p130 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p154 + p34 = 1
inv : p135 + p15 = 1
inv : p117 + p7 = 1
inv : p206 + p86 = 1
inv : p189 + p69 = 1
inv : p114 + p4 = 1
inv : p157 + p37 = 1
inv : p186 + p66 = 1
inv : p102 + p222 = 1
inv : p172 + p52 = 1
inv : p1 + p111 = 1
inv : p209 + p89 = 1
inv : p137 + p17 = 1
inv : p1 + p116 + p126 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p211 + p91 = 1
inv : p217 + p97 = 1
inv : p105 + p225 = 1
inv : p178 + p58 = 1
inv : p108 + p228 = 1
inv : p146 + p26 = 1
inv : p175 + p55 = 1
inv : p119 + p9 = 1
inv : p141 + p21 = 1
inv : p147 + p27 = 1
inv : p156 + p36 = 1
inv : p208 + p88 = 1
inv : p212 + p92 = 1
inv : p151 + p31 = 1
inv : p179 + p59 = 1
inv : p183 + p63 = 1
inv : p174 + p54 = 1
inv : p203 + p83 = 1
inv : p13 + p133 = 1
inv : p107 + p227 = 1
inv : p190 + p70 = 1
inv : p215 + p95 = 1
inv : p188 + p68 = 1
inv : p201 + p81 = 1
inv : p159 + p39 = 1
inv : p177 + p57 = 1
inv : p116 + p6 = 1
inv : p165 + p45 = 1
inv : p1 + p119 + p129 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p197 + p77 = 1
inv : p100 + p220 = 1
inv : p153 + p33 = 1
inv : p168 + p48 = 1
inv : p219 + p99 = 1
inv : p158 + p38 = 1
inv : p176 + p56 = 1
inv : p103 + p223 = 1
inv : p205 + p85 = 1
inv : p144 + p24 = 1
inv : p145 + p25 = 1
inv : p198 + p78 = 1
inv : p118 + p8 = 1
inv : p109 + p229 = 1
inv : p134 + p14 = 1
inv : p138 + p18 = 1
inv : p210 + p90 = 1
inv : p218 + p98 = 1
inv : p10 + p120 = 1
inv : p104 + p224 = 1
inv : p171 + p51 = 1
inv : p152 + p32 = 1
inv : p1 + p121 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p181 + p61 = 1
inv : p113 + p3 = 1
inv : p184 + p64 = 1
inv : p195 + p75 = 1
inv : p155 + p35 = 1
inv : p166 + p46 = 1
inv : p202 + p82 = 1
inv : p192 + p72 = 1
inv : p163 + p43 = 1
inv : p136 + p16 = 1
inv : p1 + p115 + p125 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p160 + p40 = 1
Total of 120 invariants.
[2020-05-19 11:27:27] [INFO ] Computed 120 place invariants in 21 ms
Checking formula 0 : !(((F(("(i9.u71.p222<1)")U("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u17.p18>=1))")))&&(X(G("(i4.u3.p228>=1)")))))
Formula 0 simplified : !(F("(i9.u71.p222<1)" U "(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u17.p18>=1))") & XG"(i4.u3.p228>=1)")
built 31 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.091918,18848,1,0,1191,207,3640,938,76,190,7023
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((!(X(X("(u75.p226>=1)"))))U(F("((((((((((((u75.p106>=1)&&(i3.u6.p122>=1))&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))||(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i7.u34.p17>=1)))")))&&(G(!(X("(u75.p226>=1)"))))))
Formula 1 simplified : !((!XX"(u75.p226>=1)" U F"((((((((((((u75.p106>=1)&&(i3.u6.p122>=1))&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))||(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i7.u34.p17>=1)))") & G!X"(u75.p226>=1)")
4 unique states visited
4 strongly connected components in search stack
5 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,0.097162,19372,1,0,1254,207,3721,1025,76,190,7550
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(("(i7.u83.p153>=1)")&&((("(i7.u83.p153>=1)")U(G(F("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i5.u60.p85>=1))"))))||((("(i5.u4.p229>=1)")U(G("(i5.u4.p229>=1)")))&&("(u88.p166>=1)"))))))
Formula 2 simplified : !F("(i7.u83.p153>=1)" & (("(i7.u83.p153>=1)" U GF"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i5.u60.p85>=1))") | ("(u88.p166>=1)" & ("(i5.u4.p229>=1)" U G"(i5.u4.p229>=1)"))))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.105446,20632,1,0,1444,207,3807,1104,76,190,8723
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(((G("(u80.p147>=1)"))U("(i5.u26.p158>=1)"))U(F(("(i5.u26.p158>=1)")U(X(X("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i5.u52.p74>=1))")))))))))
Formula 3 simplified : !FG((G"(u80.p147>=1)" U "(i5.u26.p158>=1)") U F("(i5.u26.p158>=1)" U XX"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i5.u52.p74>=1))"))
4 unique states visited
4 strongly connected components in search stack
5 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,0.108999,20916,1,0,1569,207,3827,1175,76,190,9238
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((G(X(X(F(G((F("(i8.u11.p118>=1)"))&&("(i0.u0.p1>=1)")))))))||((((((((((((X("(i8.u92.p173>=1)"))&&("(i3.u6.p122>=1)"))&&("(i4.u7.p123>=1)"))&&("(i5.u8.p124>=1)"))&&("(i6.u9.p125>=1)"))&&("(i0.u94.p126>=1)"))&&("(i7.u10.p127>=1)"))&&("(i8.u11.p128>=1)"))&&("(i9.u12.p129>=1)"))&&("(i1.u1.p130>=1)"))&&("(i2.u5.p131>=1)"))&&("(i9.u93.p56>=1)")))))
Formula 4 simplified : !G(GXXFG("(i0.u0.p1>=1)" & F"(i8.u11.p118>=1)") | ("(i0.u94.p126>=1)" & "(i1.u1.p130>=1)" & "(i2.u5.p131>=1)" & "(i3.u6.p122>=1)" & "(i4.u7.p123>=1)" & "(i5.u8.p124>=1)" & "(i6.u9.p125>=1)" & "(i7.u10.p127>=1)" & "(i8.u11.p128>=1)" & "(i9.u12.p129>=1)" & "(i9.u93.p56>=1)" & X"(i8.u92.p173>=1)"))
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,0.808638,28000,1,0,2015,207,3946,1325,78,190,11172
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G("(i7.u96.p187>=1)"))))
Formula 5 simplified : !FG"(i7.u96.p187>=1)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.818185,28000,1,0,2950,207,3968,1919,78,190,13976
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X((G("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i7.u83.p33>=1))"))||("((i7.u10.p127>=1)&&(i7.u10.p7>=1))")))U(F(G(X(F(G("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i7.u83.p33>=1))"))))))))
Formula 6 simplified : !(X("((i7.u10.p127>=1)&&(i7.u10.p7>=1))" | G"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i7.u83.p33>=1))") U FGXFG"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i7.u83.p33>=1))")
3 unique states visited
3 strongly connected components in search stack
4 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,0.820769,28000,1,0,2974,207,4003,1947,78,190,14155
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F((X("(((((((((((i4.u69.p100>=1)&&(i3.u6.p122>=1))&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))"))&&("(((((((((((i3.u6.p122<1)||(i4.u7.p123<1))||(i5.u8.p124<1))||(i6.u9.p125<1))||(i0.u94.p126<1))||(i7.u10.p127<1))||(i8.u11.p128<1))||(i9.u12.p129<1))||(i1.u1.p130<1))||(i2.u5.p131<1))||(u50.p72<1))")))))
Formula 7 simplified : F("(((((((((((i3.u6.p122<1)||(i4.u7.p123<1))||(i5.u8.p124<1))||(i6.u9.p125<1))||(i0.u94.p126<1))||(i7.u10.p127<1))||(i8.u11.p128<1))||(i9.u12.p129<1))||(i1.u1.p130<1))||(i2.u5.p131<1))||(u50.p72<1))" & X"(((((((((((i4.u69.p100>=1)&&(i3.u6.p122>=1))&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,0.828008,28000,1,0,3687,207,4083,2351,78,190,16619
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((G((G((G(X("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i5.u26.p38>=1))")))||("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i5.u26.p38>=1))")))||(!(X("(u29.p162>=1)")))))||(X("(u29.p162>=1)")))))
Formula 8 simplified : !X(X"(u29.p162>=1)" | G(G("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i5.u26.p38>=1))" | GX"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i5.u26.p38>=1))") | !X"(u29.p162>=1)"))
8 unique states visited
7 strongly connected components in search stack
10 transitions explored
8 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,0.836807,28000,1,0,3952,207,4174,2458,78,190,18545
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u31.p45>=1))")U("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u98.p71>=1))"))U("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u31.p45>=1))"))U((((((((((((("((((((((((((((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u98.p71>=1))&&(i3.u6.p122>=1))&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u31.p45>=1))")U("(u85.p156>=1)"))&&("(i3.u6.p122>=1)"))&&("(i4.u7.p123>=1)"))&&("(i5.u8.p124>=1)"))&&("(i6.u9.p125>=1)"))&&("(i0.u94.p126>=1)"))&&("(i7.u10.p127>=1)"))&&("(i8.u11.p128>=1)"))&&("(i9.u12.p129>=1)"))&&("(i1.u1.p130>=1)"))&&("(i2.u5.p131>=1)"))&&("(u98.p71>=1)"))))
Formula 9 simplified : !((("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u31.p45>=1))" U "(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u98.p71>=1))") U "(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u31.p45>=1))") U ("(i0.u94.p126>=1)" & "(i1.u1.p130>=1)" & "(i2.u5.p131>=1)" & "(i3.u6.p122>=1)" & "(i4.u7.p123>=1)" & "(i5.u8.p124>=1)" & "(i6.u9.p125>=1)" & "(i7.u10.p127>=1)" & "(i8.u11.p128>=1)" & "(i9.u12.p129>=1)" & "(u98.p71>=1)" & ("((((((((((((((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u98.p71>=1))&&(i3.u6.p122>=1))&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u31.p45>=1))" U "(u85.p156>=1)")))
[2020-05-19 11:27:28] [INFO ] Proved 230 variables to be positive in 1209 ms
[2020-05-19 11:27:28] [INFO ] Computing symmetric may disable matrix : 220 transitions.
[2020-05-19 11:27:28] [INFO ] Computation of disable matrix completed :0/220 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 11:27:28] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 11:27:28] [INFO ] Computing symmetric may enable matrix : 220 transitions.
[2020-05-19 11:27:28] [INFO ] Computation of Complete enable matrix. took 14 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
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,5.05616,33588,1,0,4068,207,4573,2458,89,190,20024
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(X(!(F(!(X("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i1.u67.p99>=1))"))))))))
Formula 10 simplified : X!F!X"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i1.u67.p99>=1))"
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,5.05772,33588,1,0,4078,207,4600,2499,89,190,20207
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0100-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G((X(("(i1.u1.p120>=1)")U("((i1.u1.p120>=1)||(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u45.p65>=1)))")))&&(("(i8.u23.p151>=1)")U(X("(i8.u23.p151>=1)"))))))
Formula 11 simplified : !G(X("(i1.u1.p120>=1)" U "((i1.u1.p120>=1)||(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u45.p65>=1)))") & ("(i8.u23.p151>=1)" U X"(i8.u23.p151>=1)"))
4 unique states visited
4 strongly connected components in search stack
5 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,5.06074,33588,1,0,4308,207,4630,2630,89,190,21173
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X((F(("(i3.u6.p112>=1)")U("(u48.p139>=1)")))U(G("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u40.p59>=1))")))))
Formula 12 simplified : !X(F("(i3.u6.p112>=1)" U "(u48.p139>=1)") U G"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u40.p59>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,5.06385,33588,1,0,4338,207,4654,2630,89,190,21537
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(!(X(X((F((!(F("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u21.p28>=1))")))&&("(i4.u89.p169>=1)")))||(F("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u50.p72>=1))"))))))))
Formula 13 simplified : !X!XX(F("(i4.u89.p169>=1)" & !F"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u21.p28>=1))") | F"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(u50.p72>=1))")
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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,5.06791,33588,1,0,4524,207,4678,2730,89,190,22528
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((X(X(G("(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i3.u82.p32>=1))"))))&&(X(X(("(i3.u36.p174>=1)")U("(i9.u93.p176>=1)"))))))
Formula 14 simplified : !(XXG"(((((((((((i3.u6.p122>=1)&&(i4.u7.p123>=1))&&(i5.u8.p124>=1))&&(i6.u9.p125>=1))&&(i0.u94.p126>=1))&&(i7.u10.p127>=1))&&(i8.u11.p128>=1))&&(i9.u12.p129>=1))&&(i1.u1.p130>=1))&&(i2.u5.p131>=1))&&(i3.u82.p32>=1))" & XX("(i3.u36.p174>=1)" U "(i9.u93.p176>=1)"))
5 unique states visited
5 strongly connected components in search stack
5 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,5.07036,33588,1,0,4524,207,4762,2738,89,190,22676
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((G("(i4.u28.p161>=1)"))U(F("(i4.u28.p161>=1)"))))
Formula 15 simplified : !(G"(i4.u28.p161>=1)" U F"(i4.u28.p161>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.07207,33588,1,0,4679,207,4778,2843,89,190,23375
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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 11:27:32] [INFO ] Built C files in 5705ms 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 1589887652608

--------------------
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="RwMutex-PT-r0010w0100"
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 RwMutex-PT-r0010w0100, 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 r156-oct2-158972913800266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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