Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171100061.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is GPUForwardProgress-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.0K May 11 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 31K May 12 08:13 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 GPUForwardProgress-PT-08b-00
FORMULA_NAME GPUForwardProgress-PT-08b-01
FORMULA_NAME GPUForwardProgress-PT-08b-02
FORMULA_NAME GPUForwardProgress-PT-08b-03
FORMULA_NAME GPUForwardProgress-PT-08b-04
FORMULA_NAME GPUForwardProgress-PT-08b-05
FORMULA_NAME GPUForwardProgress-PT-08b-06
FORMULA_NAME GPUForwardProgress-PT-08b-07
FORMULA_NAME GPUForwardProgress-PT-08b-08
FORMULA_NAME GPUForwardProgress-PT-08b-09
FORMULA_NAME GPUForwardProgress-PT-08b-10
FORMULA_NAME GPUForwardProgress-PT-08b-11
FORMULA_NAME GPUForwardProgress-PT-08b-12
FORMULA_NAME GPUForwardProgress-PT-08b-13
FORMULA_NAME GPUForwardProgress-PT-08b-14
FORMULA_NAME GPUForwardProgress-PT-08b-15

=== Now, execution of the tool begins

BK_START 1621335446039

[2021-05-18 10:57:27] [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]
[2021-05-18 10:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:57:27] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-18 10:57:27] [INFO ] Transformed 188 places.
[2021-05-18 10:57:27] [INFO ] Transformed 197 transitions.
[2021-05-18 10:57:27] [INFO ] Found NUPN structural information;
[2021-05-18 10:57:27] [INFO ] Parsed PT model containing 188 places and 197 transitions in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 26706 steps, including 331 resets, run visited all 40 properties in 119 ms. (steps per millisecond=224 )
[2021-05-18 10:57:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 10:57:27] [INFO ] Flatten gal took : 43 ms
FORMULA GPUForwardProgress-PT-08b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 10:57:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 10:57:27] [INFO ] Flatten gal took : 15 ms
[2021-05-18 10:57:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPUForwardProgress-PT-08b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 10:57:28] [INFO ] Applying decomposition
[2021-05-18 10:57:28] [INFO ] Flatten gal took : 13 ms
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/graph16728379087005461174.txt, -o, /tmp/graph16728379087005461174.bin, -w, /tmp/graph16728379087005461174.weights], workingDir=null]
[2021-05-18 10:57:28] [INFO ] Input system was already deterministic with 197 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16728379087005461174.bin, -l, -1, -v, -w, /tmp/graph16728379087005461174.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:57:28] [INFO ] Decomposing Gal with order
[2021-05-18 10:57:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:57:28] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-18 10:57:28] [INFO ] Flatten gal took : 47 ms
[2021-05-18 10:57:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-18 10:57:28] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2021-05-18 10:57:28] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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 12 LTL properties
Checking formula 0 : !(((F("((i8.i2.u55.p152==0)||(i10.u64.p156==1))"))&&(G("((i3.i1.u20.p52==0)||(i2.i1.u16.p41==1))"))))
Formula 0 simplified : !(F"((i8.i2.u55.p152==0)||(i10.u64.p156==1))" & G"((i3.i1.u20.p52==0)||(i2.i1.u16.p41==1))")
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
// Phase 1: matrix 197 rows 188 cols
[2021-05-18 10:57:28] [INFO ] Computed 10 place invariants in 20 ms
inv : p1 + p2 + p3 + p4 + p5 + p6 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p153 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 - p172 - p173 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p4 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p154 - p174 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p4 + p5 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
Total of 10 invariants.
[2021-05-18 10:57:28] [INFO ] Computed 10 place invariants in 21 ms
Reverse transition relation is NOT exact ! Due to transitions t4, t19, t31, t179, i1.i2.t164, i1.i2.u9.t175, i2.t158, i2.i1.t147, i3.i0.t129, i3.i0.u19.t140, i4.i1.t111, i4.i1.u25.t122, i5.i2.t93, i5.i2.u34.t104, i6.i0.t75, i6.i0.u42.t86, i7.i2.t57, i7.i2.u54.t68, i8.i2.t39, i8.i2.u62.t50, i10.t10, i10.t8, i10.u64.t34, i10.u70.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/173/24/197
Computing Next relation with stutter on 12866 deadlock states
[2021-05-18 10:57:28] [INFO ] Proved 188 variables to be positive in 254 ms
[2021-05-18 10:57:28] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2021-05-18 10:57:28] [INFO ] Computation of disable matrix completed :0/197 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:57:28] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:57:28] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2021-05-18 10:57:28] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
76 unique states visited
76 strongly connected components in search stack
77 transitions explored
76 items max in DFS search stack
64 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.665921,40492,1,0,61856,337,2456,69512,210,934,104425
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(X(F(G(("((i2.i1.u15.p40!=0)&&(i10.u72.p179!=1))")U(X("(i7.i2.u47.p117==1)"))))))))
Formula 1 simplified : XFG("((i2.i1.u15.p40!=0)&&(i10.u72.p179!=1))" U X"(i7.i2.u47.p117==1)")
Computing Next relation with stutter on 12866 deadlock states
118 unique states visited
76 strongly connected components in search stack
121 transitions explored
97 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,0.830112,47080,1,0,76918,373,2542,90248,212,1136,128863
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("(i9.u65.p160==1)")))
Formula 2 simplified : !F"(i9.u65.p160==1)"
Computing Next relation with stutter on 12866 deadlock states
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.83765,47344,1,0,77686,373,2557,91118,212,1142,130446
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("(i8.i1.u60.p146==1)")U((F("((i10.u64.p155==0)||(i7.i0.u51.p126==1))"))||((("((i2.i0.u14.p36==0)||(i4.i2.u30.p77==1))")U("(i8.i1.u60.p146==1)"))&&("((i2.i0.u14.p36==0)||(i4.i2.u30.p77==1))"))))U(G(F("((i10.u64.p155==0)||(i7.i0.u51.p126==1))")))))
Formula 3 simplified : !(("(i8.i1.u60.p146==1)" U (F"((i10.u64.p155==0)||(i7.i0.u51.p126==1))" | ("((i2.i0.u14.p36==0)||(i4.i2.u30.p77==1))" & ("((i2.i0.u14.p36==0)||(i4.i2.u30.p77==1))" U "(i8.i1.u60.p146==1)")))) U GF"((i10.u64.p155==0)||(i7.i0.u51.p126==1))")
Computing Next relation with stutter on 12866 deadlock states
[2021-05-18 10:57:29] [INFO ] Computing symmetric co enabling matrix : 197 transitions.
76 unique states visited
76 strongly connected components in search stack
77 transitions explored
76 items max in DFS search stack
32 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.16634,58744,1,0,104158,378,2581,115576,213,1158,158679
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(!(G(F(X(X(G(!(X(F((G("((i8.i2.u62.p150==0)||(i8.i1.u61.p148==1))"))&&("((i4.i0.u26.p67==0)||(i8.i0.u57.p137==1))")))))))))))))
Formula 4 simplified : !X!GFXXG!XF("((i4.i0.u26.p67==0)||(i8.i0.u57.p137==1))" & G"((i8.i2.u62.p150==0)||(i8.i1.u61.p148==1))")
Computing Next relation with stutter on 12866 deadlock states
144 unique states visited
144 strongly connected components in search stack
145 transitions explored
144 items max in DFS search stack
94 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,2.11861,85952,1,0,162091,445,2671,213621,213,1892,219645
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((X("(i8.i0.u57.p137==1)"))||(((G(!(("((i1.i2.u9.p12==0)||(i10.u69.p175==1))")U(X(F("((i1.i2.u9.p12==0)||(i10.u69.p175==1))"))))))&&("(i8.i0.u57.p137==1)"))&&("((i6.i2.u46.p113==0)||(i0.i2.u74.p187==1))")))))
Formula 5 simplified : !X(X"(i8.i0.u57.p137==1)" | ("((i6.i2.u46.p113==0)||(i0.i2.u74.p187==1))" & "(i8.i0.u57.p137==1)" & G!("((i1.i2.u9.p12==0)||(i10.u69.p175==1))" U XF"((i1.i2.u9.p12==0)||(i10.u69.p175==1))")))
Computing Next relation with stutter on 12866 deadlock states
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,2.12524,86392,1,0,162343,445,2691,213979,213,1892,220699
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(((!(F("((i7.i2.u54.p132==0)||(i2.i1.u15.p39==1))")))&&("(i1.i2.u10.p9!=0)"))&&("(i5.i0.u35.p86!=1)"))))
Formula 6 simplified : !X("(i1.i2.u10.p9!=0)" & "(i5.i0.u35.p86!=1)" & !F"((i7.i2.u54.p132==0)||(i2.i1.u15.p39==1))")
Computing Next relation with stutter on 12866 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.13109,86644,1,0,162528,445,2725,214308,215,1892,221418
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(((F("((i6.i0.u42.p102==0)||(i2.i0.u12.p31==1))"))||("(i3.i0.u19.p59==0)"))||("(i8.i1.u61.p149==1)")))||(F("((((((i6.i0.u42.p102==0)||(i2.i0.u12.p31==1))&&(i0.i1.u2.p5!=0))&&(i9.u65.p162!=1))&&((i3.i0.u19.p59==0)||(i8.i1.u61.p149==1)))&&((i5.i0.u36.p82==0)||(i5.i0.u36.p82==1)))"))))
Formula 7 simplified : !(X("(i3.i0.u19.p59==0)" | "(i8.i1.u61.p149==1)" | F"((i6.i0.u42.p102==0)||(i2.i0.u12.p31==1))") | F"((((((i6.i0.u42.p102==0)||(i2.i0.u12.p31==1))&&(i0.i1.u2.p5!=0))&&(i9.u65.p162!=1))&&((i3.i0.u19.p59==0)||(i8.i1.u61.p149==1)))&&((i5.i0.u36.p82==0)||(i5.i0.u36.p82==1)))")
Computing Next relation with stutter on 12866 deadlock states
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,2.13236,86644,1,0,162528,445,2783,214308,218,1892,221544
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-08b-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((!(G(F("((i10.u72.p183==0)||(i1.i2.u9.p24==1))"))))U((X("((i3.i1.u21.p53==0)||(i8.i0.u58.p141==1))"))||((G("((i0.i1.u1.p3==0)||(i1.i0.u6.p17==1))"))&&(G("((i10.u72.p183==0)||(i1.i2.u9.p24==1))")))))))
Formula 8 simplified : !X(!GF"((i10.u72.p183==0)||(i1.i2.u9.p24==1))" U (X"((i3.i1.u21.p53==0)||(i8.i0.u58.p141==1))" | (G"((i0.i1.u1.p3==0)||(i1.i0.u6.p17==1))" & G"((i10.u72.p183==0)||(i1.i2.u9.p24==1))")))
Computing Next relation with stutter on 12866 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 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,2.1368,86992,1,0,162528,445,2824,214308,219,1892,221641
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-08b-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(!(F(X(F((!(G("((i6.i1.u44.p108==0)||(i2.i0.u13.p30==1))")))||("((i6.i2.u46.p112!=0)&&(i4.i0.u28.p72!=1))"))))))))
Formula 9 simplified : !G!FXF("((i6.i2.u46.p112!=0)&&(i4.i0.u28.p72!=1))" | !G"((i6.i1.u44.p108==0)||(i2.i0.u13.p30==1))")
Computing Next relation with stutter on 12866 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
19 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,2.31959,96420,1,0,188225,445,2892,245168,219,1892,255090
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(X(X(!(F(G("(i10.u68.p167==1)"))))))))
Formula 10 simplified : XX!FG"(i10.u68.p167==1)"
Computing Next relation with stutter on 12866 deadlock states
[2021-05-18 10:57:32] [INFO ] Computation of co-enabling matrix(7/197) took 2564 ms. Total solver calls (SAT/UNSAT): 1344(1344/0)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
156 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.87918,143940,1,0,307209,446,2914,333950,219,1910,333227
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G(F(X("(i2.i1.u15.p38==1)"))))))
Formula 11 simplified : !XGFX"(i2.i1.u15.p38==1)"
Computing Next relation with stutter on 12866 deadlock states
76 unique states visited
76 strongly connected components in search stack
77 transitions explored
76 items max in DFS search stack
3 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.90446,144996,1,0,310050,446,2962,336672,219,1910,336559
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
[2021-05-18 10:57:32] [WARNING] Script execution failed on command (assert (>= (select s0 80) 1)) with error
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)
[2021-05-18 10:57:32] [INFO ] Built C files in 4806ms 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 1621335454102

--------------------
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="GPUForwardProgress-PT-08b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is GPUForwardProgress-PT-08b, 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 r303-tall-162124171100061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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