Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922813700002.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 DLCshifumi-PT-2a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922813700002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 2.8K Mar 30 21:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 30 21:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 29 11:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 29 11:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 07:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 07:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 01:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 01:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 213K 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 DLCshifumi-PT-2a-00
FORMULA_NAME DLCshifumi-PT-2a-01
FORMULA_NAME DLCshifumi-PT-2a-02
FORMULA_NAME DLCshifumi-PT-2a-03
FORMULA_NAME DLCshifumi-PT-2a-04
FORMULA_NAME DLCshifumi-PT-2a-05
FORMULA_NAME DLCshifumi-PT-2a-06
FORMULA_NAME DLCshifumi-PT-2a-07
FORMULA_NAME DLCshifumi-PT-2a-08
FORMULA_NAME DLCshifumi-PT-2a-09
FORMULA_NAME DLCshifumi-PT-2a-10
FORMULA_NAME DLCshifumi-PT-2a-11
FORMULA_NAME DLCshifumi-PT-2a-12
FORMULA_NAME DLCshifumi-PT-2a-13
FORMULA_NAME DLCshifumi-PT-2a-14
FORMULA_NAME DLCshifumi-PT-2a-15

=== Now, execution of the tool begins

BK_START 1590095999698

[2020-05-21 21:20:01] [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-21 21:20:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 21:20:01] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2020-05-21 21:20:01] [INFO ] Transformed 188 places.
[2020-05-21 21:20:01] [INFO ] Transformed 888 transitions.
[2020-05-21 21:20:01] [INFO ] Found NUPN structural information;
[2020-05-21 21:20:01] [INFO ] Parsed PT model containing 188 places and 888 transitions in 154 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 410 ms. (steps per millisecond=243 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-21 21:20:02] [INFO ] Flow matrix only has 184 transitions (discarded 576 similar events)
// Phase 1: matrix 184 rows 188 cols
[2020-05-21 21:20:02] [INFO ] Computed 79 place invariants in 8 ms
[2020-05-21 21:20:02] [INFO ] [Real]Absence check using 79 positive place invariants in 15 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-21 21:20:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-21 21:20:02] [INFO ] Flatten gal took : 91 ms
FORMULA DLCshifumi-PT-2a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 21:20:02] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 21:20:02] [INFO ] Applying decomposition
[2020-05-21 21:20:02] [INFO ] Flatten gal took : 41 ms
[2020-05-21 21:20:02] [INFO ] Input system was already deterministic with 760 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/graph2176541033130101346.txt, -o, /tmp/graph2176541033130101346.bin, -w, /tmp/graph2176541033130101346.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/graph2176541033130101346.bin, -l, -1, -v, -w, /tmp/graph2176541033130101346.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 21:20:03] [INFO ] Decomposing Gal with order
[2020-05-21 21:20:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 21:20:03] [INFO ] Removed a total of 680 redundant transitions.
[2020-05-21 21:20:03] [INFO ] Flatten gal took : 125 ms
[2020-05-21 21:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 13 ms.
[2020-05-21 21:20:03] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-21 21:20:03] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/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 14 LTL properties
Checking formula 0 : !((X(G(X(X("((i10.u20.p77==1)&&(i15.u32.p147==1))"))))))
Formula 0 simplified : !XGXX"((i10.u20.p77==1)&&(i15.u32.p147==1))"
built 32 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 39 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 39 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 184 out of 760 initially.
// Phase 1: matrix 184 rows 188 cols
[2020-05-21 21:20:03] [INFO ] Computed 79 place invariants in 9 ms
inv : p0 + p151 = 1
inv : p0 + p159 = 1
inv : p0 + p71 + p72 + p73 + p74 + p75 + p76 + p77 = 1
inv : p0 + p135 = 1
inv : p0 + p143 = 1
inv : p0 + p184 = 1
inv : p0 + p176 = 1
inv : p0 + p127 = 1
inv : p0 + p64 + p65 + p66 + p67 + p68 + p69 + p70 = 1
inv : p0 + p160 = 1
inv : p0 + p168 = 1
inv : p0 + p150 = 1
inv : p0 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p158 = 1
inv : p0 + p134 = 1
inv : p0 + p142 = 1
inv : p0 + p78 + p79 + p80 + p81 + p82 + p83 + p84 = 1
inv : p0 + p183 = 1
inv : p0 + p126 = 1
inv : p0 + p167 = 1
inv : p0 + p175 = 1
inv : p0 + p145 = 1
inv : p0 + p153 = 1
inv : p0 + p15 + p16 + p17 + p18 + p19 + p20 + p21 = 1
inv : p0 + p129 = 1
inv : p0 + p137 = 1
inv : p0 + p186 = 1
inv : p0 + p178 = 1
inv : p0 + p57 + p58 + p59 + p60 + p61 + p62 + p63 = 1
inv : p0 + p162 = 1
inv : p0 + p170 = 1
inv : p0 + p144 = 1
inv : p0 + p152 = 1
inv : p0 + p128 = 1
inv : p0 + p136 = 1
inv : p0 + p185 = 1
inv : p0 + p177 = 1
inv : p0 + p161 = 1
inv : p0 + p85 + p86 + p87 + p88 + p89 + p90 + p91 = 1
inv : p0 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 = 1
inv : p0 + p169 = 1
inv : p0 + p147 = 1
inv : p0 + p36 + p37 + p38 + p39 + p40 + p41 + p42 = 1
inv : p0 + p155 = 1
inv : p0 + p131 = 1
inv : p0 + p139 = 1
inv : p0 + p180 = 1
inv : p0 + p164 = 1
inv : p0 + p172 = 1
inv : p0 + p146 = 1
inv : p0 + p154 = 1
inv : p0 + p29 + p30 + p31 + p32 + p33 + p34 + p35 = 1
inv : p0 + p130 = 1
inv : p0 + p138 = 1
inv : p0 + p187 = 1
inv : p0 + p179 = 1
inv : p0 + p92 + p93 + p94 + p95 + p96 + p97 + p98 = 1
inv : p0 + p163 = 1
inv : p0 + p171 = 1
inv : p0 + p43 + p44 + p45 + p46 + p47 + p48 + p49 = 1
inv : p0 + p149 = 1
inv : p0 + p157 = 1
inv : p0 + p133 = 1
inv : p0 + p141 = 1
inv : p0 + p182 = 1
inv : p0 + p166 = 1
inv : p0 + p174 = 1
inv : p0 + p22 + p23 + p24 + p25 + p26 + p27 + p28 = 1
inv : p0 + p148 = 1
inv : p0 + p156 = 1
inv : p0 + p132 = 1
inv : p0 + p140 = 1
inv : p0 + p99 + p100 + p101 + p102 + p103 + p104 + p105 = 1
inv : p0 + p181 = 1
inv : p0 + p50 + p51 + p52 + p53 + p54 + p55 + p56 = 1
inv : p0 + p165 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 = 1
inv : p0 + p173 = 1
inv : p0 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 = 1
Total of 79 invariants.
[2020-05-21 21:20:03] [INFO ] Computed 79 place invariants in 21 ms
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
9 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.141369,20720,1,0,7056,1688,2121,6487,1248,3240,20472
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((X(G(X((X("((i15.u32.p113==1)&&(i15.u32.p127==1))"))||("((i3.u6.p25==1)&&(i15.u30.p132==1))")))))&&(F("((i15.u32.p113==1)&&(i15.u32.p127==1))")))&&(X("((i3.u6.p25==1)&&(i15.u30.p132==1))"))))
Formula 1 simplified : !(XGX("((i3.u6.p25==1)&&(i15.u30.p132==1))" | X"((i15.u32.p113==1)&&(i15.u32.p127==1))") & F"((i15.u32.p113==1)&&(i15.u32.p127==1))" & X"((i3.u6.p25==1)&&(i15.u30.p132==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.149524,21632,1,0,7220,1727,2160,6615,1256,3395,20941
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X(X(F((X(X(G((F(G("((i16.u33.p120==1)&&(i16.u35.p159==1))")))U("((i15.u32.p108==1)&&(i15.u32.p151==1))")))))||(F("(i7.u14.p56==1)"))))))))
Formula 2 simplified : !GXXF(XXG(FG"((i16.u33.p120==1)&&(i16.u35.p159==1))" U "((i15.u32.p108==1)&&(i15.u32.p151==1))") | F"(i7.u14.p56==1)")
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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,0.164915,23356,1,0,7947,1887,2261,7342,1265,3738,23416
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(((X("(i1.u2.p14==1)"))&&(F(!(G("(i5.u10.p36==1)")))))U(X(X("(i5.u10.p36!=1)"))))))
Formula 3 simplified : !G((X"(i1.u2.p14==1)" & F!G"(i5.u10.p36==1)") U XX"(i5.u10.p36!=1)")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.170546,23848,1,0,8166,1890,2304,7606,1265,3748,24182
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F((G(((F("((i14.u28.p105!=1)||(i16.u35.p185!=1))"))&&("(i16.u35.p124==1)"))&&("(i16.u33.p168==1)")))||("((i16.u35.p124==1)&&(i16.u33.p184==1))")))||(G("((i16.u35.p124==1)&&(i16.u33.p168==1))"))))
Formula 4 simplified : !(F("((i16.u35.p124==1)&&(i16.u33.p184==1))" | G("(i16.u33.p168==1)" & "(i16.u35.p124==1)" & F"((i14.u28.p105!=1)||(i16.u35.p185!=1))")) | G"((i16.u35.p124==1)&&(i16.u33.p168==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4 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.216643,25960,1,0,13310,1973,2444,14737,1270,3842,31670
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(X(X(G(("((i13.u26.p95==1)&&(i16.u33.p182==1))")U(X(X("((i0.u0.p2==1)&&(i15.u30.p126==1))")))))))))
Formula 5 simplified : XXG("((i13.u26.p95==1)&&(i16.u33.p182==1))" U XX"((i0.u0.p2==1)&&(i15.u30.p126==1))")
6 unique states visited
4 strongly connected components in search stack
7 transitions explored
6 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.22688,26488,1,0,14214,1985,2534,15768,1272,3940,34091
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G((F(((G("((i11.u22.p84==1)&&(i15.u30.p148==1))"))||(F(("((i16.u35.p124==1)&&(i16.u35.p167==1))")U("((i12.u24.p88==1)&&(i15.u30.p150==1))"))))&&(F("((i12.u24.p88==1)&&(i15.u30.p150==1))"))))||("(i0.u0.p3==1)")))))
Formula 6 simplified : G("(i0.u0.p3==1)" | F((G"((i11.u22.p84==1)&&(i15.u30.p148==1))" | F("((i16.u35.p124==1)&&(i16.u35.p167==1))" U "((i12.u24.p88==1)&&(i15.u30.p150==1))")) & F"((i12.u24.p88==1)&&(i15.u30.p150==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.241241,27016,1,0,15997,1998,2592,17520,1273,3974,39365
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((((!(F("((i3.u7.p26==1)||((i16.u35.p118==1)&&(i16.u35.p183==1)))")))||("(i3.u6.p28!=1)"))||("(i16.u35.p163!=1)"))U(X(("((i3.u6.p28!=1)||(i16.u35.p163!=1))")U("((i3.u6.p28==1)&&(i15.u32.p133==1))")))))
Formula 7 simplified : !(("(i3.u6.p28!=1)" | "(i16.u35.p163!=1)" | !F"((i3.u7.p26==1)||((i16.u35.p118==1)&&(i16.u35.p183==1)))") U X("((i3.u6.p28!=1)||(i16.u35.p163!=1))" U "((i3.u6.p28==1)&&(i15.u32.p133==1))"))
2 unique states visited
0 strongly connected components in search stack
1 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.245221,27280,1,0,15997,1998,2672,17520,1277,3974,39499
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DLCshifumi-PT-2a-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X("((i0.u0.p7==1)&&(i16.u35.p157==1))"))))
Formula 8 simplified : !GX"((i0.u0.p7==1)&&(i16.u35.p157==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.257096,27544,1,0,16772,2012,2717,18312,1277,3988,41981
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(X((X(X(F("(i2.u5.p20==1)"))))||(F("((i11.u22.p84==1)&&(i16.u35.p179==1))")))))||(F("((i11.u22.p84==1)&&(i16.u35.p179==1))"))))
Formula 9 simplified : !(F"((i11.u22.p84==1)&&(i16.u35.p179==1))" | XX(XXF"(i2.u5.p20==1)" | F"((i11.u22.p84==1)&&(i16.u35.p179==1))"))
2 unique states visited
0 strongly connected components in search stack
1 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.257718,27808,1,0,16772,2012,2724,18312,1277,3988,41999
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DLCshifumi-PT-2a-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(G(X((!(X("((i7.u14.p56==1)&&(i15.u32.p141==1))")))U(X(G(!(F("((i7.u14.p56==1)&&(i15.u32.p141==1))"))))))))))
Formula 10 simplified : GX(!X"((i7.u14.p56==1)&&(i15.u32.p141==1))" U XG!F"((i7.u14.p56==1)&&(i15.u32.p141==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.267464,28072,1,0,18064,2012,2742,19568,1278,3992,45872
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(G(!(X("(((((i16.u33.p120==1)&&(i16.u35.p169==1))||(i15.u32.p114!=1))||(i15.u30.p126!=1))&&(i14.u28.p100!=1))"))))))
Formula 11 simplified : !FG!X"(((((i16.u33.p120==1)&&(i16.u35.p169==1))||(i15.u32.p114!=1))||(i15.u30.p126!=1))&&(i14.u28.p100!=1))"
3 unique states visited
2 strongly connected components in search stack
4 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,0.274007,28336,1,0,18344,2115,2783,19954,1280,4383,46825
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(X(F("(i14.u29.p103==1)"))))))
Formula 12 simplified : !GXXF"(i14.u29.p103==1)"
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.275321,28336,1,0,18348,2115,2799,19959,1280,4383,46865
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(((("((i16.u33.p120==1)&&(i16.u35.p185==1))")U("(i14.u29.p103==1)"))U("(i16.u35.p125==1)"))U(F(X("((i16.u33.p120==1)&&(i16.u35.p185==1))"))))))
Formula 13 simplified : !F((("((i16.u33.p120==1)&&(i16.u35.p185==1))" U "(i14.u29.p103==1)") U "(i16.u35.p125==1)") U FX"((i16.u33.p120==1)&&(i16.u35.p185==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,0.288342,28864,1,0,19732,2134,2820,21784,1281,4453,50354
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 21:20:03] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
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.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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-21 21:20:03] [INFO ] Built C files in 913ms 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 1590096004030

--------------------
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="DLCshifumi-PT-2a"
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 DLCshifumi-PT-2a, 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 r066-tajo-158922813700002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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