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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 63K 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-03-00
FORMULA_NAME BusinessProcesses-PT-03-01
FORMULA_NAME BusinessProcesses-PT-03-02
FORMULA_NAME BusinessProcesses-PT-03-03
FORMULA_NAME BusinessProcesses-PT-03-04
FORMULA_NAME BusinessProcesses-PT-03-05
FORMULA_NAME BusinessProcesses-PT-03-06
FORMULA_NAME BusinessProcesses-PT-03-07
FORMULA_NAME BusinessProcesses-PT-03-08
FORMULA_NAME BusinessProcesses-PT-03-09
FORMULA_NAME BusinessProcesses-PT-03-10
FORMULA_NAME BusinessProcesses-PT-03-11
FORMULA_NAME BusinessProcesses-PT-03-12
FORMULA_NAME BusinessProcesses-PT-03-13
FORMULA_NAME BusinessProcesses-PT-03-14
FORMULA_NAME BusinessProcesses-PT-03-15

=== Now, execution of the tool begins

BK_START 1589250201678

[2020-05-12 02:23:24] [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:23:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:23:24] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-05-12 02:23:24] [INFO ] Transformed 274 places.
[2020-05-12 02:23:24] [INFO ] Transformed 237 transitions.
[2020-05-12 02:23:24] [INFO ] Found NUPN structural information;
[2020-05-12 02:23:24] [INFO ] Parsed PT model containing 274 places and 237 transitions in 96 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1193 resets, run finished after 204 ms. (steps per millisecond=490 ) properties seen :[0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 236 rows 273 cols
[2020-05-12 02:23:24] [INFO ] Computed 43 place invariants in 13 ms
[2020-05-12 02:23:24] [INFO ] [Real]Absence check using 31 positive place invariants in 36 ms returned sat
[2020-05-12 02:23:24] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-05-12 02:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:25] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2020-05-12 02:23:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:23:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned unsat
[2020-05-12 02:23:25] [INFO ] [Real]Absence check using 31 positive place invariants in 51 ms returned sat
[2020-05-12 02:23:25] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2020-05-12 02:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:26] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2020-05-12 02:23:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:23:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned unsat
[2020-05-12 02:23:26] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2020-05-12 02:23:26] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-05-12 02:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:26] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2020-05-12 02:23:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:23:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned unsat
[2020-05-12 02:23:27] [INFO ] [Real]Absence check using 31 positive place invariants in 209 ms returned sat
[2020-05-12 02:23:27] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 10 ms returned sat
[2020-05-12 02:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:27] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2020-05-12 02:23:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:23:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned unsat
[2020-05-12 02:23:27] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2020-05-12 02:23:27] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 13 ms returned sat
[2020-05-12 02:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:27] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-05-12 02:23:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:23:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-12 02:23:27] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-05-12 02:23:27] [INFO ] Flatten gal took : 91 ms
FORMULA BusinessProcesses-PT-03-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:23:27] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 02:23:28] [INFO ] Applying decomposition
[2020-05-12 02:23:28] [INFO ] Flatten gal took : 27 ms
[2020-05-12 02:23:28] [INFO ] Input system was already deterministic with 236 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/graph14818790980666460006.txt, -o, /tmp/graph14818790980666460006.bin, -w, /tmp/graph14818790980666460006.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/graph14818790980666460006.bin, -l, -1, -v, -w, /tmp/graph14818790980666460006.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:23:28] [INFO ] Decomposing Gal with order
[2020-05-12 02:23:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:23:28] [INFO ] Removed a total of 48 redundant transitions.
[2020-05-12 02:23:28] [INFO ] Flatten gal took : 74 ms
[2020-05-12 02:23:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-12 02:23:28] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 16 ms
[2020-05-12 02:23:28] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 6 LTL properties
Checking formula 0 : !(((G(X(!(X("((i9.i0.u15.p41==0)||(i2.u10.p29==1))")))))U("((i2.u11.p31!=0)&&(i7.i1.u45.p118!=1))")))
Formula 0 simplified : !(GX!X"((i9.i0.u15.p41==0)||(i2.u10.p29==1))" U "((i2.u11.p31!=0)&&(i7.i1.u45.p118!=1))")
built 44 ordering constraints for composite.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 37 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 236 rows 273 cols
[2020-05-12 02:23:28] [INFO ] Computed 43 place invariants in 4 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p76 + p77 + p78 + p261 + p262 = 1
inv : p62 + p63 - p249 - p250 = 0
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p147 + p148 + p149 + p150 + p151 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p167 + p168 + p169 + p170 + p171 = 1
inv : p91 + p92 + p93 - p269 - p270 = 0
inv : p73 + p74 + p75 - p257 - p258 = 0
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p172 + p173 + p174 + p175 + p176 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p177 + p178 + p179 + p180 + p181 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p18 + p19 + p209 + p210 + p213 + p214 + p215 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p162 + p163 + p164 + p165 + p166 = 1
inv : p16 + p17 + p20 + p21 - p209 - p210 - p213 - p214 - p215 = 0
inv : p0 + p1 + p2 + p3 + p4 + p88 + p89 + p90 + p269 + p270 = 1
inv : p0 + p1 + p102 + p103 + p187 + p188 + p189 + p190 + p191 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p57 + p58 + p59 + p60 + p61 + p249 + p250 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p127 + p128 + p129 + p130 + p131 = 1
inv : p40 + p41 + p42 - p231 - p232 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p22 + p23 + p24 + p218 + p219 = 1
inv : p0 + p29 + p30 + p31 + p32 + p35 + p36 + p197 + p198 + p199 + p200 + p201 + p202 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p224 + p225 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p28 + p33 + p34 - p197 - p198 - p199 - p200 - p201 - p202 - p204 - p205 - p206 - p207 - p208 - p209 - p210 - p211 - p212 - p213 - p214 - p215 - p216 - p217 - p218 - p219 - p224 - p225 - p229 - p230 - p231 - p232 - p233 - p234 - p235 - p236 - p237 - p238 - p239 - p240 - p241 - p242 - p243 - p244 - p245 - p246 - p247 - p248 - p249 - p250 - p251 - p252 - p253 - p254 - p255 - p256 - p257 - p258 - p259 - p260 - p261 - p262 - p263 - p264 - p265 - p266 - p267 - p268 - p269 - p270 - p271 - p272 - p273 = 0
inv : p55 + p56 - p243 - p244 = 0
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p122 + p123 + p124 + p125 + p126 = 1
inv : p0 + p1 + p102 + p103 + p104 + p182 + p183 + p184 + p185 + p186 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p152 + p153 + p154 + p155 + p156 = 1
inv : p0 + p1 + p102 + p192 + p193 + p194 + p195 + p196 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p70 + p71 + p72 + p257 + p258 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p82 + p83 + p84 + p265 + p266 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p142 + p143 + p144 + p145 + p146 = 1
inv : p48 + p49 - p237 - p238 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p43 + p44 + p45 + p46 + p47 + p237 + p238 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p50 + p51 + p52 + p53 + p54 + p243 + p244 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 = 1
inv : p0 + p197 + p198 + p199 + p200 + p201 + p202 + 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 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 = 1
inv : p67 + p68 + p69 - p253 - p254 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p64 + p65 + p66 + p253 + p254 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p137 + p138 + p139 + p140 + p141 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p132 + p133 + p134 + p135 + p136 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p157 + p158 + p159 + p160 + p161 = 1
inv : p0 + p1 + p2 + p3 + p94 + p95 + p96 + p97 = 1
inv : p79 + p80 + p81 - p261 - p262 = 0
inv : p85 + p86 + p87 - p265 - p266 = 0
inv : p25 + p26 + p27 - p218 - p219 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p37 + p38 + p39 + p231 + p232 = 1
inv : p0 + p1 + p2 + p98 + p99 + p100 + p101 = 1
Total of 43 invariants.
[2020-05-12 02:23:28] [INFO ] Computed 43 place invariants in 5 ms
[2020-05-12 02:23:29] [INFO ] Proved 273 variables to be positive in 1129 ms
Reverse transition relation is NOT exact ! Due to transitions t137, t157, t163, t169, t179, t187, i0.i0.u25.t156, i0.i1.t123, i0.i1.u50.t124, i1.t195, i1.u7.t191, i2.t186, i2.t184, i2.u12.t182, i2.u13.t180, i3.i0.t160, i3.i0.u22.t162, i3.i1.t107, i3.i1.u57.t108, i4.t141, i4.u29.t148, i4.u31.t144, i5.i0.u33.t140, i5.i0.u35.t136, i5.i2.t71, i5.i2.u76.t72, i6.i1.t95, i6.i1.u63.t96, i6.i2.t87, i6.i2.u67.t88, i6.i3.t83, i6.i3.u70.t84, i7.i1.t130, i7.i1.u45.t131, i7.i2.t115, i7.i2.u53.t116, i7.i3.t111, i7.i3.u56.t112, i8.i0.u8.t190, i8.i1.t127, i8.i1.u48.t128, i9.i0.u6.t193, i9.i0.u14.t178, i9.i1.t119, i9.i1.u51.t120, i10.i0.t166, i10.i0.u19.t168, i10.i1.t103, i10.i1.u59.t104, i11.i0.t172, i11.i0.u16.t174, i11.i1.t99, i11.i1.u61.t100, i12.i0.u27.t152, i12.i1.t91, i12.i1.u66.t92, i13.i0.t79, i13.i0.u72.t80, i13.i1.t75, i13.i1.u74.t76, i14.t55, i14.t51, i14.t47, i14.t40, i14.t36, i14.t33, i14.t31, i14.t28, i14.t26, i14.t23, i14.t21, i14.t18, i14.t15, i14.t12, i14.t9, i14.t6, i14.t3, i14.u78.t1, i15.t49, i15.u81.t53, i16.t42, i16.t38, i16.u86.t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/153/83/236
[2020-05-12 02:23:30] [INFO ] Computing symmetric may disable matrix : 236 transitions.
[2020-05-12 02:23:30] [INFO ] Computation of disable matrix completed :0/236 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:23:30] [INFO ] Computation of Complete disable matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:23:30] [INFO ] Computing symmetric may enable matrix : 236 transitions.
[2020-05-12 02:23:30] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Computing Next relation with stutter on 18 deadlock states
[2020-05-12 02:23:30] [INFO ] Computing symmetric co enabling matrix : 236 transitions.
65 unique states visited
65 strongly connected components in search stack
65 transitions explored
65 items max in DFS search stack
331 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.35809,136340,1,0,258948,555,3796,365578,246,1091,581865
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((G(X("(i12.i0.u104.p258==1)")))U((F("(i12.i0.u104.p258==1)"))||(!(F("((i0.i0.u26.p67==0)||(i6.i3.u30.p79==1))")))))||(!(F("((i6.i2.u68.p172==0)||(i14.u96.p242==1))")))))
Formula 1 simplified : !((GX"(i12.i0.u104.p258==1)" U (F"(i12.i0.u104.p258==1)" | !F"((i0.i0.u26.p67==0)||(i6.i3.u30.p79==1))")) | !F"((i6.i2.u68.p172==0)||(i14.u96.p242==1))")
Computing Next relation with stutter on 18 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.43783,140600,1,0,267254,555,3894,372724,250,1091,594653
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G("((i5.i0.u35.p94==0)||(i14.u88.p225==1))"))))
Formula 2 simplified : !XG"((i5.i0.u35.p94==0)||(i14.u88.p225==1))"
Computing Next relation with stutter on 18 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.59746,147200,1,0,283073,604,3950,386226,250,1388,628608
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F("(i3.i0.u22.p59==1)")))
Formula 3 simplified : !F"(i3.i0.u22.p59==1)"
Computing Next relation with stutter on 18 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
42 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,4.01355,161192,1,0,308974,604,4002,413231,252,1388,676781
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(!(X(((("((i11.i0.u94.p238==0)||(i13.i1.u32.p87==1))")U("((i14.u101.p252==0)||(i14.u79.p202==1))"))&&("(i11.i0.u18.p49!=0)"))&&("(i12.i1.u65.p167!=1)")))))&&(G("((i11.i0.u94.p238==0)||(i13.i1.u32.p87==1))"))))
Formula 4 simplified : !(X!X("(i11.i0.u18.p49!=0)" & "(i12.i1.u65.p167!=1)" & ("((i11.i0.u94.p238==0)||(i13.i1.u32.p87==1))" U "((i14.u101.p252==0)||(i14.u79.p202==1))")) & G"((i11.i0.u94.p238==0)||(i13.i1.u32.p87==1))")
Computing Next relation with stutter on 18 deadlock states
[2020-05-12 02:23:33] [INFO ] Computation of co-enabling matrix(6/236) took 2228 ms. Total solver calls (SAT/UNSAT): 904(88/816)
67 unique states visited
67 strongly connected components in search stack
68 transitions explored
67 items max in DFS search stack
51 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,4.52716,178796,1,0,349413,608,4105,448933,254,1420,764003
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(!(G((G("((i14.u78.p200==0)||(i5.i0.u33.p88==1))"))U("(i6.i2.u67.p174==1)")))))))
Formula 5 simplified : !GF!G(G"((i14.u78.p200==0)||(i5.i0.u33.p88==1))" U "(i6.i2.u67.p174==1)")
Computing Next relation with stutter on 18 deadlock states
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 items max in DFS search stack
34 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,4.87224,194336,1,0,386203,616,4168,508377,255,1530,836247
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-12 02:23:34] [INFO ] Built C files in 6432ms 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 1589250214854

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

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