ELFp4 4 (444YYY  f$O O  /lib/ld-linux.so.2GNU%- $+'), *"#&  !%( x>_,/<fL"\&l-q|:c jp@̉-܉4"(@P  DP / DG@X,<FL\]l!|2MqT"'̊2܊+-| h6HP LP ,,7 <-L \__gmon_start__libc.so.6strcpyprintfstdoutungetc__ctype_bfscanffgetsmemcpy__cxa_finalizesystemmallocfflushrename__sysv_signalfprintfstrcat__deregister_frame_infostdinstrncmpstrncpyunlinkrealloc_IO_getcsscanfmemsetgetchartimetmpnamstrcmpsprintffclosescanfstderrexitfopenatoi_IO_stdin_used__libc_start_mainstrlenstrchr__register_frame_infofree__xstatGLIBC_2.1.3GLIBC_2.1GLIBC_2.0si ii ii O +@P DP HP $LP %N N N O O O  O O O  O  O  O  $O  (O ,O 0O 4O 8O  = y  kE UE EE}3 kE\; u|ؚ ;К rt)vؚ  ؚ kUEEfԚ Ԛ   =̚  ̚ vkE4UEtE UEx5}3 ,kE\; ukUE*=̚ t h8ܚ =̚ ̚ vؚ k EEEExt}3 kkU\f<uZؚ ;К r0t'ؚ  ؚ kUEEfԚ Ԛ  ؚ ; wv'-ؚ -Ԛ 5= uR' jkUE+EkԚ  EHEԁ}%Uԋ: %vL L ;|M p%L |M a%M  ` L  L 9%jhԚ 0C Ԛ 0Ԛ @H H Ԛ B0  L L ;|M ~ L |M M $v = $jh8q$ Ԛ 0Ԛ $pԚ pԚ 0Ԛ  p EԚ (8Ԛ (xEԚ (E;B|@jԚ 8tԚ @EEuuRE묃 h8= tԚ  PԚ (B0H M  ` L  L X#jjh'jHr  @,#jjh'jr  @# "jjh'jq  @"jjh'jq  Ԛ @B"vL L ;|M ~ L |M M c"M  ` L  L ="Ԛ @H '" jjԚ pj5H  EjԚ 8tԚ @E EuuV h8H !Ԛ @H = t5 h8nԚ @ c! jjԚ pjԚ p H ,!Ԛ @H = t5 h 9mԚ @   jjԚ pjԚ p; H   v=H tԚ @0h9mԚ @` f v Ԛ 0` ? Ԛ  . vԚ  =  Ԛ @0h69jm Ԛ 0Ԛ p * v jR jjj@jnPZy j辮¡ P[Ԛ 8M Ԛ 06vԚ 8% Ԛ 0v Ԛ pԚ 0A Ԛ  vԚ 0Ԛ 07  Ԛ  nvԚ  ZvԚ 0Ԛ pԚ 0=Ԛ  Ԛ 0Ԛ pԚ 0Z5 Ԛ 0 vԚ x tjhJ9k Ԛ 0AԚ 8tԚ @0h`9i=H Xjh9jAjԚ 0j,j.l vԚ 0Ԛ 0j,jl v Ԛ  vjԚ 0h)Ԛ 0k vԚ 0Ԛ 0h)Ԛ 0{k kjjh(Ԛ 0Wk GԚ 0jh(Ԛ 0+k Ԛ  jjh'jk¡Ԛ @P0Ԛ @@0@Ԛ PԚ B0Ԛ  Ԛ 0Ԛ 06 vԚ PԚ B0Ԛ   JvԚ xtT/ P/  Ԛ 0蘊E EU;U}EEU Ԛ 0jj@ji  Ԛ @BvԚ @@Ԛ  Ԛ PԚ @B Ԛ @@Ԛ  MԚ  PԚ @BԚ  vh*5 Ԛ 0 vjjh*Ԛ 0h ` jԚ 0h*Ԛ 0h  Ԛ @fxkԚ @@8` TԚ   Ԛ B$Ԛ 8t(Ԛ @fxtԚ @f@ = u<= u3Ԛ @fxuԚ @0h9OeԚ 8tԚ p Ԛ 0`  pjԚ 0j.j^g NvԚ  :vԚ  = jh9e  Ԛ 0Ԛ  0jrԚ  0f jRjԚ 06v  Ԛ 0Ԛ  0jsԚ  0xf  @jSjԚ 05FvjjhԚ 0,f  Ԛ @Bv胸jjhԚ  0e  Ԛ @Bvjjh je 腸¡ Pjjh Ԛ 0se Ԛ @fxt.Ԛ @fx tԚ @0h9bԚ @f@ jԚ 0j:Ԛ 0d Ԛ @fxt4Ԛ @fx tԚ @0h9?bԚ @f@ Ԛ 0Ԛ 0h2Ԛ 0kd Ԛ 0Ԛ 0h0jԚ 0Ԛ 0 !jjh'jd  @5 Ԛ 0j+jc 5 Ԛ 0h2Ԛ 0c Ԛ 0Ԛ 0/Ԛ @fx@qjh9aZvjjh'jHc  @5 Ԛ 0j-jc 5 Ԛ 0h2Ԛ 0b Ԛ 0Ԛ 0.Ԛ @fx@jh9 av jԚ 0hԚ  0`b  FvjԚ 0hj/b   Ԛ 0Ԛ  0jrԚ  0a  f^M @jRjԚ 01  Ԛ 0Ԛ 0jrԚ 0ya  @jRjԚ 00D 8 Ԛ 0Ԛ 0jrԚ 0 a  @f^M jRjԚ 0$0  Ԛ 0Ԛ  0jsԚ  0`  f\M @jSjԚ 0/ajԚ 0jcjN` >vjjhj,`  j躞 jjhԚ 0_ jj*Po¡ Pj @0Ʋ jB膞jjhԚ 0t_ jj讟P¡ Pj @0J.$ jjjhj_ jj:P¡ P Ԛ 0Ԛ pU vԚ  ~vjԚ p¡ PUԚ pԚ pգ¡ P"v j辜 jjjj]  j;¡ PԚ  vԚ  vԚ  Ԛ 0Ԛ 0j+j] rvԚ 0Ԛ 0j-jV] FvԚ 0Ԛ 0j*j*] vԚ 0Ԛ 0j/j\  vԚ 0Ԛ 0j%j\  vԚ 0Ԛ 0j&j\  vԚ 0Ԛ 0j^jz\ j vԚ 0Ԛ 0j|jN\ > vԚ 0Ԛ 0h;j\  Ԛ 0Ԛ 0h<j[  Ԛ 0Ԛ 0h=j[  Ԛ 0Ԛ 0h>j[  Ԛ 0Ԛ 0h9jo[ _ Ԛ 0Ԛ 0h:jC[ 3 Ԛ 0Ԛ 0h8j[  Ԛ 0Ԛ 0h7jZ  Ԛ 0Ԛ 0h?jZ  Ԛ 0Ԛ 0h@jZ  jԚ 0j~jrZ b vjԚ 0hCjKZ ; jԚ 0j!j*Z  vԚ 0Ԛ  0h7jY 5 Ԛ 0j?jY   =H ujh:XH h:0  p jԚ 0hԚ 0JY  EܡԚ 8tԚ @E vEE؋U܉BjAԚ 0Ԛ 0:( 5 % jԚ 0hԚ 0X  jԚ 0hjX fVM u  h Ԛ 0Ԛ 0jRԚ 0=X -   Ԛ 0Ԛ 0jRԚ 0W  f^M @Ԛ  h&:Ԛ 0Vjjh'jW  Ԛ f@fB Ԛ @B`jjhjPW @jjhj0W fZM jԚ 0hjW fXM Ԛ pԚ  0Ԛ p_Y  Ԛ  vԚ  zvԚ  fv T Ԛ 0u!jh-:S Ԛ   jhE:SvԚ  vԚ  Ԛ 0Ԛ 0h8jU Ԛ 0Ԛ 0h8joU _Ԛ 0Ԛ 0h7jCU 3Ԛ 0Ԛ 0h7jU Ԛ 0Ԛ 0h8jT Ԛ 0Ԛ 0h7jT jԚ 0h#Ԛ 0T jԚ 0h%Ԛ 0`T PjԚ 0h$Ԛ 00T  jԚ 0h&Ԛ 0T  @ Ԛ @B xjh:#Rv Ԛ @B @jjԚ pԚ 0jS ZvԚ 0jԚ pԚ 03S # Ԛ  v Ԛ  vԚ  vԚ  f8,u,Ԛ 0Ԛ  0 Ԛ 0Ԛ  0j,joR _Ԛ f8,uԚ  AjԚ 0j,j.R vԚ f8,u(Ԛ 0Ԛ 07 Ԛ 0Ԛ 0j,jQ vԚ  Ԛ 0Ԛ 0h:Ԛ 0cPvvjԚ 0hj\Q h:Ԛ  0P2vjjh'j Q  Ԛ f@fB Ԛ @Bjjh'jP  Ԛ @؉BԚ f8,uԚ  jԚ 0j,jP rvԚ f8,u(Ԛ 0Ԛ 0 7Ԛ 0Ԛ 0j,jP vԚ  f8,u,Ԛ 0Ԛ  0$ Ԛ 0Ԛ  0j,jO Ԛ  jjh*Ԛ 0{O j5 j,j`O Sjjh*Ԛ 0?O Ԛ 05 j,jO Ԛ  kE)ؚ ؚ EkE)Ԛ kU E}ul}ufE ؚ ؚ f Ԛ Ԛ  = y = y  = kEHUEt=UUEx0}3 'kE\;EukUEvkUtEؚ ;К rt.ؚ ؚ UfԚ Ԛ  : h:KÐUE}"t } tEEÍvUEEkHP ffu}_tEEUEkHP f%]ÉUEkHP f%]ÉUE UE E = y5` =Ev<EEEPE Ѓu UE E뛍v E= y5` EPvÐU= y 5` E vEEE;Eu E ,= y5` uFSEU u@P=JEuulP E}ulEU02uAE0h >HUEBUEBUE BU B_E@ E덐 j$IEUEUEBUEBUE BU BUlP B ElP ÐUlP E}u0E0u"uE@ EɐÐU=hP tEhP EhP }uMhP   U"v  U}us  @   @  = y 5` E EEvEÐU=hP t hP    ]UVSlP Ev}u0EU02uvE@ Eɐ}uE0h<>XG = ~jhQ>7GU BU BE EE@EE}t&}uEE@$EE@$E׍v}u }uE0h>F EPF‹EP E EE}up E  P^@PFËMEkA E  PMEkA 4GE@$EE눋E@ E@   E@  EEE; |KvE4   ;uE0h>rEE먍e[^]ÐUEEhu= y 5` :E ?EEE tjh>D = y5` EEEEP>ujh?Dhu3 h ' = y 5` tE{EEE u} tjh@?/D= y 5` %E +EEE"tjh@?Ch8us= y 5` "u#"ujh?Ch?h  h  = y 5` Y u [ uÉUHEE vuex tF@ f8*tE0h?B@ P@ @@ B @$두Ef@E= y 5`  EE  } t t! t{t#  yE0h?A E 05 h?P PEEEEE= y 5`  EE)=~jh?/AE##Q     t, {t#}t* EEEEE}Eu Puu}tLE0h?6@5}uEjusEEbvÉU= y 5` E EEEE  U U}UP@ 뛀= t됐juzvh8u= y 5` N"u'O"uh h@?h?h )jjjjy@  h Z ¡ P= ..= y 5` E EEE}\um= y 5` qE wEUU}nu E 0v}ru E }tu E }fuE = y 5` 'u%'uh h)@=jjjjF?  EB= '  ut`hujjjj>  h ¡ P= 0'v ueu}_tLh`u=  h OE}E/vE!E}[U@j/jj*E} oj*jj/E} Cj:hj:Emj-hBj-_ Phj>ME;j+hAj+/Eh<h>j= Ph?j<Eh;h=j= Ph@j>Eh2h9j=Evh3h4j! Ph:j=nE_h5h6j?PEAj&h8j&3E$j|h7j|EEjjjj,< = EÉUjjjj; EE <uE 4uEuj E AE <t% E 4^¡ PE oEP u Bt f@'1hCu脾ufRM = =hP   @EE}uUE@ @0u  kU@ 4uؽ  @E}u2  kU@ hP vE@ H  kU@ 14Au> E@ ff E@ @0y¡ P*E@$E>E@$EEv u1 B uȽt+= u-t," u-t-*ÐU=@ t@ E@ E=< u.}t%}tE@ < =< }us}tj}1ta}/tX}tO}tF}t=}}t7}t.}t%}tE@ < 4v}uI=H t ` ?@ =@ }t=@ t@ E@ E< = hCh u    hCh ºu#D =D u\  IhCh 肺u D #vh    P_EÐU}u} u Cv}t} u-E U02E}EEEEÉUEvE8u*EEEE E%tՍE͐EU uEEP E}ulEu0PuE5H Ep@t(5` Ep<t EE@HE덐=H twEP E}uXEu0輸u1Ex@u(5` EpFuhEFu設hLFu萭kvhSFuxSvhZFu`;vhcFuH#hjFu,ÐU(uEP+tEPhqF vÐU E@Pu0 htFëEx<tE@<0hvF被E0hqF荫Ex~EphzFnEfx@u9Ex0tE@0@E vEuhF0OvEfxuE@80hF'vEp0諭PhFߪEx<t hFƪ5Ex@u hF說E@@0hF菪ExyE@PhFm hF[Efx@Ex0E@0@$EE}uEE@$EuhFE@0@$E}u8 EPEx$t htFE@$E‰ hF裩ÉUP E}u E0E@EݐÉU hFQEx@tE@@0hF0Ex<tE@<0hvFE0hqFEx~EphzFۨ htF˨ÉUSE t`E@,Ev}u0Ex ru EvEx suEE@Eʉ}E@  uEE}v9EE@,E}u,]E h C ;uEE@Ẽ}uEEl 4hG誧E@,E}u]E h C ;urE0hqF`ExtE@0hG?ExtEphG E}~ hGE@EXE}u EG EHuhH]UHP E}uIEx<(Ef@fEf}t}f}&f}tof} f}taf}tUf}@t%f}@f} t;f} t,v=  E0BE@ t 0hHԥE@PEPEx@tE@@0h+H薥 h7H胥E0EPh@HhE@EvÉUE@EEhH0ujhHBEhH0֣u'= t @EEEEhH0蒣u7= t xt @@E vEEEhH0>u+= u }v  @)ЉevEx@tEfxt u蚓;Efxu E01EUEB uUE@x@t&E@fxtu u ?E@fxu E@0‹EPu ujÐU} uvE f8*UE @20E @x@uEx@u>vE @x@tpEx@tgEP@E @@@20蜡uAE @ E @ E0hHmE f'E @*E p uE p$uÉUS E EUE ;B} } x>Epu E0hIE0h$IEfxuE0h8IEf@ Ex E@P{‹EPEUE;B|{vEfx@t:Ep0u  Ep0ËMEkA*= u u,=ËMEkAEzE E ]ÉUE@E Ep {EEfxuI= t@j 0umE}tE0h`IpEsEfxujuu蹤Muut1Ep MEkA4E@PvÐU8EfEE} t }@t vE Eo}u E fE`}t} t vE EC}uE E2v}u)}ujhI%MH#E EEUE9E t? uEUEPu hIEPԟ EPhIEEUЉUE@fxuu jEpu-y Ep nEuEpUtIE@x ~E@H PE !EPEkRE  EP BUEX E` Ev}u4E@u0u E E@$EŐ}uE X hIu谜` E}uE@u0utfPM  hIjEp hIu.Q fPM EphJu,fNM  h JjEp hJuP fNM uhJuE@$E/vhJuEX ÍvU(P E}uEEEfxbEx@UEx<HEfx9Efx+Efx u E0EfxujE0uEUE;B|Efx@ujuu"S t E@; } ; tmj jjh'jPh*jEUEBEP EB uyEE0h"J;Ex~uh'J h,JUfz Pu5@P Q h0Jٚ= E@   = uB= uE0h2Jh  HvE0h:Jh  )Efx RuPEx u&U B  E Й}B E@  HE= uh  u]4= uh  h@Jəh  E0hFJ詙u5 h`J萙 hJ耙E0h"JkEx~uh'JOh  hJ:E)E@EnÉUE@EEEv}uYEfxuuE0u¨"EUE;B|Efx@uuuuO t E@; } ; tj jjh'jPh*jEUEBEP EBE0EpE0hJEx~uh'J h,JؗEfx RueP5@P N h0J蔗= E@   = uZ= u* E0EpE0hJh   ( E0EpE0hJh  ̗ Ufz PuPMMEx u&U B  E Й}B E@  HE= uh  u0= uh  h@Ja h  E0EpE0hJ4 u5 h`J h K E0EpE0hJEx~uh'JЕh  hJ軕EE@HEÉU h U 5t h U }= tA= u = u-}tuhiK6 hK# ueU5@ xP֕Džtt;< ~LhKxP贔tT 4xP苔t릉 u uxPhKxP+ xPyt/ u U}t uA j}t uÉUhKu蟔EhKu 臔E}t}u#u uhK谓 j uhP)uPhKuU uuEÍvUE j辒ELP ` @P  @P h }zE 8-thE @B4444Sv      < <  T E v< <  T E mE 0 ME WE 4 ME <v .  E  P v   E  P蘑EE 8 ME |vE @ dv UE kHP f%f- E P PDv   E kHP f%fE  P薐   hKhL ja^ hj <v *E h L裏 h`L蓏 hL胏 hLs h Mc h`MS hMC hM3 h N# h`N hN hN hN h Oӎ h`OÎ hO賎 hO裎 hO蓎 hP胎 h Ps h@Pc hPS hPC hQ3 h@Q# hbQ hQ hQ hQ hQӍ hRÍ h@R賍 hR裍 jME }=4 4 0 0 @fhK4 0h =h u$4 0hR! j|5h hP藌 5h @P h 4 }=0 u =8 u1hRh U zhRHPc$ h U 诋 HP蝋=0 tmHPE 02h 50 j|  5h (jh U HPv=8 hK8 0sDDu$8 0hR蛋 jHPE 0lh Dh8Pu= 5h W DFjh U HP:8PhK5h މ끐jh U E 0}tZ hRˉhRh U Ft"h U hR苊 j jhKh U  ` =` u"h U hR7 jE jhR0Љt"E jhR0讉u#E 0hRhP臊E 0hP艊 hP    8"  0D DH @P~ v hR_   =0 tC}~ 50 j=P& hSLj j"hKhL襈 h!S蕈 5@P 脇= u:= u =u h@SS j>= t u u = u= t  u~ hhS*EEf@ hjS EEf@ hmSEEf@ hrSEEf@ 5` 脇= u  u 5 ÍvU]ÉU 05 hTT} tu u uՆ= t:= t1 hoT賆 5 Z hvT蒆 t. h )vh hxT[ hTK Uu u jÉU u7EEujhTujufEUExtE@f@fEfEEfEf} t'f}t f}tf}tf} t f}t = tEPE@@ B UE@,E}uVu|?vh hCVu|vh hJVuw|vh hOVuW|vh hVVu7|vh hZVu|vh h_Vu{vhdVu{dh hpVu{Gvh hyVu{'vhVu{ h hVug{vh hVuG{vh hVu'{vh hVu{vh hVuzovhVuzTh hVuz7vh hVuzvh hVuozvh hVuOzvhVu4zh hVuzvh hVuyvh hVuy_vh hVuy?vh hVuyvh hVuwyvh Wu\yh hWu?yvh hWuyvh h*Wuxvh h.Wuxgvh h3WuxGvh h8Wux'vh>Wux hHWulxh hJWuOxvhNWu4xh hWWuxvhaWuwh hoWuwjh hyWuwNh hWuw2hWuwvh hWuswÉUhc5@U Swhc5@U =whc5@U 'whd5@U w Phh+d5@U v 5 = t EEcuh@dhd5@U v hd5@U vÉU 5 5 hd5@U hvE}y8EkDU <uEkDU 4jjdu6 Ehd5@U v iPhd5@U u iPhXhd5@U ujdhXhd5@U ujdhd5@U uhe5@U }uhY@jhY@jhe5@U Yu hj5\U v E@u2 d$$ d$$h0e5@U t ÉU= t  Dž=ehAeP{vhGePTv@U =@U uPhIe=hae5@U Wth@dhre5@U h> HPujum E\U E믍vÉUSEkHU k TU E kHU ff$ÐUE=  )ЉEhc5@U nhf5@U nhc5@U mhd5@U mujh+d5@U mEkLU 4hg5@U mhd5@U mujhCf5@U nmuEkPU ЍPhd5@U 6mh g5@U  mh`g5@U  mhg5@U lÍvUS4} u u u uumRP,$XZg]jjjjEٽƅ ٭۝٭PE=  )PUЍE P: E8~E@Gt:G Bt>Rt31EL>EL>E?.EL>E?EL>E?EL>EL>EFj!u?ktE?E?E?j?uktEE?E?E?E?E} PEPhguul}}EkDU <t5EkDU  4kkà uYk9v, uAk@PmEkDU  uEkDU 49luuujEٽƅ ٭۝٭PE=  )PUЍE P hc5@U ihc5@U ihc5@U ihd5@U xiE=  )PUЍE Ph+d5@U 7iuhg5@U ihd5@U i]UVS E`U Ѝ=`U ЍP$Xg  d$$ d$$h0e5@U vh  ]E5 ]E}EE mE mEv}y8EkDU <uEkDU 4jjuE ; | H EE; ~EkPU f<uEkXU <uEP  9|hg5@U tgEkTU f<:EEEkTU kE܋E= E؋E E؋U؍E)U؍E)EkPU EkTU kPU f3f; uHE;Eu@jjjh?uEkPU PE PEkPU Pn Fjjjh?u܋EkTU kPU PuEkPU P& E; EkTU kTU Ef EkTU f<EkTU kE؋EE܋Eܙ= EE EUE)UE)jjjh?u܋EkPU Pu؋EkTU kPU PH EkXU <tJEkXU 4ujEkPU PP EkXU 4fEEE8hg5@U de[^]ÍvU ; |35 hg5DP djhh} kPU Ef E;`U ~E`U U u /e@PYEu u;f= uEkDU E Xv u- kHU   kLU   kXU E  ÐUjhhudu EEEE= uV= u%= t @EvE v\ EEEEEPuvuh h8dÍvUEEE}u uyjEE@$E؋EÐUEx0u %v=  ~1E@0@ E@0@ E0h@hV= t= ~jhUh/E@0f8@t Ep0f j"EU f fUE@0f@fB E@0p$‹EfPU BEfx~E@E vEEE E@EkP‹EP E@kPv‹EP EPZ‹EPE@0@$EE}ulExt;Ef8u1Eppb PuEp iEUEkR E EE@$E돍vU BE EkH EEUS Ep SdHE} Y}xSE <tvE@$EE렃uh]kEPIEPh  HÍvU  uu =h  uGÐUSExuv E}uEME kA;= ~ tE@; }aEfxuQEPh`k$H}t'E @)PE0hmkGExtu E0hukGE0hkGEE@9E| hjGv hjGEE@9E| hj_GE}~ hj=GUEkR < PME@EEkA45@P  EqE@EB]ÍvU}u*Ext!E@fx@ujLjjEpM} E f8tzE f8tpE xt;E @fx@u.}ujhkjVjjE pjE p uUjE p$u?ÉU jE5 uEE }t  ÍvU  ]ÐU ]ÐUEEv}E;E u}tfE8t^Ef8 uRjE0E}tE@; |%E@ E@ \vE@Ev}uE@ E\EpE05uE@E빐ÐU}t<} t6EU @ ;B t(E@ E@ jhk'ÉU E} E0E}E0E8tE@EEuE8tE@E vEkuhkCEHE}Upo hlC h@lC hlCv hlgC hlWC hlGC hm7Cv hlC h@mC hlB hmBGv hlB hmB hlB hnBv hlB h#nB hloB h?n_Bv h[nGB hmn7B hzn'B hnB hnB hnA hnA hznA hnA hnA hnA j}u.EpE0ujho" @ U B UE@BExujh@oEÐUjjhjREUE@BUE@BfbM E f8u E @E< j u jj=PEEf8uEPEBE@EEEf8:E@ f8t"E@ f8tE@ f8tvE@ EE@ PEBUE@ @B j u jjuj%EjjaP‹EPUE@BUE@Bjuj:uԺEUE@BUE@BEJ jJ ulujPEEUPEÐU jEUEUE BEÉU}tLEf8tEf8t urEf8u uT j$fEUEU B U B U BE EU}ufEE}r|!}s~}&}#| 7 Ep t  Ep$ÐU(EEE@E jE jjj.j˸PEEEEEE쐃}uE8uEf8uP}tjho˶ExtJEE}tEURP6EURPU$v E0E EEE@EU}t1E@}ujho;EUPEE}tE}t?Ef8u/E@fTM jho  jjuu_‹EEEBUEBEEv}u$E0uEEE@Eԁ}uh 0uq jjhu׶PEu P @  0u  0uEÉUE@E}uE;E uE@EݐE@Ev}u u E0E@EډEpu ‹EPE-E}Uou E@0qhE@Ev}uTu E0HE@Eډu E@0u E@0ÉUEE}u,u uUE;BuE@ E͐ÉUE@E jE jjj.j輴PEjjhu蘴‹EEEBUEB}tExtE@xujhp轲EE}u E0uE@EډE@0E0 0ur 0u]EÍvUjjh'j躳EE@ jujcj蔳PYUEf8  uE}Ejh0p07t>Ejh9p07tEjh@p0k7u/Euuuqu uDE 8u U EvE PEB U EBÐU}uWEf8:u3 Ep EuEpEEdU  uU}uVEdU  uqEdU f8t-dU f8t!dU f8t 0uGÉU}uv E}u5D 5T/ hO5D  5D hb5H  EE}uHuE; t EsE}uhu5H FE@EE볍vuh5H h5H h5D  5 h5D h5D  E}u0 @P5lM E@PE0'E@Eɐ @P5lM 5 hhH# jj5D X/ jh} h5D h5D ÉUh5H EE;L/ |#vuh5H Eh% jj5H h*  @Pj5H h & jj5H f=dM tBh 5T )h?5T hR5T   E}u(E@X  uE@EӍvX f=dM t,h5T h5T h* E@Pu5H h*  @Pj5H h+ jj5H Uh) jj5H ~h *  @Pj5H b Ev}u$E@PE0E@EՐh,* 5 j5H h4* jj5H hT* \/ @P5\/ 5D hl* `/ @P5`/ 5D ht*  P @P5D h5H h( jj5H ih* 5 j5H Nh5H h5H h5H jh}6 ~>h5H rjh hL5H Jh*  @Pj5H h 5H hQ5H ÐUhT- jj5H NÐUVS@ E E E}uEUЍ/ <u E@EŐUЍ4/ UЍ / E440UE@@20  E@pu UЍ/ 4h5H  UЍ/ \/ UP/ `/ E@@ taUЍ/ 4hEP(E@@ E@@ EPh_Eov E}uXEx tAUE@@20uE@pu h5H E@E룍vE E e[^]ÐUEEkE<u_vE EE;E|EՐuuuuuuEkE4u2 huE뭐ÉU h }uMEx@tE@@@0E E@0EEE}tE@0EphÍvUH} EfxtEfxtEfx E@ E EЉ}u8EЋ8t"EЋ0u uvEЋ@E}5EЋ@E̐}u E̋@ Eȍv}uE̋@$E׍vEȃxt7UEȋ@20uuu,Eȋ@$EȍE뜋E@   uE@PEP\5E؃ PEԐEE؉‹EԀ< tvE؉‹Eډ uEx@tu h h E0E0EPh EfxE@   uE@PEP|4E؃ PEԐEE؉‹EԀ< tvE؉‹Eډ u Ex@tu h  h E0E0EPh`ÍvUxEE}~EE}~ EߍvP E}u EۍvEEEx@Ex<EHEh/ ; }u Ext}ExE@@0uvE tEfx@u= uuu hEPHuhP.uhPPPEPuh}uuI kuufE@ t EFvuhEPhhh}uEPuu EhuuE0uh E@EEÐUEE}~aP E}u EߍvEEEx@#Ex<E@ EHEh/ ; Eh/ < u E0]0E E}ty}}tXv}tEfx@u= uovhhuuh}u 5H ^ Aju{Ehhh}uhu 5H  E@EEÐUE}~P E}u EߍvEEE@ EHEh/ ; unEx@u Ex<uE0hWEfx@uE0hVh(5D   u E@E>h@5D UE E}t} }t&u}ti u UEfxu%u uuuuu u $Ex0u } tExuouE0uuhpu! } uE0uh{uuuu huEUE;B|uuE0uuhu } u" uE0uhus uu*u huHEsvÉUE x0t}E fx@us u 4wE}~ZE @0f8@u6EP fzPuhu.uhujE p0uM_UEEE;E|EEEE@US$uu h5D 7h5D !u Ph 5D uY Ph`5D X/  u+à ud/ h}uu jh}5H  Eu h5D ]=X/ u%}~u h5D 5;u u h5D }u9d/ E}yEEPh5D X/ fxt X/ fxuX/ xuJvX/ pX/ x~ EE}uX/ 0u h5D h X/ f@fEf}f}.f}t_f}f}f}f}@f}@f} f} vd/ E}yEEPh5D X/ xu5d/ E}yEEPh5D n`h5D UGh5D =/h5D %X/ 0hPh 5D ]ÐU Euh 5D uh 5D uh@5D uh`5D }uh5D duh5H Kuuh5H 2uh5H uh5H uh5H h5H U8E@EEEE@EE@EE@ PuI@Euuh&5D lE;pM uuh:5D HE;tM uuhR5D $E0uhj5H  uuh5H uuh~5H uuh5H f=dM E0uh5T Ex tEh5T vjEp 5T Yh5T Gh5T 1Ex th5T h5H EEE}u=E@ Ev}uE@$EEf8,u E@ EEEԋEԉEE@xt.E@ E@ E@0h9Muh5H PE@fxuOjEpu5H tNE@ E@ E@0hLE@0h5H uh:5H E@$EEhE5H h}E0ujh}5H  E؃}~Qh5H Kh}E0ujh5H ^ hL5H E0u5H 3h5H UEEE8t|Ef8.uEx t E@ E]Ef8tEf8tEf8tE@PE@ B Ef8uE@EÐUEE}:Ev} &E8uEE}tt}}.te} t,v}}~~}tUjE0EE0E0bEx u EE@ EAu E@0 E!E@PE@ B E8vE tE@ u EEEEEÐUE Ef@fEf}f}:f}f}f}f}tUf}Bf}@1f}@f} of}f} vEp E0hV5D )EX/ d/ EEЋM9~Bd/ EEЋM9E)Љ‹E;P }d/ EEЋM9E)d/ E@ d/ @vExu/E0hh5D EX/ d/ EpE0hpE@d/ E0h5D 4EX/ E0h5D  EX/ E0h5D EX/ dvEx8uE0hGE0E@80h5D X/ E0hFGExtEph%5D Qh5D ;ÉUEEkE<u_vEEE;E| E uu uEkE4u huEÉU(h& jj5H  @Ph*5D v @Ph=5D Y vuhO5H  @Phj5H fx~@ vDžh|5H h5H h+ @P5D Dž@9|MkA tJ@ts@  tLvfxt7h5D h5D xvh5D _Wh5D ?7h5D h}hCfx~@ Džh5D Ph5D @1h+ jj5D h' jj5H f=^M  h5H )Dž; |,h5H h 5H h25H h=5H hL5H hj5H uh5H _h5H Ih5H 3h 5H h5H Dž; |`h5H h@5H hc5H hq5H uh5H _h5H Ihq"5H 3h5H Dž; |,h5H vh 5H h|' jj5H  uPhP>fxtDž} DžPh5H &fxuh5H f=\M DPh 5H Ph@5H h`5H PhPQDž@9| Ph5H 6 Ph5H  Ph5H ih5H Ph5H PhPXPh5H kh%5H UDž@9|PPh95H PhU5H vh5H Ph5H h5H PPh5H zPhP)Dž@9|*h5H '@t Ph5H  h' jj5H 0 uIfzPPh5H z@vh' jj5H  uefx~@ DžPh5H @vhP) jj5H $ uPhPJfxtDž} DžPh&5H 2fxu:Ph55H hJ5H h`5H տ h+ @PjP5H t hp5H 蒿h5H |h5H fh5H PPh5H 3Ph5H h5H h5H PhPDž@9|PPh 5H 苾Ph5H kvh,5H EDž@9|z@PhD5H h`5H h5H ܽh5H ƽ@vPh25H 菽Gvh) jj5H  u=PPh5H (@h<+ jj5H hh@, jj5D Qh5D ϼDž; |$h5D 蝼h5D yh5D cDž;L/ |$h5D 1h 5D  Uh+ jj5D ZÐU E}u4Eu0讻u E@$E@EŐuh \6ÉU}u/ Ep Eph 5H FÐU5M M h* 5D 5M M h: 5D hJ 5P h 5P ͺh 5P 跺h 5P 衺hڋ 5P 苺h 5P uUh 5T Wh 5T Ah@ 5T +hh 5T hu 5T 5xM h 5T 5xM h 5T ǹhˌ 5T 豹5|M h 5T 蕹h 5T 5|M h@ 5T chk 5T Mhu 5T 7h 5T !h 5T  hˌ 5T h 5T ߸h 5T ɸh 5T 賸h5T 蝸Uh' h) @H =H h' h/ D =D toh' h5 T =T tJh' h; ͹P =P t%h' hA 訹@ =@ u h` ظ j3#h hƎ 5D 蠷 0h܎ 5D 胷h 5D mhh 5D Rh! 5D <h, 5D &h7 5D hQ 5D h` 5D hn 5D ζh 5D 踶hQ 5D 袶h 5D 茶h 5D vh5D `= t5 h 5D ;= t5 h 5D = t5 h 5D f=RM tRM Ph 5D ɵf=\M t\M Ph0 5D 衵f=^M t^M PhG 5D yf=VM u= uh^ 5D Pf=VM thp 5D 0f=bM tbM Ph 5D f=dM tdM Ph 5D f=XM tXM Ph 5D 踴f=TM tTM Phϐ 5D 萴f=ZM tZM Ph 5D hh 5D Rf=ZM uh$ 5D 25 h6 5D h` 5D h5D = t| 5 pM h 5D 賳5pM h6 5D 藳5pM h 5D {h5D e= ts 5 ctM 5tM hÑ 5D (5tM hۑ 5D   8ouh 5D h 5D Ӳh@ 5D 轲ha 5D 觲h hm 5H 茲 0h 5H oh/ jj5H h 5H Bh 5H ,hk 5H h 5H h5H  Ev}u4E@@ EE;lM }lM EElM E@EƉh 5T 荱h 5T wh$ 5T ah8 5T Kh` 5T 5h 5T h 5T  h 5T h 5T ݰh 5T ǰh 5T 豰hA 5T 蛰h( 5T 腰hk 5T oh_ 5T Yhx 5T Ch 5T -h 5T h 5T h 5T hk 5T կh@ 5T 迯h5T 詯h[ 5T 蓯 @Ph 5T vh 5P `h 5P Jh 5@ 4h 5@ h@ 5@  E}u$EL  uU E@E׍vVh 5T 賮hh 5T 蝮hl 5T 臮5xM h 5T k|M HPh 5T N|M HPh 5T 1EvE;M ~?vE` |M )PuhÖ 5T E뷍v5M h 5T 迭EE;M ~'vEHPuh 5T 茭EΉh` 5T mhx 5T Wh 5P Ah 5@ +h@3 jj5T #M舊= ujh 'h 5H 軬h 5H 襬 5 h( 5H ~h; jj5H hF jj5H 5M h 5D 4h 5D hɗ 5D h5D ÐU}t4 E}u$UE;uE@vE@EՐÐU}~hܗ 5H 腫u h 5H lE@ u:Ex@tuh 5H =h 5H %E0h 5H  }~uh 5H h 5H ժUE @EE @Euh 5H 袪E}~!UM Ph 5H iEvE;E|v}~hܗ 5H 3 E 0uUM Ph1 5H  }~uh 5H h 5H ЩEgvh9 5H 譩}hA 5H 葩hE 5H yEhI 5H YUuh 5H 8E}~UM Ph 5H EvUE;B|7v Epuu UM Pu E뿍vh9 5H 虨}hA 5H }hE 5H eE,hI 5H EUEh] 5D hn 5D h 5D h 5D ۧh 5D ŧh 5D 诧hӘ 5D 虧h 5D 胧h 5D mh 5H Wh 5H Ah( 5H +h6 5H = tDždP  Džda dh 5H ئh 5H ¦hƙ 5H 謦hٙ 5H 薦h 5H 耦h 5H jh5H Th1 5H >hH 5H (P E萃}uEEEx<t Ep@EEfx@u4UE;BuE@EuuuZEfxuuhhPuE@ u Ep5X hY 5T E@0EpEp5M M h 5P  jE05P hh 5P 跓Ef8rt#X ;pM th 5P 艓E@ u E0EEEE}tE@ %uNE@ %u?] E0s9C| E@E" E0OE v|M EEEEpE05P Ef8t5=V t,h 5P 袒h 5P 茒 E0lMEuh 5P ^ E0NnM HPh 5@ 'Eph! 5@   E0mt$ffM EpE0ff fM h3 5@ 軑M HPM HPuE@ PEph 5T 聑 3M HPuE@ PEphC 5T L EpE05T  fuuh˝ 5T } tuu hם 5T 2v E05V 5V hם 5T Đ uf]ÉUE@EE @E}t.}u&EU;tE@EE@Ẽ}u}u6vE f8 #E f8.E@xE8tE@EEuE8tE@E vEY uh` ܐ h ̐ h 輐 h 謐 h 蜐 h˟ 茐 h؟ | h l h \ h L h < h ,ÍvUEE}uE@ tUE@ B Ext u[LEf8u uu E@06ExEp5X h 5T gE@ PEph 5T AEpE05T cE@ %tEUR P uu E@ PE@ %uE0 E v|M Euh 5T 詍 EpE@0h 5T 脍E@E}u Ep"J E0lEExtuu}E@EExth2 5T hA 5T  uE@ PEph; 5T 轌 EpE05T }aE@ %tEE@ B uu E@ PE@ %uE@E |M Euh 5T ! EpE@0h 5T E@EsvE@Ev}uxuu E0E@EEf8tEf8tEf8tuu uwuu uUE;BuE@ E:ÉUEEE8Ef8 jE0AVEE0E0GGE@ t-E@ u UE@ %B UE@ B E@ teE@ tXUE@ %B UE@ B 6E@Ev}u E0E@EUE;BuvE@ EÉUEE}u\UE@ B E@E}u E0E@EUE;BuvE@ E띐ÉUEE}u\UE BE@E}u$u E0E@EvUE;BuvE@ E띐ÉU}u EV V  ~jhP EE} t}tI|vjE0SEE0E0D umE>vEx t, E@ PEp P3EEEEÉU}uE7E@ E@ V  uUEEE@ %u E0 u Ef8  uUE}tsE@ ufE@ uYhd 5T VE8tE@E EuEphy 5T iE@Ev}u0 E0t 8vE@EUE;BuvE@ EÐU(xM EEEE@ %t |M ^Ef8  uE}t{E@ unE@ uahd 5T E8tE@E EuEphy 5T ޅ|M v E09E} E0EEEEEE@Ev}uH E09E} E0EEEEEE@EUE;BuvE@ EEÐUEE@$E}udE@ f8'uEE@ f8u E@ p E Ep EE@$EEÐUxM EE@$E}uE@ f8'uE@ f8uG E@ p ~9E} E@ p cE vEEEE> Ep :9E} Ep "EEEEEE@$EBEÐU8}u f=M t E!Eԁ}"Uԋ vE@vEPz@hvE uuE@@ u EE&E uuE@@ u EEE uvuE@@ u EEE@@ E}EEEEE@@ E}EUUEWE@@ E}EEEE/E@@ E}EUUEE@@ E܃}EE܉E܋E+  Ep E Ep u Ep$xuEEQE@ Ev}u 8v Ep 6t E@$EÐUSDxM E}uxM ^vf=M t|M EE!E}"#U vxM Ext |M E xM EE u uuE@@ uM uà u=9} u)E umE xM EEO ueuE@@ uM u!à u9} uE uE xM EE uuE@@ uM uà u59} u!E ueE xM EEGE@@ tK u0à u9} uE uE xM EEE@@ tK uà u\9} uHE uE xM E܋EoE@@ tK uXà u9} uE u!E xM E؋EE@@ tK uà u9} upE uE xM EԋEE@@ tK uà u9} uE uIE xM EЋE+= t xM E |M E̋E|M xM  Ep b Ep Fà Ep$39} Ep$E Ep EȋEzvxM EE@ Ev}u EVv Ep 9E} Ep EEEċUĉUE@$ExM ]UExtME@h 0zt!E@x@uE@PD|M )ЉxM vjh U=N uu h uzK=N t+u N ` 4h uezu h uMzU} uh u,z/E @ E @ E !E}".U E ph uy.h uyuE p uYh uyb.h utyuE p uh uJy.h u0yuE p uh uy-h" uxuE p uh$ uxuE p$uch uxl-h" uxuE p u!h& uVxuE p$uh u,x-h" uxuE p uhY uwuE p$uh uw,h" uwuE p uIh( u~wuE p$uh uTw(,h" u uhޮ uH\huyE@$EEvh u \ huE p hu E @$EE}uE@ f8'u/h% u[uEp uPRvE@ f8u/h% us[uE@ p uh+ uD[E@$EEVE; |#vh+ u [Evh uZhuf=VM th uZ}u#E x~h uZn=N ^h' usZ}uSE xuJh* uQZ hD uE p hu uhN uZhW uZhk uYh uYh uYh uYh uYhuYhѯ uYhk uoYh u\Y h uE p hu h u(YE @$EE}u9E@ f8'tE@ f8tEx$th_ uXE@ f8'tWE@ f8tJfLM ffM uEp uCf fM fLM h uhX h uE p h u' uh u1XEEx$uE xEuh uWE@ f8'E@ f8E@ f8*uE@ @fx@uh uWh1 uWfLM fNM fjM ffM uEp ufLM fNM fjM h= u*WuEp uf fM hA uVhw uVE@$EEh uV=P/  h uE p hh ur hL uVh\ ulVhl uYVh} uFVh u3Vh u Vh u Vh! uUh. uUh@ uUhuUh` uUh uUh uUh uuUhubUh& uOUhB u E @$EEv}uE@ f8'u/h% uRuEp uRvE@ f8u/h% uQuE@ p uh+ uQE@$EEVE; |h uQUh+ uhQEvh uHQuE p uh uQhuOv=N u+h uPhuh uPh uPuE p uEh uzPh" ugPuE @$p uh u:Ph" u'PuE @$p$uhƲ uOf=VM thʲ uOffM =N u=h uOuE p uTh_ uOfLM uE p u!fLM h uMOf fM uE p$uE @fx@u= h uOh1 uNfLM fNM fjM ffM uE p ulfLM fNM fjM h= uNuE p u'f fM hA uUNhw uBNf=VM thʲ uNE @0h uNE @ Ev}uh uMh uMuEp ueE@$Ef=LM uBE xt9 u U$ h uu h u9 - huu hu uu uvf=NM t"E @0h uLu A Ph uLvf=VM thʲ uLh uLuE p u,h uaLfLM fNM h uEx tE@ f8'uE@ U@;B|Ex uNExCvhչ udGuEp uh׹ u:GWhٹ u$GuEp uh uFEph uFEfxu9Ex$t0E@$x t$ huE@$p he u} uuFÍvUEf=NM tYE @ @0h uRFuE @ p uE @0h uF u NEh uEE @ @0 Ph uEh uEuE @ p uGE @0h utEE x$t=hչ uXEuE p$uh׹ u.E}th uEUEE}rt#}r }ct/Q}st}t?v:2*hEp tÐU}u_E;E u LEu Ep uu Ep$u vEEUV =V  u h 5D CV uh# 5D CU=V tV ;E u }tDv=V t( EHP5,W V 0h) 5D ~C E V E,W ÐU u5,W V 0h; 5D ?C ÉUN E}uE@;Eu;E@Eݐ j EUEfBUN BEN ÐUEN Ev}uLE@;Eu,E;N uN @N &EURPEEE@E믍vÉU}E8uvE@EE@EN E}uXE@;Eu@E;EuMEA;BusvEpEPuh` BQE@E롐 j 趼EUEfUEfBUE@BUN BEN ÉUu h 5D dAEV E;E~vEN E}uTE@;Eu4 j}tEURP'vE@N vEEE@E맍v}u jEgvh 5D @E ;pM uu h 5D }@E ;tM uu h 5D Y@N ÉUu h 5D ,@EV E;E~jEN E}u4E@;Eu EPEEE@EǍv}u jE뎉h 5D ?V V  u h 5D d?EV E;E~vEN E}uXE@;Eu8Epu;}tEURP$E@N vEEE@E룍v}uhV uE] u9h 5D >E ;pM uu h9 5D g>E ;tM uu hU 5D C>N u uÍvUEE fxtQd E}u@U E;Bu%E@ @0hq u=E@$EE븸ÐU(} uht u=cE !" E @PE pucvhv u$=uE p u]hy u<h{ u<uE p uhy u<h~ u<uE p uhy ur<Dh uX<uE p uh u.<uE p$ughy u<h u;uE p u%h u;uE p$uhy u;jh u;uE p uh uV;uE p$uhy u,;h u;uE p uMh u:uE p$u#hy u:h u:uE p uh u~:uE p$uhy uT:&h u<:uE p uuh u:uE p$uKhy u9h u9uE p u h u9uE p$uhy u|9Nh ud9uE p uh u:9uE p$ushy u9 h u8uE p u1h u8uE p$uhy u8v h u8uE p uh ub8uE p$uhy u88 h u 8uE p uYh u7uE p$u/hy u7 h u7uE p uh u7uE p$uhy u`72 h uH7uE p uh u7uE p$uWhy u6 h u6uE p uh u6uE p$uhy u6Z h up6uE p uh uF6uE p$uhy u6 h u6uE p u=h u5uE p$uhy u5 h u5uE p uh un5uE p$uhy uD5 h u,5uE p ueh u5uE p$u;hy u4 E @0h u4E @ E}uhy u4h U E;B uuEp u*h uX4uEp uE@$E뇍v hy uE p h u  hy uE p h u  hy uE p hŻ u  hy uE p h̻ uz l hy uE p hӻ uR D E xt Džۻ  Dž޻ uE p h u E @$EEv}uU E;B$th u2Ep uuuEp u E@$EE땐 h uE p h uj E @t* t[Yt#t2Ch u82.vh u 2vh u2E @$EE}u`U E;B$th u1Ep uuuEp uE@$EE뙐E xYh uo1Av E xt Dž  Dž uE p h u E @$EEv}uh u0U E;B$th u0Ep uuuEp uE@$EE끐h u0uE p uhy uV0(h u<0uE p uuhy u0h u/h u/uE p uhy u/h u/uE p uhy ur/Dh uX/uE p uh u./h u/uE @$p uQh u.h u.uE @$p$uh u.uE p uh u}.uE p$u8hE @0P/EEv}~iE PEE덅UE }\uEUE }"u‹E'}uEE댃Ph# u-E @ E}uhy u~-Ph ud-uEp uE@$E뫍v h uu h u uu uvE @0hq u,h- u,uE p uhy u,th5 u,Zh= up,BhB uX,*hH u@,hM u(,hS u,hZ u+ha u+hn u+hq u+ht u+mvh{ u+UvE kHP f%@ftE Ph uE+E Ph u)+UfLM fNM uu uKfLM fNM U}uh 5@ *E@ E@ E!E}"eU u u5@ $`h" 5@ Q*EX ;tM u2= t?h; 5@ * hR u Ep hT 5@  hV 5@ ) hR u Ep hT 5@  X ;tM uE@$EEE}u0E@ f8'tE@ f8tEE@$EEɐha 5@ 5)}u$Ex~hd 5@ )}u^ExuUhg 5@ ( h u Ep h 5@  uh 5@ (h 5@ (h 5@ {(h 5@ e(h 5@ O(h 5@ 9(h 5@ #(h 5@  (h$ 5@ 'h+ 5@ ' h> u Ep h 5@  hB 5@ 'h$ 5@ 'h 5@ {'hJ 5@ e'h$ 5@ O'h+ 5@ 9' h> u Ep h 5@  hB 5@ &h\ 5@ &}Exhf 5@ &E@$EE}uhp 5@ & hx u Ep hT 5@ E uh~ 5@ L&E@ f8uu E@ p Dvu Ep +}Ph 5@ %E@$EE.h 5@ %}E@$EE}uE@ f8't[E@ f8tNE@ f8*uE@ @fx@u/vha 5@ I%hd 5@ 3%E@$EEyh 5@  %hd 5@ $vfLM u Ep 5@ 耪fLM h 5@ $E@fx@t,ha 5@ $hd 5@ p$u Ep$pSvu Ep W:u uB%EPh $% jÉU}u EE}}}A}.tW}ctWv}K} |B8hEp 5)huvÐU}u_E;E u LEu Ep uu Ep$u vEEU}uiEf8@tEf8t*vh\ 5@ "u uu Ep u Ep$ÍvUh+ jj5H = u&Pha 5H "f=\M Phl P#h 5H !Ph 5H !h 5H !Džv@9|<PPh 5H K! 벉h 5H )!h 5H !Ph P"Dž@9|,Ph: 5H  ‰fxuGhG 5H  h` 5H n h 5H X vh 5H = h 5H ' @h+ jj5H h; uPhl P!Pha 5H fxuh 5H {vfx@HPh 5H @h 5H *h 5H Džv@9|LPh 5H Ph 5H 뢉h# 5H h* Pzh5 5H dDžv@9|,PhD 5H #‰h 5H fxu%Ph` 5H vh 5H Dž@9|HPh 5H {h 5H _릉h 5H =h 5H '@$h0, jj5H h8ÍvU}u /EE}|}|}-}-;}&}%}!}+}*v}R}R}/b}?Xv}^F}c<{v}&[}#}}}~}te4}}}@'}7}'tq}*tv}CtfdM E@h 0Zu EPz@vfdM y Ep &b Ep JE Ep t Ep$tEEvÐU E}u0E@;EuE0h  E@ EɐÉUEPuy=8Pu ƅy E;x} ÐU E}u\E8t Ef8t,E8t Ef8tE8tEf8t uHE@E럍vÉU(= t&5  0h P !v 0h Ph P@W =@W up PPh P@W =@W u$Ph  j= u=P 0tP 0h `  < EPh\ h h& 5@W s t,= u 5\ 봃= u?= t= u h0 뇍v h9 ۳ovf= t=\ uT E}uE@;EuvE@Eݐ}u!u5\ 5 h` M  )Љ EEf8@EH9\ uf @   = u h 5\ 5 h gv=\ V5 h  EPuu5\ h `   = u%EE;\ u @ ѐ= u45\ 5 h uh  EBE@ E@  EEf8 u!jE0¡ P~vEf8uPE쉅v .tU싅;B uЋ B"v E0 E@ B ;   u uv ;Eul= tcju4 h Ef8uE@EjE05@P A h e tx t 5 |= t h  xj pC¡ P5 h  jXÍvUEPEPEPEPh! 5@W  t=uuh. u uuuhA Q딃 jÐU  )ЉE uE Ev}u(EE;EuE@@E@ EѐÐUEE;N |'vE`W ;Eu_E͐=N ~jh` 1N  `w E N  `W EN UEE;N |+vE`W ;EuEɐEE; N |'vE`g ;EuPE͐= N ~jh` U N  `g E N $N ÍvUVS EE; N |EE;N |7vE4`W E `g ;uE뽐E;N u}E`g ;HM u%=$N uX5HM hy u=E`g 4h EPGEPh WEEE;N |WvEE; N |7vE4`W E `g ;uE뽐E띐EEE;N |E`w <t`E`W E`W  E`w }~jh )EEovEN  N e[^]ÍvUEE;N |GvE`W ;Eu#E `w <E뭐ÐU h jE05@P m h u h >ÐUEE}}}5}@}ct%}}hEp th u&jpEp mt[h uFvh: u.vhN uvhe uÍvUE @E}u E0]<E uEE}s:}r }R}R}..}cn}tW}}}tuE@0u&EvuuuEE@ f8uEp uEgUE~h| u h u .UE~h| u h u N EpE0uNh u N UE~h| uT h uA N X ;pM th u E pEp u賐X ;pM th u h u N E@EYEÐUhE`   E 0E E}s:}r}R}R}.|}cl}tw}}G}t}2,jh Ճ ujuE @0u Dv ujjE @0u h ux jE 0uuh uJ h u7 EcE @ f8Nh u jE p uuh uh uEh uN E pE 0u1h ufN h uDX ;pM th u$N E pE p u貍h uN h u}t Fh uh` uh u~h ukh uXuh EP E`  uuE pE 0u } EptLE@ t E@ u2Eph uUE@ B $N jEp u8 E p$N ÐUXE Ev}uE@ tUE@ B E@ u<=$N Eph u EppEph u$N jEpEx u.EE} O} }.Gv}tG}t-E@E jEp EpE0u ~v=$N tmEx tk E@ PEp 4P|@Euh uh1 u up}tBEph@ uphQ u] Ep(jh^ =$N tE@ P jE0FP3@Euh uhv u u=$N t Ex E@ @ Ex tE@ @EEEĉEuh@ uHh u5 uv EpֿN EN h uEpE0u興h u$N EN N Ex tE@ @E EEEEx E@ @ =$N yuh u.h u uE@EE}uuEph EP N  N  ` EȉEf8t E@ EEEEE juEpE0u N EȃPh uM$N E@EE9=$N u[h uE8tE@E vEu5(N (N h u$N E;Eu<=$N uC}t=Eph u EpfE@ EÉU,N E}uHE` 021uE0h@ z^E@E뱐=` ujh` z j zEU` UEBU,N BE,N ÐU} uvE puE 0h u}E @E}u q E@$p UE EEE}uE@ Ev}uE@$E׍vE@fxu"E@p4uuE=EEPE;B|$EkUE@@ EEΉE@$ErEÐUSEfxtjuTEx E@Pp‹EPEUE;B|jjjEp4{ËMEkAMEkAE}u E뫍vE@ Ev}uE@$EӍv EpE@$EЋ]ÍvU}u  j("pEUEffUE@BUE@BUE@BUE@B} tujjEp ‹EP }tujjEp$a‹EP$}tXExtO jLo‹EPjLEpEpE@fx@uEPT T BExu ExujhZ nEÍvUEE0hm u} tuuu XE}u E @$@ EE@fxu.hp ujuuuoEE0hr ucE@x~.Ep  Phv u0EEÍvUE@@4E}uTE@ Ev}uE@$EۍvE PE@20uGvE@$E빐E@0E @0h PWjPglÉU}uu uE}uE@$@ EE@fxu*hp u ujuuE0hr hPhPuE@x~@Ep n Phv hP[hPuvÐU u E xuE 0uh hPDždU d;B|E x~% dE 0uh hP M dkAE}u d똋E@ Ev}uE@$EӍvE@fxuEphP %E@fx@uEphPEE@$EÉU uExuE0uh hPDždUd;B|Ex~% dE0uh hP MdkAE}u d똋E@ Ev}uE@$EӍvE@fxu*u uuEphPu u (u uuEphPu uH E@$E낉ÉU( uDždvUd;B|9Ex~du h hPyu hPMdkAE}u d눋E@ Ev}uE@$EӍvE@fxujhPPhp P E@0PuPEp,Dž`EP`;B| E@fx@uu`Ep h }tEpE0h `E@0hPh AE@x~`hv  h EPfz PEH`kA45@P  h `E@$E:ÉUE EEE}u9E@ Ev}uE@$E׍vE@fxur uE@p4uuu E}jjjuEjE0j.jMh‹EP$UEEEPE;B|pE;Eu\jjjuV‹Ejjh'jg‹EP EP EB}t EEf"EE뀋E@$EEÐU}u Exujh eE@fxt|Ex$ulE@$f8.tHE@ E@ E@$Ph E@0h We E@$p CÉUE} u ES}uDjju=E}tuuEEE@$E뷍vEÐUEE@fxu uuvE[} t E@x4ud= t E4v h ju5@P I h mE@0h d E@p4EEHE}yujj,jfeE uE@p4ujE PN x+uh: E@0hT }cjjjuPEjEp j.jd‹EP$UEB EEEÐUEEvEx$u)Ef8,tjhe bE@$EΉEU P$EU0N E}uHEE@20uE@0h a:E@E뱐 j bEUE@U0N BE0N U0N E}u0E0u>uE@EɐÐUE@N E}}5}} }(tQx}f} +} }tM@} .E=@N )t h @N d E@N ‹EP u@Ev@N  P jjhMPh MEt?@N  P jjh NMPh >ME,d E@N d E@N }u h EÍvUE}yjv EHPEE}~%EEk`N @N ;>@N EHPw PuEEk`N 4;LEEEk`N <ugEp jEphKP>PhKE u=P1>EEEk`N <jEp hoKPT> PjEphFKP+>Ph+KP=P= PEp K PEp{KPhJP<P5=PhJE u~<P=EE}u h UEÍvU@N  jTÍvU P*ÍvUE UE E 5EEPE Ѓu UE E뿍v EKÐU8EE;EuE 9#E@N uh EP EP4 EÉU EEÐUgEE  }%jjj;Hd ;v} tEkHP f%fh`uh h u%jjh pHd  h h u'jjh.Hd Wjjh Hd  h 0¡d P }<E}>u&jjhGd }-tA h p E}>u%jjh\Gd  h & EE}U/}U9}&}&}!}-}/t<v}[}[}V}\t.}|tdvj/hj\ Ej\hj/Ej&hj&Etj|hj|EXj[hj]E<j-hj>wE EvE  vE jjuEd EÐU u$EE` E}u4Eu0u EvE@EŐ j:3E uU@P3‹EuE0]ME` AE ` EEÉU j2EUEEÐU塘N ;N }` N N vN ]ÍvUh` h 5h ÐU=N ~ N ]U N }.E 8-tE @E}ft@}f}dt$v}n}vvN ME EU E9E|1E 0h`  h` N fE UЀ8 t&E UЀ8"tE UЀ8 tE U EjN  N ME =N u; h@ F hb 6 h & jiw=N t N U5N h 5N h A3ÉU}u1vEffEf}f}Ff}f}f}f}Tf}vf} Lf} Xf} f} Lsvh 5h  Ep,h 5h  Ep h 5h )vh 5h } Eph 5h V Ep h 5h /vh 5h  EpTh 5h  Ep -h 5h Qvh 5h  Eph 5h ~ Ep h 5h Wvh 5h 9h 5h # Epfh 5h h 5h rh 5h ZE@0h 5h :h 5h " h  EPUEE}}b}1}};}}}Z h } } "}}7v} } }  h v h kv h Sv h ;v h* #v h-  v h y h0 e h2 Q h = h ) h4 uhC xÍvU hF ]} tu uF u5=@N t:=@N t1 hP  5@N  hX h` hZ EvE;N |v hq Eِ hs  5@P N ÍvUjuUu u jvU h -E@E}u, uQ h E@Eύv h E@Ev}u, u h E@Eύv h E@ Ev}u, u h ]E@Eύv h ?E@Ev}u, ua h  E@Eύv h ÉU}uvEN EN =N tVE0h E@E}u E0h zE@E؃ u!N N ;N ~ N N ÍvUN E}tEN  N EÐU5N N h h` ` ÉUEffEf}tf}tXvEEpu ut$Ep u utEEEEpu umu Ep u uPuEEIE @Ev}u0uuug;t vE@EɐÐUSN E}ulExtTEf8 t!uuhu,vMUX`AN  N EE덐]ÍvUSN E}uExtjuuj+tQE>vjh MUX AN  N N N EEp]ÍvU}tEffEf}tKf} f}t;[f} t f} t)IN  u Ep f Ep Ep xÍvUN E}u4Eu0uElEEƉN E}u4Eu0xu E@'vE@EŐuh dÉU u CE}u6v uPEUE@BUEBÍvUEE}u E{ u5E u6'P'E}u-Ef8 t#Ef8tEf8tEf8t[vuuh7}uh 5h 3 uyEEf8 ubu Ep h|7uCuEp h]7u$ uuuu Ep ENEf8uD uuuu Ep E uuuu Ep v EEÍvU}uEP ui4E u%P+&E uuuu u ÍvUEE EE;N ~EEE9E|+vEU`;Eu EEŐ}t ETvEE9E|+vEU ;Eu EEŐ}tEE9EÐUE=N t =N uh uvE ;N |h uVE @PuEE E;N |h uJEE Ph u-EÍvUXE@E}u E03E}ukvExt3uu EPE0EPh EPh EPEPEpuuE@E^ÉUXEE;N ~N E}u EۍvExu}t.Eh 0&u=N tE;N u5Eh 0th EPuh EPE0EPEPuuME􋀨EÐUEEE}utEE}u,EU022u E@E͐}t" uEUEBEEE@E뇍vEÐUEEv}uEE Ev}uE@EӍvEU02t EE1vE@E u}t UEBEE E@E닍v}u E ]v} u EMvE xuE UPE 1vEEExu E@E鐋EU PEUE jjjjh P wEUN MUEBAEN N E}udE@Ev}uE@EEΉE@EE0E0 u1EE몉ÉUEEE}uL u.E}tuuh\-EEEE@E믍v}u E v uPÐUEEEE}u@ uq-E}tEUPEE EEEE@E븋EÐU h}E}t UE#v P‹E} t u ‹EP}t u‹EP}t u‹EP}t uK‹EP u]UE-E} U@ E@0h vh" h Fh$ h .h& h h( h  Ep I Ep8`vh* h NӐh, h 6.h. h h0 h ÐU}u>Ef8 u E@)  u h ÐU( EpEUE@BUEB Epm‹EP Ep T‹EP=N t u=N t0Ex t E@ EEl uhq  N E}ui=N tE0h =N t2Ex tE@ E El uh EU@ ;B uEU@;Bu'v=N  h ^=N t h >ExtEpEp&‹EPE@E}uxE@Ev}u(uuf)tvE@Eѐ}u( u(EUE@BUEBE@E냍v j EUEUEBU졨N BE죨N E@Ev}u$E@EujZ'EE׍vE@Ev}u$E@Euj"'EE׍vE@ Ev}u  E@Euj&EEύvEEv=N t N =N tE0h \E@E}u<=N t ux=N t h E@E뽐=N t5N h =N t N N EN EN ÉU(Ex =N tE0h 脿=N t u- ut]Ex O=N t h -E@ E}u<=N t uH=N t h E@E뽐=N t h ƾ jjEp E0iPj =N tYE0h wE@Ev}u E0h NE@E؃ uE@f8E@xt4E@@ EExu E@E鐋UE@@BE@@EEExu?UE@@ BEpj#UEB uE@E뭐EE@EUE@@BE@Ef8 tfEf8t\ExtJE@EExu UEB5uu$t EE@EUEBE-E}U uj"E@Ev}u$E@Euj"EE׍vE@Ev}u$E@Euj~"EE׍vE@ Ev}u1E@EujB"EEӍvuj'" u}tuj! uvE@ xt$ EPjh E@xt$ EPjh E@ EUE@B}t EE u!EUE@ BE@E Ep !‹EPEPE@B u‹EP u uEpuEpj E@ xt$ EPjh E@xt$ EPjh E@E}t EE u EUE@ BE@ EUE@BvE@ xt$ EPMjh OE@xt$ EPjh E@EE@ EE@ EUE@BUE@B uEpuEpj% u‹EP}tuj9 uÉU}t=N g=N t:h0 5h 觷 uh> 5h 胷=N t uE jjuh *P Pj2 vN Eu"EN  u[҉=N t u uK/=N tb hC 5N h` 諷5N h 蕷5N h  h> oÉUE E20,t E pEpÍvU}XE-E} @U E? Ep‹EPExuEp j Ep r‹EP Ex uEpjE Ep&‹EPExu Ep xv Ep ‹EP Ex u E@IEBEpj Ep ujÐUXN E}u4Eu0Nu EE@EŐh ujh u۴ttE}?~EE8_u vEᐃ}?~uh nEEPh/ EPw EPvÐU}tlExucE@Ex tE0h8 [E@Ev}u( E0PE@ EÉU u EN Ev}uEu0趲uCE@ E@Ev}ulEpjE@E@ EЋE@Ev}u0Eu0BuUEE@ EȋE@EBÉUu uhEEUN E}uuExuVE@Ev}u=E@ Ev}uEE20vExu.Epjjjh ETExu/Epjkjjh EEpEpE=N tE0E0h` ر u> P ‹EPE@E@ EE@ EE@EÉUEU @ :B t E@Ev}u`EE @E}u,uut E E@ E͐}u E@ E뙐E @Ev}u`EE@E}u,uu>t E E@ E͐}u vE@ E뙐ÐUXN E}uE@Ev}uuu=N tE0E0h E0E0Ejh 0uP=N uGEPh EPOE0EPaE@E*E@EÉU}uv Ep Extlh 5h  jjjEpEp th 5h ĭE0h 5h 觭ÉU}=N uExuE@E0h 5h WEjh 0u*=N u!EPh 5h  h 5h  Eph 5h ϬN U jHE u‹E uP{‹EPExt$ EpPn‹EPN Ev}u@Eu 0uUE@B UEB{E@E빐 jE u ‹EUEBUEBjh u uE@ EN PEN ÍvU% h Eh 5h Q}h 5h 6 u(=N uh 5h }u#=N uh 5h ߪ> u-N E}u u E@Eߍvh 5h 艪h 5h sÉUVS EHE}O~E@ uh K EP%EEN E <iE ЉEE EE <tE M ME@EEUE}~ E EE4 E E EEkP$E  EEkN E EEEE E;s%UEEEE)E@ E@ @ E EE EUE UEvE;E|EkEEݐEe[^]ÐUSEEE(E%=Utjh= YUE%E}O~ ]E E @ ME E E]ÉU hT !Ev}O~|E EE@ EE EE E Et uuuuhp 蝧 E|ÉU}tEf8tEf8u EdE@Uff;t)E@EUE@ BUEB EEƉEx t Ep ‹EP EÍvU}uEe uy E}tED Ep ‹EP Ep‹EP u ÉUEf8t$ EPjh E@-E} U0 =N t h  Epj+ E@Ef=N t h ƥEpj E@Ef \=N t h 肥E@@EEpj E@uj} EEv=N t h "Ef j=N t h Ef F=N t h ڤEf"=N t h 趤EfE@@ EE@@ juh P‹EP E@fE@E u‹EP uP/ÉU(E} uE ;Eu-E p uE pu}uE f8 }uE f8 u E=N uEN v uYEN ;Et EN EN EE;EEx uv EpEEU02СE}uv}y6}u$5N uuL N E EEEE@ EPE E E0bEEU028E}uG}y"E0uu‹E vuE0u‹EÐUE ;EtE p jE @ E fUH}u EIEE}t}t E"vN uuPuj}LN E}uEf8uE@E vEEEEEf8 uuhAEf8u65N jjjhZN (vEf8uE@ E vEEEFN E}uuN E}u5E;EEf8Ef8Ef8u E@EEE܋E܉EEf8uE@E vEE؋E؉Euuntuhsuuh- tuhBvEf8 u55N Ep htuh\Ef8u E@ EEEԉEEf8uE@ E vEEЉE}cN Ev}uEf8uE@E vEE̋ẺEEf8uuhAEf8 u65N jjjh N vEf8uE@ E vEEȉEFN E}uN E}uIE;EEf8Ef8Ef8u E@EEEċEĉEEf8uE@E vEEEEuutuhuuuhtuh@OvEf8 uBE@f8u55N Ep h|tuhEf8uE@ E vEEEEf8uE@ E vEEEnN EE}uEf8E@ Euj}uN @ N E붉UEB EEx uExtEf8t Ef8t뀋E@EUE@ffUE@@BUE@@ B UE@@Buj&EEE@ E=N ujjh  N ÍvUN E}uTuE0t/Ě ExtE* Ep2E@ E륐ÐU}u E uiE}t E  j$E u‹E u‹EPEpE0t(E@EpjmUEBUN B EN  Ep2ÐU5 h` 5Ě hy љU} uP}t:E pjE @E p jE @ u U jEUEfUE BUEB EU}uEF jEUEffUE@BUE@BUE@ B EÐU}uEK uE Ep‹EP Ep ‹EP EU}u} u }t} u EU ff;t Ext7E xt.E PE@20t E pEp`t'E p Ep Ct LvE pEp t'E p Ept vÐU}u} u }t} u EU ff;t Ext3E xt*E PE@20ƕtIE pEpHt'E p Ep +t vÐU}u }u[E f8uQEuE put$uE p utEEu ut |}uEf8ucE;Et PEEpu uu Ep u uuEEUSR[YPu ujє]ÐUN SN tv'ЋuX[]U]ÍUSR[^Yv']$FreeBSD: src/usr.bin/yacc/skeleton.c,v 1.28 2000/01/17 02:04:06 bde Exp $    "$!!%%%%)))**''++...1///-4547366((;8=88?8888999A99C9D9E9F999G9H9I9JK9>>ML##&&00000000000000000000000N000O0P0000000BBQQQQQQQQRRRRSSS22@@<<TTUUUU::::,,,  89$&" (*+,.%';<=#NR_q]xv31VWpLFI)-g`}rt4/ZncdBM>@Se\|a26 U^D0[oYiQ~yw!fsukmzJ m~?%@/Ht,G (GU:n< op45V67rxXYstB:Q,ukvwyZC&H?EUS ntC~/uB 3t Ka b{b + b:uJ uv 'B v bbbb(13 . ,,ddB YB B IJbg J Z[ ` ` ] t {/}2S5VW?@#S= RZb#5morPP$K p ,;PFsP PGk29yt/PPPplG.Opp|~ K 4vyM$W-Ob ?@>?7{B6 A|`2[8\u3OO5OOOOOOOOJxzRASTOCFyT}-v/0w!{|POO?E#$&;;'TT)TTTTTT.TNO7 z7*OO+T{}{0F9Z]F^1b2b;bbTT=bgopClDE5555TTCCCCj7=7WOOO>OOOOOO7O7OOOOOOOOOOOOOOOOOOOOOOOOOOOTOOT T !TT"TT#7)T7*TTTTT.TX8T12XTTTTTTTTTTTTTTTTTTTT3TT4DFILPUXVY_abefchijnqsr~:"5+}<hhXXXj hEhhElK'EKKKEEEEEEEEEEEEEEEEEEEKKKKKKKKKKKKKKKKKKKKqxyqq zqqqqqAAAAAAAmAA|lRGGGSTRGSHIJKLMdefgNOPQGGGGGGGGGGGGGGGGGHIJKGGLMNOPQHHHHWHHHHHHHHHHHHHHHHHOOOOOOOHHWPOOO&($%W99WMKdWWOOOOO{OOOOOOOOOOOOOOOOOlRkSlRlR[\HIJK]^_ `kaSbcLMdefgNhilPjRQkSTkSR[\HIJK]^_`abcLMdefgNhiPjQ[\HIJKS]^_`abcLMdefgNiPjQ[\HIJK_bcLMdefgNOPjQHIJKLMNOPQ([[{,%})(*+/--/  ?: ))?H*(l'*,-2%&}()*+,-./"}b-[/0:D*}%9*,*?[/(+*% ~*+}-~/[]^}(+%&(()*+,-!/)*(FG+'|}{:~{{2@456DF 56*78AB*]]^'P[\{"W%&,()*+,-2/(''|}:*}%&()*+-/%&(*+(-[/<]^()+%&((**+,-{/%&{(*+(-/(^*|}%( '*+*-/^*:(+ |?@^78(]+'./0123456789:;<=>?@AB|)FG[.,{)( )]t)()([+[ ;<=>?@((}+))-/0123456789:;<=>?@AB%)FG*+)-/ )<<8} @,}[)( }}'}{)(]]+*)/01}});"789:;<=>?@;)))}FG%&,()*+,-)/789:;<=>?@:{}{))}9:;<=>?@{ z}~789:;<=>?@]^9:;<=>?@&k()+,-9:;<=>?@:|}(-]^78&()+,-2345678:|}AB'[*<]^ &(),7 |}: /01 F]^(+/01)789:;<=>?@|})FG ) ](+/01789:;<=>?@}FG '*)} <}%&(*++-//01789:;<=>?@)FG ]^ })(,+/01|789:;<=>?@FG&(),}:)};]^&(),7:|} }]^ &(),(+/01:|})FG789:;<=>?@]^ 7 |}(+ /012} }FG(+/01789:;<=>?@FG 7 <(+/01789:;<=>FG h (+/01789:;<=> FG&(),:FG]^&(),:|}]^&(),)*:|}@DFX]^[\&()k,|}:  ]^(+/01789:;<=>|}FG (- (+/01789:;<=>FG ), %&~(*++-//01789:(FG- ^ &}(),(+/01:|789:FG~]^(),:|}#$%&'*,]^()3,: |} ](+/01(),|}FG:9:;<=>?@'*, 3] (()+,/0178}: FG ](+/01),78 }FG (+/0178FG}  (+/0178FG  (+/01:7EFG QRST l(+/01%&*+-./FG[^%&*+-/%&)*+-/|}%&*+,-/%&)*+-^/%&)*+-^/%&*+-/ |}^%&|*+-^/"^:|%&]^*+-/||M^P|W^|%&)*+-/%&*+-/|23456789:;<=>?@AB^^|789:;<=>?@|789:;<=>?@(-789:;<=>?@789:;<=>?@789:;<=>?@789:;<=>?@%&*+(-/-789:;<=>?@{%&~*+-/789:;<=>?@^^|{}~(-789:;<=>?@|789:;<=>?@(- {~ #$%&')*(,--3{~  #$%&'()*+,-389:;<=>?@({~-89:;<=>?@ [ #$%&')*,-3~ #$%&'*,-3#$%&'*,-3'*,3syntax errorinitializer in parameter list:root:claim %s redefinedtrace %s redefinedtypedef %s must be globalinvalid use of '%s'malformed declarationcannot %s mtype (ignored)mtype declaration must be globalundeclared variable: %snot an eventbad label-name %sarithmetic on chanarithmetic on chan id'sused 'run' outside proctype:init:varrefinvalid PROVIDED clauseusage: provided ( ..expr.. )unsigned cannot be used as mesg typerargeval rargyacc stack overflow0˶˶˶˶˶˶˶˶˶˶˶˶Dl˶˶˶˶˶˶˶˶Ht̓ܓ@h$h,hܖ,TpЗ<L`˶˶tܙ,`L<DxL\ĞО ,ȟԟD<t<L(lĥ(@ <Px˶˶˶˶0\ 8d@lĪHl\(Xd$l,@Thxȯ@lİL|ܱ$˶Ht̲ܲlX\(<xprocedure name %s redefinedcannot happen, ns %sinline fcts too deeply nestedwrong nr of params on call of '%s'cyclic inline attempt on: %smalformed preprocessor directive - # .malformed preprocessor directive - # .linenomalformed preprocessor directive - .fnamemalformed preprocessor directive - fname."bad param to inline %sbad inline: %s #line %d %s {inline text too longempty inline definition '%s'string not terminatedcharacter quote missingKKKTX(x4pinstanceclusterxsxrunsignedunlesstypedef:show:showtrue:trace:tracetimeoutskipshortinlined_steprunprovidedproctypepriorityprintfpc_valueofodnp_:notrace:notracenfull:never:nevernemptymtypelenint:init:initif:hide:hiddengotofullfifalseevalenabledemptyelsechandoD_proctypebytebreakboolbitatomicassertactive_last,()bitbyteproctype %s, '%s %s' could be declared '%s %s' redeclaration of '%s'(%s) has invalid width-fieldunsigned without width-field(%s) only an unsigned can have width-field:hide:a bit variable (%s) cannot be hidden.:show:chan initializer for non-channel %sbad array size for '%s'error: x[rs] claims from %s and %s conflicting claims on chan '%s'non-local x[rs] assertionxr or xs of non-chan '%s'mtype redeclaredbad mtype definitiontoo many mtype elements (>255)unsigned bit byte chan short int mtype structproctypelabel value %s %s.[%d] %d %s <%s> %d chan %s-sent toreceived fromused as parameter in send stmntused as parameter in receive stmntpolled in receive stmntused as r-value in asgnmntused as l-value in asgnmntimported as proctype parameterexported as run parameter %s by: to %s par %d, never used under this name%s spin: warning, %s, proctype %sglobal, '%s%s' variable is never used _attempt to read value of '_'_last_p_pidself-reference initializing '%s'spin: indexing %s[%d] - size is %d indexing array '%s'undecl var %s (assuming int)findlab through getglobal on %s cannot happen, cast_val%d->%d (%d)value (%s) truncated in assignment#ifndef XUSAFE setq_claim(, %d, ", h, ""%s"); #endif %s[%d] = ~G%s = %s = %s MSC: ~G %s %s %3d: proc %3d (TRACK) line 1 "var" (state 0) [printf('MSC: globvar\\n')] = %s %s(%d):%s~G%s(%d):%s = %s(%d):%s = MSC: ~G %s(%d):%s %s (state 0) [printf('MSC: locvar\\n')] /lib/cppspin: %d error(s) - aborting Exit-Status 0 %s %s > %srwspin: cannot cp %s to %s %sSpin Version 3.2.4 -- 10 January 1999%s use: spin [-option] ... [-option] file note: file must be the last argument -a generate a verifier in pan.c -B no final state details in simulations -b don't execute printfs in simulation -C print channel access info (structview) -c columnated -s -r simulation output -d produce symbol-table information -Dyyy pass -Dyyy to the preprocessor -Eyyy pass yyy to the preprocessor -f "..formula.." translate LTL into never claim -F file like -f, but with the LTL formula stored in a 1-line file -g print all global variables -i interactive (random simulation) -J reverse eval order of nested unlesses -jN skip the first N steps in simulation trail -l print all local variables -M print msc-flow in Postscript -m lose msgs sent to full queues -N file use never claim stored in file -nN seed for random nr generator -Pxxx use xxx for preprocessing -p print all statements -qN suppress io for queue N in printouts -r print receive events -s print send events -v verbose, more warnings -t[N] follow [Nth] simulation trail -[XYZ] reserved for use by xspin interface -V print version number and exit spin: cannot open %s _tmp1__tmp2_pan.prespin: rename %s failed progressaccept_%sspin: missing argument to -f reading input from stdin: spin: -c precludes all flags except -t __p_pid_last$P Tpd|0Xspin: line %3d %s, Error: saw '' near '%s' not enough memoryspin: Warning, never claim has side-effect never claim contains i/o stmntsenabled()pc_value()spin: Warning, using %s outside never-claim spin: Error, using np_ outside never-claim %c' = '%d\b\t\f\n\rconditionsendrecv@(x->y:z)%sactive%s&&%s=%sassert%satomic%sbreak%snevera constant%s--%sd_step%sdo.%selse%sempty%senabled%s==%seval%sfi%sfull%s>=%sgoto%s>%sif%s++inline name%sinline%sinita label-name%s<=%slen%s<<%s<%smtypean identifier%s!=%s! (not)%snempty%snfullsub-sequence%snp_%sod%sof%s||%s!!%spc_valueprocess name%sprintf%sproctype%s?%s??%s>>%sruntoken: ::;%s!a string%stimeoutdata typename%stypedef%sx[rs]%s- (unary minus)a typename%sunless   `   ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` x ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` `  ` ` ` ` ` ` ` ` ` ` ` ` ` ` H 0 ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` `  @  xp   0  @   ` ( @@ 8` ` ` ` `   p ` (P `   Xx `  P  0`   %%%%EndSetup%%%%IncludeResource: font Courier-Bold/CL 2 def%%%%BeginSetup%%%%EndProlog 0 spacing neg translate } {show} ifelse grestore } forall moveto char stringwidth translate grestore char true charpath clip StippleText gsave currentpoint char 0 3 -1 roll put { /char (X) def gsave stipple { justify neg mul 0 moveto dup stringwidth pop justify lineLength mul baseline neg translate strings length 1 sub spacing mul height add yoffset mul translate lineLength xoffset mul translate newpath exch pop exch sub /height exch def pop pathbbox dup /baseline exch def 0 0 moveto (TXygqPZ) false charpath } forall newpath dup lineLength gt {/lineLength exch def} {pop} ifelse stringwidth pop strings { /lineLength 0 def /strings exch def /spacing exch def /xoffset exch def /yoffset exch def /justify exch def /stipple exch def/DrawText { } if setgray } if .5 lt {0} {1} ifelse CL 0 eq { currentgray CL 2 lt {/AdjustColor {} bind def /Temporary exch definefont end currentdict /Encoding ISOLatin1Encoding def {1 index /FID ne {def} {pop pop} ifelse} forall dup length dict begin/ISOEncode {/yoffset 0 def/xoffset 0 def/strings 0 def/stipple 0 def/spacing 0 def/lineLength 0 def/justify 0 def/height 0 def/baseline 0 def50 dict begin%%%%BeginProlog%%%%EndComments%%%%DocumentNeededResources: font Courier-Bold%%%%Orientation: Portrait%%%%DocumentData: Clean7Bit%%%%PageOrder: Ascend%%%%Pages: (atend)gsave /Courier-Bold findfont 8 scalefont ISOEncode setfont 0.000 0.000 0.000 setrgbcolor AdjustColor %d %d [ Spin Version 3.2.4 -- 10 January 1999 (%s -- %s -- MSC -- %d) ] 10 -0.5 0.5 0 false DrawText grestore %%%%Page: %d %d save 10 %d moveto %d %d lineto 10 %d lineto closepath clip newpath %f %f translate %f %f scale msc%s.pswcannot create file '%s'%%!PS-Adobe-2.0 %%%%Creator: %s --%%%%Title: MSC %s %%%%BoundingBox: 119 154 494 638 %s%d.trail%s.trailr%%%%Trailer end %%%%Pages: %d %%%%EOF spin: wrote %d pages into '%s.ps' %d %d moveto %d setlinewidth 0 setlinecap 1 setlinejoin %f %f %f setrgbcolor AdjustColor stroke grestore closepath fill /Courier-Bold findfont 6 scalefont (%d) ] 10 -0.5 0.5 0 1 setlinewidth 0 setlinecap 1 setlinejoin 0.92 0.92 0.92 setrgbcolor AdjustColor stroke %d:%s (%s) ] 10 -0.5 0.5 0 ,@showpage restore Cmax length of %d steps exceededpostscript file truncatedMSC: %stoo many queues (%s)too many channel typesError: sending to an uninitialized chan STDINinvalid use of STDINError: receiving from an uninitialized chan %s type-clash in %s, (%s<-> %s)%s->Send send%3d: warning: missing params in send %3d: warning: too many params in send %3d: warning: missing params in next recv %3d: warning: too many params in next recv <-Recv [Recv] recvrv-sendSent %3d: warning: missing params in rv-send %3d: warning: too many params in rv-send cannot happen, s_snd_-[%d]Sen?!,[]q\p %3d %3d . %s%c(state -) [values: %d(state -) [%dline %3d %s %s] %s queue %d (%s) %d queue %d (%s(%d):%s[%d]): %s): invalid use of chan namejump into d_step sequence-error: (%s:%d) label %s placed incorrectly =====> stmnt unless Label: stmnt sorry, cannot jump to the guard of an escape (it is not a unique state) =====> instead of "Label: stmnt unless stmnt" =====> always use "Label: { stmnt unless stmnt }" "atomic { Label: statement ... }" "Label: atomic { statement ... }" "d_step { Label: statement ... }" "Label: d_step { statement ... }" "{ Label: statement ... }" "Label: { statement ... }" =====>instead of do (or if) :: ... :: Label: statement od (of fi) =====>always use Label: do (or if) :: statement od (or fi) cannot happen - labels non_local jump in d_step sequencesequence must have at least one statementFGPGGG(HHduplicate `else'cannot happen - if_seqdubious use of 'else' combined with i/o,(PP(PPPxPxP\PPunexpected unless structureprogressacceptendlabel %s redeclaredundefined label %scannot happen - mov_lab %sunknown label '%s'fix_dest error (%s):b%dmisplaced break statementd_stepatomicspin: warning, line %3d %s, atomic inside %s (ignored) spin: warning, line %3d %s, d_step inside d_step (ignored) atomic label %s %d <%s> %d:%sproc %d = %s 0: proc - (%s) creates proc %2d (%s) priority %d :never:spin: couldn't find claim (ignored) 0::never:------------- final state: ------------- #processes: %d %d processes created cannot happen - weightsSelect a statement choice %d: unexecutable, [ + Escape] [else] unexecutable, [else] Make Selection %d no executable choices Select [1-%d]: %d %s choice is outside range spin: error, cannot use 'enabled()' in models with synchronous channels. warning: never claim not used in random simulation warning: trace claim not used in random simulation <> [stmnt in d_step blocksterminates timeout rv-attempt in d_step sequencesaw preinitialized struct %ssetlocals: cannot happen '%s'missing actual parameters: '%s'array in parameter list, %stype-clash in params of %s(..), (%s<-> %s)spin: indexing %s[%d] - size is %d indexing array '%s'%3d: proc -%2d (%s) MSC: ~G line %d %3d: proc 0 (NEVER) line %d "never" (state 0) [printf('MSC: never\\n')] -line %3d %s (state %d)end not a labelname: '%s'remote ref to label '%s' inside d_stepunknown labelname: %smissing pid in %sspin: remote reference error on '%s[%d]' refers to wrong proctype '%s'_premote ref: %s[%d] %s not foundhave only: %d %s Select stmnt () choice 0: other process choice %d: unexecutable, choice %d: (else) Make Selection %d Select [0-%d]: %s choice outside range unexecutable Stmnt [] has escape(s): [] Escape taken assignmentprogressassertion violatedspin: text of failed assertion: assert(spin: bad node type %d (run) spin: trail file doesn't match spec? aborting`(XđD,ܓēԍX`,Hdxؒt@А`((\ %too few print args %s%c%d%o%u%xbad print cmd: '%s'printf string too longxxxxxxxxxx$xxxxx@xx\do_reach(void)#include "pan.t" dumpstate(-1, v, n, 0); Lstate = tmp; dumpstate(-1, v, n, tmp->tagged); tmp->tagged = (S_A)?V_A:(depth+1); v[1+ci] = 1 << bp; if (now._a_t&1) { unsigned ci, bp; /* as above */ { v[0] = V_A; tmp->D = depth; printf(" New state %%d\n", (int) nstates); printf(" Push state %%d\n", ((int) nstates) - 1); tmp->st_id = (unsigned) nstates; } } tmp = tmp->nxt;Append: tmp->nxt = grab_state(n); { /* append after tmp */ } else if (!tmp->nxt) tmp = ntmp; olst->nxt = ntmp; H_tab[j1] = ntmp; if (!olst) ntmp->nxt = tmp; ntmp = grab_state(n); { /* insert state before tmp */ } else if (m < 0) return 1; /* match outside stack */ nstates--; printf(" ReVisiting (from smaller depth)\n"); { tmp->D = depth; if (tmp->D > depth)#ifdef REACH dumpstate(0, (char *)&(tmp->state), n, 0); printf(" Old state %%d\n", (int) tmp->st_id); dumpstate(1, (char *)&(tmp->state), n, 0); return 2; /* match on stack */ dumpstate(0, (char *)&(tmp->state),n,tmp->tagged); printf(" Stack state %%d\n", (int) tmp->st_id); if ((S_A)?(tmp->tagged&V_A):tmp->tagged) return 0; dumpstate(1, (char *)&(tmp->state),n,tmp->tagged); printf(" New state %%d+\n", (int) tmp->st_id); return 3; (int) tmp->st_id); printf("1st dfs-stack intersected on state %%d+\n", && depth > A_depth) && (now._a_t&1) if ((tmp->tagged&A_V) tmp->tagged |= V_A; { Lstate = tmp; if (wasnew) /* else: wasnew == 0, i.e., old state */ } ((char *)&(tmp->state))[ci] |= bp; nShadow++; { wasnew = 1; { if (!wasnew) if ((((char *)&(tmp->state))[ci] & bp)==0) bp = 1 << bp; /* the bit mask */ ci++; /* skip over _a_t */ bp = 7 - bp; /* bp = 0..7 */ { ci = (NFAIR - 1) - ci; if (now._a_t&1) /* use tail-bits in _cnt */ bp = (now._cnt[now._a_t&1] - 8*ci); ci = (now._cnt[now._a_t&1] / 8); unsigned ci, bp; /* index, bit pos */ { /* 0 <= now._cnt[now._a_t&1] < MAXPROC */ if (S_A > NFAIR) } ((char *)&(tmp->state))[0] |= V_A; { wasnew = 1; nShadow++; { if ((((char *)&(tmp->state))[0] & V_A) != V_A) if (S_A) int wasnew = 0;#define wasnew 0 if (m == 0) { v + S_A, n - S_A); m = memcmp(((char *)&(tmp->state)) + S_A, { if (!tmp->nxt) goto Append; if (tmp->ln != 0) { /* skip the _a_t and the _cnt bytes */ { for (;; hcmp++, olst = tmp, tmp = tmp->nxt) H_tab[j1] = tmp; { tmp = grab_state(n); m = 0; v[m+1] = 0; /* _cnt[] */ for (m = 0; m < NFAIR; m++) { v[0] = 0; /* _a_t */ int n = compress(vin, nin); char *v = (char *) &comp_now; int n = nin; char *v = vin; struct H_el *ntmp, *olst = (struct H_el *) 0;{ register struct H_el *tmp; int m=0;hstore(char *vin, int nin, short xx) return 1; /* old state */ printf("old state\n"); return 2; /* on-stack */ printf("on-stack\n"); return 1; /* off-stack */ printf("old state\n"); if (dfa_member(MA-1)) { Info[MA-1] = 4; /* off-stack bit */ trpt->proviso = dfa_member(MA-1); { Info[MA-1] = 1; /* proviso bit */ if (pbit == 0) return 0; /* new state */ printf("new state\n"); return 3; printf("intersected 1st dfs stack\n"); if (!dfa_member(MA)) { Info[MA] &= ~(1|16|32); /* _a_t */ && depth > A_depth) && (now._a_t&1) { if (pbit == 0 if (!dfa_store(Info)) { Info[MA] = Info[0]; Info[0] = 0; } if (a_cycles) /* place _a_t at the end */ Info[MA-1] = pbit; Info[i] = 0; for ( ; i < MA-1; i++) Info[i] = ((uchar *)&comp_now)[i]; for (i = 0; i < n; i++) if (n > maxgs) maxgs = n; Uerror("aborting"); printf(" with -DMA=N with N>%%d\n", n); { printf("pan: error, MA too small, recompile pan.c"); if (n >= MA) static uchar Info[MA+1]; int i, j=0;{ int n = compress(vin, nin);gstore(char *vin, int nin, uchar pbit) for (i = 0; i < n; i++) printf("%%d,", v[i]); printf("\n Vector: "); printf(" State: ");#ifdef SDUMP printf(" %%d ", tag); V_A, wasnew, v[0]); { printf(" state tags %%d (%%d::%%d): ",dumpstate(int wasnew, char *v, int n, int tag)#if !defined(BITSTATE) || defined(FULLSTACK) emalloc((1<state)),v,n); for (tmp = S_Tab[j1]; tmp; Zn++, tmp = tmp->nxt) H_tab = tmp2; int n = compress((char *)&now, vsize); int n = vsize; char *v = (char *) &now; int m = 1; struct H_el **tmp2 = H_tab;{ register struct H_el *tmp;onstack_now(void) PUT++; trpt->ostate = Lstate; Uerror("cannot happen - unstack_put"); if (hstore((char *)&now, vsize, 3) != 0){ struct H_el **tmp = H_tab;onstack_put(void) Free_list = v; { w->nxt = v; if (!w->nxt) Free_list = v; { v->nxt = Free_list; last->nxt = v; { v->nxt = w->nxt; { if (w->tagged <= n) for (w = Free_list; w; Fa++, last=w, w = w->nxt) v->nxt = last = (struct H_el *) 0; v->proviso = 0;#if !defined(NOREDUCE) && !defined(SAFETY) v->tagged = n; S_Tab[j1] = v->nxt; last->nxt = v->nxt; if (last) ZAPS++;Found: return; Uerror("stack out of wack - zap");NotFound: goto Found; if (m == 0) { m = memcmp(&(v->state), nv, n); for (v = S_Tab[j1]; v; Zh++, last=v, v=v->nxt) H_tab = tmp; s_hash((uchar *)nv, n); n = H_tab = S_Tab; int n = vsize; char *nv = (char *) &now; int n = compress((char *)&now, vsize); char *nv = (char *) &comp_now; int m; struct H_el **tmp = H_tab;{ register struct H_el *v, *w, *last = 0;onstack_zap(void) n, v - (char *)&comp_now); printf("compress %%d -> %%d\n", for (i = 0; i < n; i++, vv++) int i; char *v = (char *) &comp_now; char *vv = vin; return delta; delta += HC; memcpy((char *) &comp_now + delta, (char *) &J4, HC);#if HC>0 delta += sizeof(long); memcpy((char *) &comp_now + delta, (char *) &J3, sizeof(long)); delta += NFAIR; /* _cnt[] */ if (S_A > NFAIR) { delta++; /* _a_t */ if (S_A) r_hash(vin, n); /* sets J3 and J4 */{ int delta = 0;compress(char *vin, int n) /* default compression */#if !defined(NOCOMP) return v - (char *)&comp_now; vsize, v - (char *)&comp_now); printf("collapse %%d -> %%d\n", *v++ = j; /* add last count as a byte */ if (n >= (1<<24)) { *v++ = (n>>24)&255; j++; } if (n >= (1<<16)) { *v++ = (n>>16)&255; j++; } if (n >= (1<< 8)) { *v++ = (n>> 8)&255; j++; } n = ordinal(scratch, x-scratch, 0); /* globals */ x -= j; j = 0; *x++ = 0; for (j = 0; j < WS-1; j++) x++; *x |= (nbytes[i] << j); j += 2; *(++x) = 0; { j = 0; { if (j == 6) for (i = 0, j = 6; i < nbytelen; i++) x--; x += col_q(i, x);#ifndef SEPQS if (!Mask[j++]) *x++ = *w; for (i = 0; i < n; i++, w++) j = w - (char *) &now; n = pptr(0) - (uchar *) w; n = qptr(0) - (uchar *) w; if (now._nr_qs > 0 && qptr(0) < pptr(0)) *x++ = now._nr_qs; *x++ = now._nr_pr; w = (char *) &(now._vsz) + sizeof(unsigned long); w = (char *) &(now._vsz) + sizeof(unsigned short);#if VECTORSZ<65536 w += NFAIR; w = (char *) &now + 3 * sizeof(uchar); /* 3 = _a_t, _nr_pr, _nr_qs */#ifdef NOVSZ { n = col_q(i, (char *) 0);#ifdef SEPQS nbytelen++; *v++ = (n>>24)&255; if (n >= (1<<24)) *v++ = (n>>16)&255; if (n >= (1<<16)) *v++ = (n>>8)&255; { nbytes[nbytelen]++; if (n >= (1<<8)) nbytes[nbytelen] = 0; *v++ = n&255; n = ordinal(scratch, x-scratch, 2); /* procs */ x += col_p(i, x); x = scratch; nbytelen++; *v++ = (n>>24)&255; if (n >= (1<<24)) *v++ = (n>>16)&255; if (n >= (1<<16)) *v++ = (n>>8)&255; { nbytes[nbytelen]++; if (n >= (1<<8)) *v++ = n&255; nbytes[nbytelen] = 0; { n = col_p(i, (char *) 0);#ifndef JOINPROCS nbytelen = 0; *v++ = now._cnt[i]; for (i = 0; i < NFAIR; i++) if (fairness) *v++ = now._a_t; long col_p(int, char *); long col_q(int, char *); static unsigned short nbytelen; static uchar nbytes[513]; /* 1 + 256 + 256 */ static char *x; unsigned long n; register int i, j;{ register char *w, *v = (char *) &comp_now;compress(char *vin, int nin) /* collapse compression */ return tmp->st_id; return tmp->tagged;done: tmp->ln = n; memcpy(((char *)&(tmp->state)), v, n); tmp->st_id = m; tmp->tagged = m; m = ++ncomps[tp]; goto Append; else if (!tmp->nxt) goto Insert; if (n < tmp->ln) continue; tmp = tmp->nxt;Append: tmp->nxt = grab_state(n); } else if (!tmp->nxt) tmp = ntmp; olst->nxt = ntmp; H_tab[j1] = ntmp; if (!olst) ntmp->nxt = tmp;Insert: ntmp = grab_state(n); if (m < 0) goto done; if (m == 0) if (n == tmp->ln) { m = memcmp(((char *)&(tmp->state)), v, n); for ( ;; olst = tmp, tmp = tmp->nxt) H_tab[j1] = tmp; { tmp = grab_state(n); if (!tmp) tmp = H_tab[j1]; s_hash((uchar *)v, n);{ struct H_el *tmp, *ntmp; long m;ordinal(char *v, long n, short tp) n = s_hash((uchar *)v, N); struct H_el *olst = (struct H_el *) 0;{ struct H_el *tmp, *ntmp; long n, m;ordinal(char *v, long N, short tp) /* store components */unsigned long emalloc(sizeof(struct H_el)+n-sizeof(unsigned));#define grab_state(n) (struct H_el *) \ emalloc(sizeof(struct H_el)+n-sizeof(unsigned)); return (struct H_el *) ngrabs++; Fh++; last=v; return v; v->ln = 0; v->nxt = 0; v->tagged = 0; Free_list = v->nxt; last->nxt = v->nxt; { if (last) { if (v->tagged == n) for (v = Free_list; v && v->tagged >= n; v=v->nxt) if (H_tab == S_Tab){ register struct H_el *v, *last = 0; grab_state(int n)struct H_el * emalloc((1<<(ssize-3))*sizeof(struct H_el *));{ S_Tab = (struct H_el **)onstack_init(void)struct H_el *Free_list = (struct H_el *) 0;#endif trpt->proviso = prov; trpt->ostate = sv; /* restore */ printf("%%d: cycle check returns\n", depth); A_depth = 0; depthfound = -1; now._a_t = o_a_t; new_state(); /* start 2nd DFS */ A_depth = depthfound = depth; memcpy((char *)&A_Root, (char *)&now, vsize); now._cnt[1] = now._cnt[0]; /* 1 = 2nd DFS; (16|32) to help hasher */ now._a_t |= (1|16|32); printf("%%d: cycle check starts\n", depth); printf("\n"); /* for (i = 0; i < n; i++) printf("%%d,", v[i]); */ now._cnt, now._nr_pr); if (fairness) printf("(cnt = %%d, nrpr=%%d) ", printf(" set Seed state "); { int i; uchar *v = (uchar *) &now; uchar prov = trpt->proviso; /* save */ struct H_el *sv = trpt->ostate; /* save */{ uchar o_a_t = now._a_t;checkcycles(void) { printf("pan: event_trace not completed\n"); if (!stopstate[EVENT_TRACE][now._event] && !a_cycles)#if defined(EVENT_TRACE) && !defined(OTIM) if (strict) return qs_empty(); if (!stopstate[ptr->_t][ptr->_p]) { ptr = (P0 *) pptr(i); for (i = BASE; i < (int) now._nr_pr; i++){ int i; P0 *ptr;endstate(void) return 0; { if (q_sz(i) > 0) for (i = 0; i < (int) now._nr_qs; i++){ int i; Q0 *qtr;qs_empty(void) Mask[k] = 0; /* reset */ for (k = vsize; k < o_vsize; k++) vsize -= q_skip[h]; memset((char *)qptr(h), 0, d); now._nr_qs = now._nr_qs - 1; vsize = q_offset[h]; memcpy(stack->body, (char *)qptr(h), d); stack->o_name = q_name[h]; stack->o_skip = q_skip[h]; stack->o_offset = q_offset[h]; int k, o_vsize = vsize; int d = vsize - q_offset[now._nr_qs - 1];{ int h = now._nr_qs - 1;delq(int sav) return 1; Mask[i] = 0; /* reset */ for (i = vsize; i < o_vsize; i++) vsize -= proc_skip[h]; memset((char *)pptr(h), 0, d); now._nr_pr = now._nr_pr - 1; vsize = proc_offset[h]; memcpy(stack->body, (char *)pptr(h), d); stack->o_delqs = i; stack->o_delta = d; stack->o_name = p_name[h]; stack->o_skip = proc_skip[h]; stack->o_offset = proc_offset[h]; stack = stack->nxt; smax++; stack->nxt->lst = stack; emalloc(Maxbody*sizeof(char)); stack->nxt->body = emalloc(sizeof(Stack)); { stack->nxt = (Stack *) { if (!stack->nxt) if (sav) d = vsize - proc_offset[h]; i++; { delq(sav); && q_offset[now._nr_qs-1] > proc_offset[h]) while (now._nr_qs if (h+1 != (int) now._nr_pr) return 0; { int d, i=0, o_vsize = vsize; delproc(int sav, int h) memcpy(stack->body, (char *)&now, sizeof(State)-VECTORSZ); /* save globals */ memcpy(stack->body, (char *)qptr(k), Maxbody); stack->o_boq = boq; memcpy(stack->body, (char *)pptr(h), Maxbody); stack = p_q_frame();p_q_save(int h, int K) return stack->nxt; smax++; stack->nxt->lst = stack; emalloc(Maxbody*sizeof(char)); stack->nxt->body = emalloc(sizeof(Stack)); { stack->nxt = (Stack *){ if (!stack->nxt)p_q_frame(void)Stack * memcpy((char *) pptr(h), stack->body, Maxbody); boq = stack->o_boq; memcpy((char *) qptr(k), stack->body, Maxbody); memcpy((char *)&now, stack->body, sizeof(State)-VECTORSZ); /* restore globals */ Uerror("error: p_q_restor"); if (!stack || !stack->lst || !stack->lst->lst){ int k = K-1;p_q_restor(int h, int K) Uerror("error: q_restor"); Mask[k] = 1; /* align */ for ( ; k < stack->o_offset; k++) if (q_zero(now._nr_qs)) k += stack->o_delta; k = stack->o_offset - stack->o_skip; now._nr_qs += 1; q_name[now._nr_qs] = stack->o_name; q_skip[now._nr_qs] = stack->o_skip; q_offset[now._nr_qs] = stack->o_offset;{ int k; char *z = (char *) &now; q_restor(void) q_restor(); while (i-- > 0) this = pptr(h); stack = stack->lst; Uerror("error: p_restor"); if (!stack->lst) /* debugging */ now._nr_pr += 1; i = stack->o_delqs; ((P0 *)pptr(h))->_pid = h; ((P0 *)pptr(h))->_pid = h-BASE; if (BASE > 0 && h > 0) Mask[proc_offset[h]] = 1; /* _pid */ Mask[vsize - i] = 1; /* pad */ for (i = 1; i <= Air[((P0 *)pptr(h))->_t]; i++) now._vsz = vsize;#ifndef NOVSZ vsize += stack->o_delta; memcpy(z+vsize, stack->body, stack->o_delta); vsize += stack->o_skip; Mask[i-1] = 1; /* align */ for (i = vsize + stack->o_skip; i > vsize; i--) p_name[h] = stack->o_name;#ifndef XUSAFE proc_skip[h] = stack->o_skip; proc_offset[h] = stack->o_offset;{ int i; char *z = (char *) &now; p_restor(int h) printf(" sv_restor\n"); svtack = svtack->lst; Uerror("error: v_restor"); if (!svtack->lst) Uerror("sv_restor"); if (vsize != svtack->o_delta) boq = svtack->o_boq; svtack->body, svtack->o_delta); vsize); &(((struct H_el *)(trpt-1)->ostate)->state), { memcpy((char *)&now, if (nonatom)#if defined(FULLSTACK) && defined(NOCOMP) && !defined(BITSTATE) && !defined(MA)sv_restor(int nonatom) /* pop state vector from save stack */ printf("%%d: sv_save\n", depth); memcpy((char *)(svtack->body), won, vsize); svtack->o_delta = vsize; /* don't compress */ svtack->o_boq = boq; svtack = svtack->nxt; { svtack->nxt->body = emalloc(vsize*sizeof(char)); } else if (vsize > svtack->nxt->m_delta) svmax++; svtack->nxt->m_delta = vsize; svtack->nxt->lst = svtack; svtack->nxt->body = emalloc(vsize*sizeof(char)); { svtack->nxt = (Svtack *) emalloc(sizeof(Svtack)); if (!svtack->nxt)sv_save(char *won) /* push state vector onto save stack */ close(fd); printf("pan: wrote %%s\n", fnm); wrapup(0); close(fd); { printf("pan: error writing %%s\n", fnm); if (write(fd, snap, j) != j) j = strlen(snap); i, trail[i].pr, trail[i].o_t->t_id); sprintf(snap, "%%d:%%d:%%d\n", if (trail[i].o_pm&128) continue; write(fd, "-1:-1:-1\n", 9); { if (i == depthfound+1) for (i = 1; i <= depth; i++) write(fd, snap, strlen(snap)); sprintf(snap, "-2:%%d:-2\n", VERI); { printf("cannot create %%s\n", fnm); if ((fd = creat(fnm, 0666)) <= 0) sprintf(fnm, "%%s.trail", Source); sprintf(fnm, "%%s%%d.trail", Source, Nr_Trails); if (iterative == 0 && Nr_Trails++ > 0) char snap[64], fnm[256];{ int fd, i, j;putrail(void) printf(", -endstate-"); else if (stopstate[M][i]) printf(", \"%%s\"", T->tp); if (strcmp(T->tp, "") != 0) printf(", state %%d", i); { printf(", \"%%s\"", mp[j].fnm); if (i >= mp[j].from && i <= mp[j].upto) for (j = 0; j < sizeof(mp); j++) if (verbose) { printf("\tline %%d", lno); if (T && T->tp) for (T = trans[M][i]; T; T = T->nxt){ Trans *T; int j;xrefsrc(int lno, S_F_MAP *mp, int M, int i) printf(" (%%d of %%d states)\n", N-1-m, N-1); m++; xrefsrc((int) src[i], mp, M, i); if (which[i] == 0 && trans[M][i]) for (i = 1; i < N; i++) printf("unreached in proctype %%s\n", procname[M]); if (M == VERI) return; /* no useful info there */{ int i, m=0; r_ck(uchar *which, int N, int M, short *src, S_F_MAP *mp) depthfound = -1; /* tripakis */ } else if (errors >= upto && upto != 0) maxdepth); printf("pan: reducing search depth to %%d\n", warned = 1; { maxdepth = (iterative == 1)?(depth-1):(depth/2); if (iterative != 0 && maxdepth > 0) wrapup(0); /* no recovery from unwind */ printf("sorry: MA writes 1 trail max\n"); { if (every_error) putrail(); depth = od; depthfound = Unwind(); { int od = depth; if (strstr(str, " cycle")) || errors == upto) if (every_error != 0 errors++; strcpy(laststr, str); (depthfound==-1)?depth:depthfound); printf("pan: %%s (at depth %%d)\n", str, if (strcmp(str, laststr)){ static char laststr[256]; uerror(char *str) return 0; return depth; if (memcmp((char *) &now, (char *) &comp_now, vsize) == 0)CameFromHere: now._a_t |= 2;Q999: now._cnt[now._a_t&1] = 1; if (now._cnt[now._a_t&1] == 0) if ((trpt->o_pm&32)) ((P0 *)this)->_p = tt; reached[ot][t->st] = 1; depth--; trpt--; trpt->tau, (trpt-1)->tau); printf("tau=%%d,%%d]\n", t->tp, now._a_t, A_depth); printf(" %%s [abit=%%d,adepth=%%d,", t->forw, tt, t->st); printf("reverses %%d, %%d to %%d,", printf("%%3d: proc %%d ", depth, II); m = do_reverse(t, II, trpt->o_m); tt = trpt->o_tt; this = pptr(II); ot = trpt->o_ot; II = trpt->pr; t = trpt->o_t; goto CameFromHere; /* checkcycles() */ A_depth = 0; if (fairness) now._a_t |= 2; /* ? */ { now._a_t &= ~(1|16|32); if ((now._a_t&1) && depth <= A_depth) now._event = trpt->o_event; now._last = (depth<1)?0:(trpt-1)->pr; } } } break; { now._last = (trpt-d)->pr - BASE; { if ((trpt-d)->pr != 0) for (d = 1; d < depth; d++) now._last = 0; { int d; goto Q999; { now._cnt[now._a_t&1] = trpt->oval; if (trpt->o_pm&128) /* fairness alg */ printf("\n"); ((char *)&now)[i], Mask[i]?"*":""); for (i = 0; i < vsize; i++) printf("%%d%%s,", printf("%%d State: ", depth); now._a_t = oat; memcpy((char *) &comp_now, (char *) &now, vsize); now._a_t &= ~(1|16|32); uchar oat = now._a_t;{ Trans *t; char ot, m; short tt; short II, i; Unwind(void)#if defined(MA) && !defined(SAFETY) uerror(str);{ /* always fatal */Uerror(char *str) memset(tmp, 0, n); left -= (long) n; have += (long) n; tmp = have; left = grow; fragment += (double) left; have = Malloc(grow); { grow = (n < CHUNK) ? CHUNK : n; if (left < n) n += sizeof(void *)-(n&(sizeof(void *)-1)); if (n&(sizeof(void *)-1)) /* for proper alignment */ return (char *) NULL; if (n == 0)emalloc(unsigned long long n) /* never released or reallocated */#define CHUNK (100*VECTORSZ) return tmp; memcnt += n; printf(" -DBITSTATE # supertrace, approximation\n"); printf(" -DHC # hash-compaction, approximation\n");#ifndef HC printf(" -DCOLLAPSE # good, fast compression, or\n"); printf(" -DBITSTATE # supertrace\n"); printf(" -DMA=%%d # better/slower compression, or\n", hmax); printf("hint: to reduce memory, recompile with\n"); memlim); printf(" %%g bytes limit (2^MEMCNT)\n", printf(" %%g bytes more needed\n", (double) n); printf(" %%g bytes used\n", memcnt); printf("pan: out of memory\n");err: if ((int) tmp == -1) tmp = (char *) sbrk(n); if (memcnt+ (double) n > memlim) goto err;{ char *tmp;Malloc(unsigned long long n)char * fprintf(fd, "(defaults to -w%%d)\n", ssize); fprintf(fd, " -wN hashtable of 2^N entries"); fprintf(fd, " -v verbose -- filenames in unreached state listing\n"); fprintf(fd, " -V print SPIN version number\n"); fprintf(fd, " -s 1-bit hashing (default is 2-bit)\n"); fprintf(fd, "[1..32] independent hash functions\n"); fprintf(fd, " -RN repeat run Nx with N "); fprintf(fd, " -q require empty chans in valid endstates\n"); fprintf(fd, " -pN create svfile (save N bytes per state)\n"); fprintf(fd, " -n no listing of unreached states\n"); fprintf(fd, " -mN max depth N steps (default=10k)\n"); fprintf(fd, "compilation with -DNP\n"); fprintf(fd, "disabled, requires "); fprintf(fd, " -l find non-progress cycles -> "); fprintf(fd, " -l find non-progress cycles\n"); fprintf(fd, " -J reverse eval order of nested unlesses\n"); fprintf(fd, " -I like -i, but approximate and faster\n"); fprintf(fd, " -i search for shortest path to error\n"); fprintf(fd, " -hN choose other hash-function 1..32\n"); fprintf(fd, " -f add weak fairness (to -a or -l)\n"); fprintf(fd, " -E ignore invalid endstates\n"); fprintf(fd, " -e create trails for all errors\n"); fprintf(fd, " -d print state tables and stop\n"); fprintf(fd, "(defaults to -c1)\n"); fprintf(fd, " -cN stop at Nth error "); fprintf(fd, " -A ignore assert() violations\n"); fprintf(fd, " -a,-l,-f -> are disabled by -DSAFETY\n"); fprintf(fd, " -a find acceptance cycles\n"); fprintf(fd, "(-DNP compiles for -l only)\n"); fprintf(fd, " -a -> is disabled by -DNP "); fprintf(fd, "Valid Options are:\n");usage(FILE *fd) wrapup(0); done = 1; run(); srand(123); vprefix = 0; { fprintf(stderr, "couldn't create %%s\n", nm); if ((svfd = creat(nm, 0666)) <= 0) sprintf(nm, "%%s.svd", Source); { char nm[64]; trail++; /* protect trpt-1 refs at depth 0 */ trail = (Trail *) emalloc((maxdepth+3)*sizeof(Trail)); mask = ((1< 32) if (Nrun > 1) HASH_NR = Nrun - 1; memlim *= (double) (1<<(MEMCNT-30)); memlim = (double) (1<<30); memlim = (double) (1<0 && !defined(NOREDUCE) if (maxdepth <= 0 || ssize <= 0) usage(efd); fprintf(efd, "error: cannot combine -DNOCOMP and -DCOLLAPSE\n");#if defined(NOCOMP) fprintf(efd, "error: cannot combine -DBITSTATE and -DCOLLAPSE\n"); exit(1); { fprintf(efd, "usage: -DMA=N with N > 0 and < VECTORSZ\n"); if (MA <= 0) fprintf(efd, "error: cannot combine -DMA and -DBITSTATE\n"); fprintf(efd, "error: cannot combine -DNP and -DSAFETY\n");#if defined(SAFETY) && defined(NP) fprintf(efd, "error: cannot combine -DHC and -DBITSTATE\n"); exit(1); fprintf(efd, "error: cannot combine -DHC and -DNOCOMP\n");#ifdef NOCOMP argc--; argv++; default : usage(efd); break; case 'X': efd = stdout; break; case 'w': ssize = atoi(&argv[1][2]); break; case 'v': verbose = 1; break; to_compile(); exit(0); break; case 'V': printf("Generated by %%s\n", Version); case 's': single = 1; break; case 'R': Nrun = atoi(&argv[1][2]); break; case 'q': strict = 1; break; case 'p': vprefix = atoi(&argv[1][2]); break; case 'n': no_rck = 1; break; case 'm': maxdepth = atoi(&argv[1][2]); break; case 'l': fprintf(efd, "error: -l disabled"); case 'l': a_cycles = 1; break; case 'J': like_java = 1; break; /* Klaus Havelund */ case 'i': iterative = 1; every_error = 1; break; case 'I': iterative = 2; every_error = 1; break; HASH_NR = atoi(&argv[1][2])%%33; break; case 'h': if (!argv[1][2]) usage(efd); else case 'f': fairness = 1; break;#if !defined(SAFETY) && !defined(NOFAIR) case 'E': noends = 1; break; case 'e': every_error = 1; break; case 'd': state_tables++; break; case 'c': upto = atoi(&argv[1][2]); break; case 'A': noasserts = 1; break; case 'a': a_cycles = 1; break; usage(efd); break; case 'a': fprintf(efd, "error: -a disabled"); { switch (argv[1][1]) { while (argc > 1 && argv[1][0] == '-') efd = stderr; /* default */{ void to_compile(void); main(int argc, char *argv[]) j1 = (n^(n>>(8*sizeof(long)-ssize)))&mask; /* h-table index */ J4 = n; /* more bits, when needed */ n ^= *r++; r = (long *) cp; /* use original data */ n = -1; /* forward hash for hash_table index */ J3 = n; /* the compressed state vector */ r = (long *) cp + h; long *r, h, n = -1;r_hash(uchar *cp, int om) /* reverse direction from s_hash */ return om; return om-1; /* perfect alignment */ j1 = (j1 & (~255)) | cp[om-1]; { /* use last data byte as first byte of hash */ if ((om&(sizeof(void *)-1)) == 1) /* very badly aligned */ j1 = (m^(m>>(8*sizeof(long)-ssize)))&mask; j1 = (m^(m>>(8*sizeof(long)-(ssize-3))))&((1<<(ssize-3))-1); if (S_Tab == H_tab) q = (long *) cp; long m = -1; long h; long *q;{ long z = (long) HASH_CONST[HASH_NR];s_hash(uchar *cp, int om) /* single forward hash */long#ifdef HYBRID_HASH j1 = 0; j4 = 1; j3 = (1<<(J1&7)); j2 = J1>>3; { J1 = J1^J2; /* use all bits */ } else /* single-bit address */ j4 = (1<<(J2&7)); j1 = J1>>3; { j3 = (1<<(J1&7)); j2 = J2>>3; j4 = (1<<(J2&7)); j2 = J2>>3; j3 = (1<<(J1&7)); j1 = J1>>3;#if 0 J2 = (n ^ (n>>(8*sizeof(long)-ssize)))&mask; J1 = (m ^ (m>>(8*sizeof(long)-ssize)))&mask; } while (--h > 0); n ^= *--r; n += n; n ^= z; { n += n; if (n < 0) m ^= *q++; m += m; m ^= z; { m += m; if (m < 0) do { r += (long) h; q = r = (long *) cp; m = n = -1; h = (om+sizeof(long)-1)/sizeof(long); om = v - (char *)&comp_now; v -= i; *v++ = 0; for (i = 0; i < WS-1; i++) if (!Mask[i]) *v++ = *vv; for (i = 0; i < Om; i++, vv++) register long i, om; register char *v = (char *) &comp_now; register char *vv = (char *) Cp; uchar *cp = (uchar *) &comp_now; long om = (long) Om; uchar *cp = Cp;#ifndef BCOMP register long m, n; register long *q, *r, h;{ register long z = (long) HASH_CONST[HASH_NR];d_hash(uchar *Cp, int Om) exit(0); if (vprefix > 0) close(svfd); dumpranges();#ifdef VAR_RANGES } } { if (peg[i]) putpeg(i, peg[i]); for (i = 1; i < NTRANS; i++) printf("\nPeg Counts (transitions executed):\n"); { int i; if (done && !no_rck) do_reach(); printf("]\n"); printf("%%d ", ncomps[i]); if (ncomps[i] != 0) { int i; for (i = 0; i < 256+2; i++) printf("collapse counts: [ "); printf("nr of templates: [ globals procs chans ]\n"); printf("%%-6.3f memory usage (Mbyte)\n\n", memcnt/1000000.); printf("%%-6.3f total actual memory usage\n\n", /* and memory lost in allocator (=fragment) */ /* remainder is mem used for proc and chan stacks */ nr2/1000000., maxdepth); printf("%%-6.3f memory used for DFS stack (-m%%d)\n", printf("%%-6.3f memory used for hash-table (-w%%d)\n", sizeof(struct H_el)-sizeof(unsigned)); printf(" + %%d byte overhead\n", (double) (sizeof(struct H_el) - sizeof(unsigned))); (tmp_nr)/(nstates-nShadow) - { printf(" State-vector as stored = %%.0f byte", printf("less than 1k)\n"); (100.0*tmp_nr)/nr1); printf("compression: %%.2f%%%%)\n", printf("unsuccessful "); { if (tmp_nr > nr1) if (tmp_nr > 0.) printf(" ("); tmp_nr/1000000.); printf("%%-6.3f actual memory usage for states", if (tmp_nr < 0.0) tmp_nr = 0.; tmp_nr = memcnt-nr3-nr4-(overhead+nr2-fragment); nr3/1000000., ssize); printf("%%-6.3f memory used for hash-array (-w%%d)\n", printf(" (stored*(State-vector + overhead))\n"); nr1/1000000.); printf("%%-6.3f equivalent memory usage for states", { printf("Stats on memory usage (in Megabytes):\n"); if (1) if (memcnt < nr1+nr2+nr3+nr4) overhead = overhead - nr2 + fragment; + (double) (smax * (sizeof(Stack) + Maxbody)); nr4 = (double) (svmax * (sizeof(Svtack) + hmax)) overhead += (double) (1<<(ssize-3))*sizeof(struct H_el *); nr3 += (double) (1<<(ssize-3)); nr3 = (double) (1<<(ssize-3)); nr3 = (double) (1<1000)\n"); printf("(best coverage if >100)\n"); printf("(expected coverage: >= 98%%%% on avg.)\n"); printf("(expected coverage: >= 99.9%%%% on avg.)\n"); printf("(low confidence estimate (1-bit hash), best if >1000)\n"); else if (a/b > 100.) { if (a/b > 1000.) printf("(low confidence estimate, best if >100)\n"); else printf("(medium confidence estimate)\n"); else if (a/b > 10.) printf("(good confidence estimate)\n"); { if (a/b > 100.) if (!single) printf("hash factor: %%g ", a/b); (100.*b)/(log(1. - b / a)/log(1. - 1. / a))); printf("coverage estimate: %%0.1f%%%%\n", b = nstates+1.; a = (double) (1<0) extern double log(double); #ifdef COVEST{ double a, b;wrap_stats(void) return x; a1, a2, a3); assert((x >= 0 && x < y), "- invalid array index",Boundcheck(int x, int y, int a1, int a2, Trans *a3)#ifndef NOBOUNDCHECK depth--; trpt--; uerror(bad); trpt->o_t = (trpt-1)->o_t; trpt->st = (trpt-1)->st; trpt->pr = (trpt-1)->pr; } else { trpt->o_t = t; trpt->pr = ii; if (t) { depth++; trpt++; sprintf(bad, "assertion violated %%s", s); if (strlen(s) > 999) s[999] = '\0'; { char bad[1024]; if (!a && !noasserts){assert(int a, char *s, int ii, int tt, Trans *t)} if (depth > 0) goto Up; gstore((char *) &now, vsize, 1); if (trpt->proviso) printf("%%d: zapping\n", depth); onstack_zap(); depth, trpt->ostate, printf("%%d: zapping %%u (%%d)\n", if (boq == -1) || ( (trpt-1)->tau&128))) && (((trpt->tau&4) && !(trpt->tau&128)) if (boq == -1#ifndef MA checkcycles(); checkcycles(); && (now._cnt[0] == 1)) if ((now._a_t&2) /* A-bit */ now._a_t, now._cnt[0]); printf("Consider check %%d %%d...\n", if (fairness) && !(now._a_t&1)) && ((now._nr_pr > 1) || (trpt->o_pm&2)) /* unless in a stuttered accept state */ /* with at least one running process */ && (trpt->tau&4) /* after backtracking a claim-step */ /* --after-- a program-step, i.e., */ if (n != 0 if (!(trpt->tau&8)) /* not in atomic seqs */Done: uerror("invalid endstate"); if (!noends && !a_cycles && !endstate()) goto Stutter; printf("%%d: claim stutter\n", depth); trpt->tau |= 128; /* stutter mark */ { trpt->tau |= 4; /* claim stuttering */ if (!(trpt->tau&4))#ifndef NOSTUTTERBreakOut: trpt->tau |= 1; printf("%%d: timeout\n", depth); (trpt-1)->tau |= 2; /* request */ depth); printf("%%d: req timeout\n",/* blocks inside an atomic */ goto BreakOut; && !((trpt-1)->tau&4)) if ((trpt->tau&8) { /* only claim can enable timeout */ } } goto Stutter; printf("%%d: timeout\n", depth); trpt->tau &= ~2; { trpt->tau |= 1; if (trpt->tau&2) /* requested */#ifndef NTIM if (trpt->tau&4) if (!(trpt->tau&1)) /* didn't try timeout yet */ goto AllOver; trpt->tau |= 4; /* switch to claim */ printf("unexecutable\n"); printf("%%3d: atomic step proc %%d ", depth, II); /* 1=timeout, 8=atomic */ { trpt->tau &= ~(1|8); if ((trpt->tau&8) && !(trpt->tau&4)) || depth >= maxdepth-1) goto Done; || endstate() if (now._nr_pr == 0 /* ok if no procs or we're at maxdepth */ if (boq != -1) goto Done; /* ok if a rendez-vous fails: */ depth, II, trpt->tau, boq); printf("%%3d: no move [II=%%d, tau=%%d, boq=%%d]\n", if (n == 0 || ((trpt->tau&4) && (trpt->tau&2))) if (II >=BASE) /* already decremented */ { From = now._nr_pr-1; To = BASE;#else /* no CPOR */ goto Again; else goto Resume; if (H_lvl <= H_str.high) n = 0; trpt->tau &= ~(16|32|64); From = now._nr_pr-1; To = BASE; II = To - 1; else } /* initalize a new level attempt */ H_lvl = H_lvl + 1; II = now._nr_pr-1; { { if (To <= BASE) } /* else accept reduction */ goto Again; /* do full search */ n = 0; trpt->tau &= ~(16|32|64); From = now._nr_pr-1; To = BASE; trpt->ostate->proviso = 1; (trpt-1)->ostate->proviso = 1; ((char *)&(trpt->ostate->state))[0] |= 128; ((char *)&((trpt-1)->ostate->state))[0] |= 128; if ((trpt-1)->ostate) trpt->proviso = 1; (trpt-1)->proviso = 1; printf("%%3d: setting proviso bit\n", depth); { if (!(now._a_t&1)) if (a_cycles && (trpt->tau&16)) if ((trpt->tau&32) && (n == 0 || (trpt->tau&16))) /* level, blocked or truncated at the next level */ /* at least one move that was preselected at this */ if (II >= BASE) /* II already decremented */ { From = now._nr_pr-1; To = BASE;#else /* CPOR */ else } goto Resume; Cls_begin = II; Cls_save = 1; if (H_lvl <= H_str.high) n = 0; trpt->tau &= ~(16|32|64); depth, II+1, n, trpt->tau); printf("%%3d: proc %%d UnSelected (n=%%d, tau=%%d)\n", II = To - 1; else } /* initalize a new level attempt */ H_lvl = H_lvl + 1; II = now._nr_pr-1; { { if (To <= BASE) if ((trpt->tau&32) && !(trpt->tau&64)) /* preselected move - no successors outside stack */ printf("%%3d: fairness undo Rule 3, _a_t=%%d\n", trpt->o_pm &= ~16; { now._a_t |= 2; if (trpt->o_pm&16) depth, now._a_t); printf("%%3d: fairness undo Rule 1, _a_t=%%d\n", trpt->o_pm &= ~8; now._cnt[now._a_t&1] = 0; { now._a_t &= ~2; if (trpt->o_pm&8)Q999: /* returns here with n>0 when done */; goto Down; printf("(all procs block)\n"); printf("%%3d: fairness default move ", depth); From = now._nr_pr-1; To = BASE; trpt->tau = 0; trpt->tau = 4; now._cnt[now._a_t&1] = 1; trpt->oval = now._cnt[now._a_t&1]; trpt->o_pm |= 128 | ((trpt-1)->o_pm&(2|4)); && now._cnt[now._a_t&1] > 0) /* needed more procs */ && !((trpt->tau&32) && (n == 0 || (trpt->tau&16))) /* see below */ && (trpt->tau&1) /* already tried timeout */#ifdef ETIM && ((trpt->tau&1) || endstate())#ifdef OTIM && !(trpt->tau&8) /* not an atomic one */ && !(trpt->tau&4) /* in program move */ && n == 0 /* nobody moved */ trpt->o_pm &= ~32; printf("%%3d: proc -- fairness ", depth); now._cnt[now._a_t&1] += 1; now._cnt[now._a_t&1] = 2; if (now._cnt[now._a_t&1] == 1) if (trpt->o_pm&32) /* remains if proc blocked */ /* Fairness: undo Rule 2 */ } /* all processes */ if (II == 0) break; /* never claim */ } } } II = From+1; trpt->o_pm &= ~64; { { if (n > 0) trpt->o_pm &= ~(32|64); printf("undo Rule 2, cnt=%%d, _a_t=%%d\n", now._cnt[now._a_t&1] += 1; now._cnt[now._a_t&1] = 2; if (now._cnt[now._a_t&1] == 1) { if (trpt->o_pm&1) && (trpt->o_pm&64)) if ((trpt->o_pm&32) /* Fairness: undo Rule 2 */ } /* all options */ ((P0 *)this)->_p = tt; if (m>n||(n>3&&m!=0)) n=m; else trpt->e_state = 0; /* undo */ if (m) reached[ot][t->st] = 1; /* i.e., not set if rv fails */ (trans[ot][tt])->om = m; /* head of list */ depth--; trpt--; && (trpt->tau&64)) && (trpt->tau&16)) if ((trpt->tau&8) /* rv or atomic */ /* pass the proviso tags */ trpt->tau, (trpt-1)->tau); printf("tau=%%d,%%d]\n", t->tp, now._a_t, A_depth); printf(" %%s [abit=%%d,adepth=%%d,", t->forw, tt, t->st); printf("reverses %%d, %%d to %%d,", printf("%%3d: proc %%d ", depth, II);R999: /* jumps here when done */ m = do_reverse(t, II, m); H_lvl = trpt->H_lvl; To = trpt->o_To; m = trpt->o_m; tt = trpt->o_tt; this = pptr(II); ot = trpt->o_ot; II = trpt->pr; t = trpt->o_t; n = trpt->o_n; return; /* to checkcycles() */ if ((now._a_t&1) && depth <= A_depth) now._event = trpt->o_event; now._last = (depth<1)?0:(trpt-1)->pr; } } } break; { now._last = (trpt-d)->pr - BASE; { if ((trpt-d)->pr != 0) for (d = 1; d < depth; d++) now._last = 0; { int d; goto Q999; printf("%%3d: reversed fairness default move\n", depth); depth--; trpt--; n = 1; trpt->o_pm &= ~128; { now._cnt[now._a_t&1] = trpt->oval; if (trpt->o_pm&128) /* fairness alg */ /* e.g., if first state is old, after a restart */ if (depth <= 0) return; (trpt->tau&4)?"claim":"program"); printf("%%d: Up - %%s\n", depth,Up: goto Down; /* pseudo-recursion */ { From = now._nr_pr-1; To = BASE; { From = To = II; nlinks++; if (boq == -1 && (t->atom&2)) trpt->tau &= ~8; trpt->tau |= 1; if (((trpt-1)->tau&1) && !(trpt->tau&4)) /* does the next program-step: */ /* if claim allowed timeout, so */ { if ((trpt-1)->tau&4) } else trpt->tau &= ~4; else trpt->tau |= 4; if((trpt-1)->tau&4) /* atomic sequence in claim */ { trpt->tau |= 8; if (boq != -1 || (t->atom&2)) trpt->H_lvl = H_lvl; trpt->tau = 0; trpt->o_To = To; trpt->o_m = m; trpt->o_ot = ot; trpt->o_tt = tt; trpt->o_t = t; trpt->o_n = n;#undef PQ { trpt->o_pm |= 4; { if (progstate[PQ->_t][PQ->_p])#if defined(HAS_NP) && PROG_LAB>0 } } break; { trpt->o_pm |= 2; { if (accpstate[PQ->_t][PQ->_p]) for (ii = 0; ii < (int) now._nr_pr; ii++) trpt->o_pm |= 2; if (((P0 *)pptr(0))->_p == 1) /* state 1 of np_ claim is accepting */#if ACCEPT_LAB>0#define PQ ((P0 *)pptr(ii)) { register int ii; if (a_cycles)/* moved down reached[ot][t->st] = 1; */ { ((P0 *)this)->_p = t->st; if (t->st > 0) trpt->o_pm &= ~(2|4); trpt->st = tt; trpt->pr = II; depth++; trpt++; trpt->e_state = t->e_trans; now._last = II - BASE; if (II != 0)#ifdef HAS_LAST (trpt->o_pm&2)?"":"non-", trpt->tau); printf(" %%saccepting [tau=%%d]\n", printf(" (escapes to state %%d)", t->st); if (t->e_trans) (boq != -1)?"rendez-vous":""); (t->atom&2)?"atomic":"", tt, t->st, t->tp, printf("%%d to %%d, %%s %%s %%s", depth, II, t->forw); printf("%%3d: proc %%d exec %%d, ", depth, II, t->t_id); printf("%%3d: proc %%d exec %%d \n", #if defined(SVDUMP)#if defined(VERBOSE) || defined(CHECK) peg[t->forw]++;#ifdef PEG trpt->o_pm |= 1; /* we moved */ trpt->tau |= 16; { if ((trpt->tau&32) && (trpt->o_pm&1)) /* the persistent set contains just 1 transition */ /* for branching-time, can accept reduction only if */#ifdef CTL if (boq == -1)P999: /* jumps here when move succeeds */ if (!(m = do_transit(t, II, n))) continue;#ifdef INLINE (trpt+1)->o_t = t; break; t->e_trans, trpt->e_state); printf("skip 2nd escape %%d (did %%d before)\n", && trpt->e_state != t->e_trans) if (trpt->e_state > 0 */ * a single escape state suffices /* exploring all transitions from for (t = trans[ot][tt]; t; t = t->nxt) (trpt+1)->pr = II; trpt->e_state = 0;#ifdef HAS_UNLESS /* check all trans of proc II - escapes first */ if (!provided(II, ot, tt, t)) continue;#ifdef HAS_PROVIDED trpt->o_pm |= (32|64); now._cnt[now._a_t&1], now._a_t); printf("Rule 2: --cnt to %%d (%%d)\n", printf("%%3d: proc %%d fairness ", depth, II); now._cnt[now._a_t&1] = 1; if (II == 1) /* claim need not participate */ { now._cnt[now._a_t&1] -= 1; && now._cnt[now._a_t&1] == II+2) && (now._a_t&2) && !(trpt->o_pm&32) if (fairness trpt->o_pm &= ~64; /* didn't apply rule 2 */ /* Fairness: Cnt++ when Cnt == II */ (trpt+1)->o_event = now._event; trpt->o_pm &= ~1; /* no move in this pid yet */ } } continue; /* did it before */ if (m>n||(n>3&&m!=0)) n=m; { m = t->om; || q_cond(II, t)) { if (t->qu[0] == 0 && From != To) && boq == -1 && (t->atom & 8) && !(trpt->tau&32) && !(trpt->tau&1) if (!(trpt->tau&4) t = trans[ot][tt]; /* could hit this if reduction proviso was false */ /* don't repeat a previous preselected expansion */Veri0: this = pptr(II); if (boq != -1 && trpt->pr == II) continue; /* no rendezvous with same proc */ } } } depth, now._a_t); printf("%%3d: fairness Rule 3: _a_t = %%d\n", trpt->o_pm |= 16; now._cnt[now._a_t&1] = 0; { now._a_t &= ~2; if (now._cnt[now._a_t&1] == 1) { /* A_bit = 0 when Cnt 0 */ } else depth, now._cnt[now._a_t&1], now._a_t); printf("%%3d: fairness Rule 1: cnt=%%d, _a_t=%%d\n", trpt->o_pm |= 8; now._cnt[now._a_t&1] = now._nr_pr + 1; now._a_t |= 2; { /* Accepting state */ if (a_cycles && (trpt->o_pm&2)) if (!(now._a_t&2)) { /* A_bit = 1; Cnt = N in acc states with A_bit 0 */ && !(trpt->tau&8)) && (!(trpt->tau&4) && !((trpt-1)->tau&128)) if (fairness && boq == -1 trpt->o_pm &= ~(8|16|32|64); /* fairness-marks */ /* The Main Expansion Loop over Processes */Again: trpt->tau &= ~32;#endif /* CPOR */ goto Again; depth, II, trpt->tau); printf("%%3d: proc %%d PreSelected (tau=%%d)\n", printf("Selected (om=%%d, tau=%%d)\n", printf("%%3d: proc %%d Pre", depth, II); trpt->tau |= 32; /* preselect marker */ t->om = 0; From = To = II; continue; if (trans[ot][tt]->atom & 8) for (II = From; II >= To; II -= 1)#else /* no-CPOR */ } else Cls_save = 0; } } goto Again; depth, II, trpt->tau); printf("%%3d: proc %%d PreSelected (tau=%%d)\n", t->om, trpt->tau); printf("Selected (om=%%d, tau=%%d)\n", printf("%%3d: proc %%d Pre", depth, II); trpt->tau |= 32; /* preselect marker */ t->om = 0;#ifdef NIBIS To = II; From = Cls_begin; { if(H_str.end[II] >= H_lvl ) Cholds++; } continue; Cls_save = 0; { if (!q_cond(II, t)) { Ccheck++; if (t->qu[0] != 0) { t = trans[ot][tt]; if (trans[ot][tt]->l_safe <= H_lvl) ot = (uchar) ((P0 *)this)->_t; tt = (short) ((P0 *)this)->_p; this = pptr(II); if (!Cls_save) continue; } /* II starts a cluster */ Cls_begin = II; { Cls_save = 1; if (H_str.begin[II] >= H_lvl)Resume: /* pick up here if preselect fails */ { for (II = From, Cls_begin = From, Cls_save = 1; II >= To; II -= 1) H_lvl = H_lvl + 1) /* for all levels */ H_lvl <= H_str.high; for (H_lvl = H_str.low;/* #endif */ )) trpt->ostate->proviso == 0) (trpt-1)->ostate->proviso == 0) (trpt-1)->ostate && !(((char *)&(trpt->ostate->state))[0] & 128)) !(((char *)&((trpt-1)->ostate->state))[0] & 128)) (trpt-1)->ostate && !(trpt->proviso)) !((trpt-1)->proviso))#ifndef BITSTATE || (a_cycles && && (!(now._a_t&1) if (boq == -1 && From != To/* implied: #ifdef FULLSTACK */ if (boq == -1 && From != To)#ifdef SAFETY /* (special rules apply in the 2nd dfs) */ /* Look for a process with only safe transitions */ goto Veri0; { II = 0; /* never */ if (trpt->tau&4) /* must make a claimmove */Stutter: uerror("endstate in claim reached"); if (stopstate[VERI][((P0 *)pptr(0))->_p]) uerror("claim violated!"); || ((P0 *)pptr(0))->_p == endclaim) if (now._nr_pr == 0 /* claim terminated */ (trpt+1)->o_n = 0; n = 0; trpt->tau &= ~(1|2); /* timeout and -request off */ if (trpt->tau&4) mreached = depth; if (depth > mreached) } } printf("%%d: putting\n", depth); (trpt->ostate)?trpt->ostate->tagged:0); trpt->ostate, printf("%%d: putting %%u (%%d)\n", depth, onstack_put();#if defined(FULLSTACK) || defined(CNTRSTACK) { SS[j2] |= j3; SS[j1] |= j4; } if (rand()%%100 <= RANDSTOR)#ifdef RANDSTOR w_xpoint(); { void w_xpoint(void); if ((unsigned long) nstates%%W_XPT == 0)#ifdef W_XPT snapshot(); if ((unsigned long) nstates%%1000000 == 0) wrapup(0); { fprintf(stderr, "writing %%s.svd failed\n", Source); if (write(svfd, (uchar *) &now, vprefix) != vprefix) { nstates++; if (!kk) { truncs++; if (II) (trpt-1)->tau |= 64; { /* has successor outside stack */ if (!II || !JJ) (trpt-1)->tau |= 16; truncs2++; { /* marker for liveness proviso */ if ((II && JJ) || (II == 3)) JJ = II; /* worstcase guess for p.o. */#ifndef NOREDUCE#if !defined(FULLSTACK) && !defined(CNTRSTACK) && defined(BITSTATE) } goto Up; nShadow--; depthfound = depth_of(Lstate); uerror("acceptance cycle"); uerror("non-progress cycle"); depthfound = Lstate->tagged - 1; } else II = 0; printf(" fairness count non-zero\n"); { if (fairness && now._cnt[1] != 0) if (II == 3 && a_cycles && (now._a_t&1)) j1 = oj1; now._a_t = o_a_t; } printf("state match on 1st dfs stack\n"); { II = 3; if (onstack_now()) now._a_t &= ~(1|16|32); uchar o_a_t = now._a_t; { int oj1 = j1; if (!JJ && (now._a_t&1) && depth > A_depth) kk = (II == 1 || II == 2); II = hstore((char *)&now, vsize, 2); JJ = II = gstore((char *) &now, vsize, 0);#ifndef FULLSTACK else printf("New bitstate\n"); if (II) printf("Old bitstate\n");#ifdef DEBUG kk = II = ((SS[j2]&j3) && (SS[j1]&j4)); d_hash((uchar *) &now, vsize);#ifndef CNTRSTACK JJ = (II == 2)?1:0; II = hstore((char *)&now, vsize, 1); II = gstore((char *)&now, vsize, 0); JJ = onstack_now();#ifdef FULLSTACK JJ = LL[j1] && LL[j2]; trpt->j6 = j1; trpt->j7 = j2; d_hash((uchar *)&now, vsize); { if (!(trpt->tau&8)) /* if no atomic move */ printf("not seed\n"); goto Up; uerror("acceptance cycle"); uerror("non-progress cycle");#ifdef NP printf("matches seed\n"); depthfound = A_depth; { (char *)&now, vsize)) { if (!memcmp((char *)&A_Root, if ((now._a_t&1) && depth > A_depth) */ * matched in hstore below * on the 1st dfs stack and would be * because the seed state also appears /* this check should now be redundant#ifndef SAFETY if (boq == -1) { /* if not mid-rv */ if ((trpt->tau&4) || ((trpt-1)->tau&128)) trpt->ostate = (struct H_el *) 0;#if defined(FULLSTACK) && !defined(MA)AllOver: goto Up; (trpt-1)->tau |= 16; /* worstcase guess */ printf("error: max search depth too small\n"); { warned = 1; if (!warned) (trpt+1)->o_n = 1; /* not a deadlock */#if SYNC { truncs++; if (depth >= maxdepth) trpt->proviso = 0;#if defined(FULLSTACK) && defined(MA) trpt->tau &= ~(16|32|64); /* make sure these are off */ (trpt->o_pm&2)?"":"non-", From, To); printf(" %%saccepting [pids %%d-%%d]\n", depth, (trpt->tau&4)?"claim":"program"); printf("%%d: Down - %%s",#ifdef CHECKDown:uchar Cls_begin = now._nr_pr-1;uchar Cls_save = 0;uchar H_lvl = H_str.low;#ifdef CPOR short From = now._nr_pr-1, To = BASE; short II, JJ=0, tt; char n, m, ot, kk;{ register Trans *t;new_state(void) */ * and study the resulting file, rather than this one * /lib/cpp -DNOREDUCE -DBITSTATE pan.c > Pan.c * from the pan.c source, e.g. by saying: * let the C preprocessor generate a specific version * of course. if you are studying the code, first * different search modes -- this makes it quite unreadable * it has a lot of code ifdef-ed together to support/* new_state() is the main search routine in the verifier fflush(stdout); printf("Memory= %%-6.3f\n", memcnt/1000000.); printf("Nodes= %%7d ", nr_states);#ifdef MA printf("Transitions= %%7g ", nstates+truncs);{ printf("Depth= %%7d States= %%7g ", mreached, nstates);snapshot(void) return res; this = othis; TstOnly = 0; break; { res = 1; if (do_transit(t, pid, 0)) for (t = trans[ot][tt]; t; t = t->nxt) ot = (uchar) ((P0 *)this)->_t; tt = (short) ((P0 *)this)->_p; TstOnly = 1; this = pptr(pid); return 0; if (pid < 0 || pid >= (int) now._nr_pr) Uerror("used: enabled(pid=thisproc)"); if (pid == iam) if (pid > 0) pid++; int res = 0; short tt; char ot;{ Trans *t; uchar *othis = this;enabled(int iam, int pid) trpt--; depth--; uerror("event_trace error (no matching event)"); depth++; trpt++; now._event = start_event; /* only 1st try will count */ tp, qid, now._event, t->forw); printf(" event_trace miss '%%c' -- %%d, %%d, %%d\n", else return; } uerror("non-determinism in event-trace"); { if (do_transit(t, EVENT_TRACE, 0)) for (t = t->nxt; t; t = t->nxt) (trpt+1)->o_pm |= 4; if (progstate[EVENT_TRACE][now._event]) (trpt+1)->o_pm |= 2; if (accpstate[EVENT_TRACE][now._event]) printf(" event_trace move to -> %%d\n", t->st); reached[EVENT_TRACE][t->st] = 1; { now._event = t->st; { if (do_transit(t, EVENT_TRACE, 0)) for (t = trans[EVENT_TRACE][now._event]; t; t = t->nxt) if (now._event != endevent) } else return; now._event = start_event; trpt--; depth--; trpt->o_pm |= 4; if (progstate[EVENT_TRACE][now._event]) trpt->o_pm |= 2; if (accpstate[EVENT_TRACE][now._event]) uerror("event_trace error (all events matched)"); { depth++; trpt++; if (now._event == endevent)#ifdef NEGATED_TRACE _tp = tp; _qid = qid;{ Trans *t;require(char tp, int qid)#undef continueP999: return m;#include "pan.m"#define continue return 0{ char m;do_transit(Trans *t, short II, int n)static char _tp = 'n'; static int _qid = 0;#ifndef INLINER999: return m;#include "pan.b" short tt = (short) ((P0 *)this)->_p;{ char m = M;do_reverse(Trans *t, short II, char M)char#ifdef INLINE_REV new_state(); /* start 1st DFS */ depth, now._cnt[now._a_t&1], now._a_t); printf("%%3d: fairness Rule 1, cnt=%%d, _a_t=%%d\n",#ifdef VERBOSE now._cnt[0] = now._nr_pr + 1; { now._a_t = 2; /* set the A-bit */ && (a_cycles && (trpt->o_pm&2))) if (fairness Mask[i++] = 1; /* _cnt[] */ while (j++ < NFAIR) i = &(now._cnt[0]) - (uchar *) &now; { int j = 0; if (!fairness)#ifndef NOFAIR Mask[i] = 1; /* _a_t */ { i = &(now._a_t) - (uchar *) &now; if (!a_cycles) Mask[0] = Mask[1] = 1; /* _nr_pr, _nr_qs */#ifndef NOCOMP { trpt->o_pm |= 4; if (progstate[EVENT_TRACE][now._event]) { trpt->o_pm |= 2; if (accpstate[EVENT_TRACE][now._event]) { trpt->o_pm |= 4; && progstate[ptr->_t][ptr->_p]) if (!(trpt->o_pm&4) } { trpt->o_pm |= 2; && accpstate[ptr->_t][ptr->_p]) if (!(trpt->o_pm&2)#ifndef NP { P0 *ptr = (P0 *) pptr(i); for (i = 0; i < (int) now._nr_pr; i++) trpt->tau |= 4; /* the claim moves first */ trpt = &trail[depth]; depth=mreached=0;{ int i;do_the_search(void) return depthfound; printf("pan: cannot happen, depth_of\n"); return d; if (s == t->ostate) { t = &trail[d]; for (d = 0; d <= A_depth; d++){ Trail *t; int d;depth_of(struct H_el *s)int#define depth_of(x) A_depth /* an estimate */#if !defined(FULLSTACK) || defined(MA)#if !defined(SAFETY) && !defined(BITSTATE) va_end(args); vprintf(fmt, args); va_start(args, fmt); va_list args;#ifdef PRINTF */ * and this code is not generated * compile SPIN itself -DPRINTF * If this fails on your system * unless explicitly wanted * during verification runs * but don't generate the output * could contain a run stmnt) * are always evaluated (e.g., they{ /* Make sure the args to PrintfPrintf(const char *fmt, ...)void#include } goto go_again; PUT=PROBE=ZAPS=Ccheck=Cholds = 0; Fa=Fh=Zh=Zn = 0; nlost=nShadow=hcmp = 0; nstates=nlinks=truncs=truncs2=ngrabs = 0; (1<<(ssize-3))*sizeof(struct H_el *)); memset((uchar *) S_Tab, 0, #if defined(FULLSTACK) memset(LL, 0, 1<<(ssize-3));#if defined(CNTRSTACK) memset(SS, 0, 1<<(ssize-3)); printf("\n"); wrap_stats(); { printf("Run %%d:\n", HASH_NR); if (--Nrun > 0 && HASH_CONST[++HASH_NR])#if defined(BITSTATE) do_the_search();go_again: reached[EVENT_TRACE][start_event] = 1; now._event = start_event;#ifdef EVENT_TRACE active_procs(); /* started after never */ Addproc(VERI); /* never - pid = 0 */#ifdef VERI write(svfd, (uchar *) &vprefix, sizeof(int)); if (vprefix > 0)#ifdef SVDUMP noptr = (uchar *) emalloc(Maxbody * sizeof(char)); /* a place to point for Pptr of non-running procs: */ svtack = (Svtack *) emalloc(sizeof(Svtack)); stack = ( Stack *) emalloc(sizeof(Stack)); LL = (uchar *) emalloc(1<<(ssize-3));#ifdef CNTRSTACK onstack_init();#if defined(FULLSTACK) && defined(BITSTATE) hinit();#else SS = (uchar *) emalloc(1<<(ssize-3));#ifdef BITSTATE overhead = memcnt;#ifdef MEMCNT UnBlock; /* disable rendez-vous */#endif } printf("formulae are stutter-closed)\n"); printf("(never claims generated from LTL "); printf("the never claim must be stutter-closed\n"); { printf("warning: for p.o. reduction to be valid "); if (!state_tables)#if defined(VERI) && !defined(NOREDUCE) && !defined(NP) unsigned short _event; uchar _event;#if nstates_event<256 uchar _last; /* pid executed in last step */ unsigned long _vsz; unsigned short _vsz; uchar _cnt[NFAIR]; /* counters, weak fairness */ uchar _a_t; /* cycle detection */ uchar _nr_qs; uchar _nr_pr;typedef struct State {short boq = -1; /* blocked_on_queue status */int vprefix=0, svfd; /* runtime option -pN */long vsize; /* vector size in bytes */int q_offset[MAXQ], q_skip[MAXQ];int proc_offset[MAXPROC], proc_skip[MAXPROC];int depthfound = -1; /* loop detection */struct H_el *Lstate;Trans ***trans; /* 1 ptr per state per proctype */ } Trans; struct Trans *nxt; int back; /* index return transition */ int forw; /* index forward transition */ int t_id; /* transition id, unique within proc */ char *tp; /* src txt of statement */ short om; /* completion status of preselects */ uchar ty[6]; /* ditto: type's */ short qu[6]; /* for conditional selections: qid's */ short tpe[2]; /* class of operation (for reduction) */ short e_trans; /* if set, this is an escp-trans */ short escp[HAS_UNLESS]; /* lists the escape states */ short st; /* the nextstate */ short l_safe; /* safe for level l_safe */ short atom; /* if &2 = atomic trans; if &8 local */typedef struct Trans {} Svtack; struct Svtack *lst; struct Svtack *nxt; short m_delta; /* maximum size of frame */ short o_delta; /* current size of frame */ int m_delta;typedef struct Svtack { /* for complete state vector */} Stack; struct Stack *lst; struct Stack *nxt; char *body; char *o_name; short o_boq; short o_delqs; short o_skip; short o_offset; short o_delta; int o_delqs; int o_skip; int o_offset; int o_delta;#if VECTORSZ>32000typedef struct Stack { /* for queues and processes */#define VECTORSZ 1024 /* sv size in bytes */#ifndef VECTORSZ#define WS sizeof(long) /* word size in bytes */#define MAXPROC 255#define MAXQ 255#define q_sz(x) (((Q0 *)qptr(x))->Qlen) #define Pptr(x) ((proc_offset[x])?pptr(x):noptr)#define pptr(x) (((uchar *)&now)+proc_offset[x])#define qptr(x) (((uchar *)&now)+q_offset[x])unsigned long ncomps[256+2];#define HC 3#ifdef HC3#define HC 2#ifdef HC2#define HC 1#ifdef HC1#define HC 0#ifdef HC0#define HC2#define COLLAPSE/* accept the above for backward compatibility */#if defined(COLLAPSE2) || defined(COLLAPSE3) || defined(COLLAPSE4)#define MEMCNT 28#define MEMCNT 25 /* 32 Mb */#ifdef PC#ifndef MEMCNT#define NOCOMP#define CNTRSTACK#define FULLSTACK#if !defined(SAFETY) && !defined(MA)#define XUSAFE#ifdef NOREDUCE#define NOFAIR#define DEBUG#define CHECK#define BASE 0#define BASE 1 case 0: j = sizeof(P0); break; switch (n) { Uerror("too many processes"); if (h >= MAXPROC)#define Index(x, y) Boundcheck(x, y, 0, 0, 0)#undef Index/* redefine Index only within this procedure */ if (TstOnly) return (h < MAXPROC); uchar *o_this = this; { int k, j, h = now._nr_pr;) ((P0 *)this)->_pid = h; ((P0 *)this)->_pid = h-BASE; memset((char *)pptr(h), 0, j); printf(" with -DVECTORSZ=N with N>%%d\n", vsize); { printf("pan: error, VECTORSZ too small, recompile pan.c"); if (vsize >= VECTORSZ) hmax = max(hmax, vsize); Mask[vsize-j] = 1; /* _pid */ Mask[vsize - k] = 1; /* pad */ for (k = 1; k <= Air[n]; k++) vsize += j; NFAIR+1); printf("\trecompile with -DNFAIR=%%d\n", (8*NFAIR)/2 - 2, NFAIR); printf(" max is %%d procs (-DNFAIR=%%d)\n", { printf("Error: too many processes -- current"); if (fairness && ((int) now._nr_pr + 1 >= (8*NFAIR)/2)) write(svfd, (uchar *) &now, vprefix-4*sizeof(int)); /* padd */ write(svfd, (uchar *) &proc_offset[h], sizeof(int)); write(svfd, (uchar *) &n, sizeof(int)); write(svfd, (uchar *) &h, sizeof(int)); write(svfd, (uchar *) &dummy, sizeof(int)); /* mark */ { int dummy = 0; proc_offset[h] = vsize; vsize += proc_skip[h]; Mask[k-1] = 1; /* align */ for (k = vsize + proc_skip[h]; k > vsize; k--) proc_skip[h] = 0; proc_skip[h] = WS-(vsize%%WS); if (vsize%%WS) default: Uerror("bad proc - addproc"); Uerror("too many queues"); if (i >= MAXQ){ int j=0, i = now._nr_qs, k; addqueue(int n, int is_rv) return i+1; ((Q0 *)qptr(i))->_t = n; memset((char *)qptr(i), 0, j); Uerror("VECTORSZ is too small, edit pan.h"); q_offset[i] = vsize; vsize += q_skip[i]; for (k += q_skip[i]; k > vsize; k--) k = vsize; if (is_rv) k += j; q_skip[i] = 0; q_skip[i] = WS-(vsize%%WS); default: Uerror("bad queue - addqueue"); switch (((Q0 *)qptr(into))->_t) { j = ((Q0 *)qptr(into))->Qlen; z = qptr(into); Uerror("qsend bad queue#"); if (into >= (int) now._nr_qs || into < 0) uerror("ref to uninitialized chan name (sending)"); if (!into--){ int j, k; uchar *z; switch(((Q0 *)qptr(from))->_t) { uerror("ref to uninitialized chan name (q_zero)");{ if (!from--)q_zero(int from) require('s', into); if (in_s_scope(into+1)) default: Uerror("bad queue - qsend"); case 0: printf("queue %%d was deleted\n", into+1); uerror("ref to uninitialized chan name (qfull)");q_full(int from) return ((Q0 *)qptr(x))->Qlen; uerror("ref to uninitialized chan name (len)");{ if (!x--)q_len(int x) printf("and by %%s (proc %%d)\n", p_name[q_recver[x]-1], q_recver[x]-1); printf("pan: by %%s (proc %%d) ", printf("access to chan %%s (%%d)\n", { printf("pan: xr assertion violated: "); if (q_recver[x] != who+1) uerror("xr chans cannot be used for rv"); printf("recv proc %%s (%%d)\n", { q_recver[x] = who+1;{ if (!q_recver[x])q_R_check(int x, int who)short q_recver[MAXQ+1]; uerror("error, partial order reduction invalid"); p_name[who], who); p_name[q_sender[x]-1], q_sender[x]-1, printf("%%s (proc %%d) and by %%s (proc %%d)\n", q_name[x], x-1); printf("access to chan <%%s> (%%d)\npan: by ", { printf("pan: xs assertion violated: "); if (q_sender[x] != who+1) uerror("xs chans cannot be used for rv"); p_name[who], who); printf("sndr proc %%s (%%d)\n", q_name[x], x-1); { printf("chan %%s (%%d), ", if (q_zero(x)) { q_sender[x] = who+1;{ if (!q_sender[x])q_S_check(int x, int who)short q_sender[MAXQ+1]; if (m&1) q_R_check(x, y); if (m&2) q_S_check(x, y); q_name[x] = s; p_name[y] = p; q_claim[x] |= m; Uerror("cannot happen setq_claim"); if (x < 0 || x > MAXQ) uerror("x[rs] claim on uninitialized channel");{ if (x == 0)setq_claim(int x, int m, char *s, int y, char *p) uerror("error to poll rendezvous channel"); printf("channel always returns FALSE\n"); { printf("==>> a test of the contents of a rv ");{ if (q_zero(from))not_RV(int from) Uerror("bad queue q-zero"); case 0: printf("queue %%d was deleted\n", from+1); switch (((Q0 *)qptr(from))->_t) { require('r', from); if (done && (in_r_scope(from+1))) z = qptr(from); Uerror("qrecv bad queue#"); if (from >= (int) now._nr_qs || from < 0) uerror("ref to uninitialized chan name (receiving)"); if (!from--) int j, k, r=0; { uchar *z;qrecv(int from, int slot, int fld, int done) Uerror("bad queue - q_full"); switch (ptr->_t) { Q0 *ptr = (Q0 *) qptr(i); char *x, *y;{ int j, k;col_q(int i, char *z) return r; default: Uerror("bad queue - qrecv"); sethierarchy(); settable(); vsize = sizeof(State) - VECTORSZ; memset((char *)&now, 0, sizeof(State));run(void) stopstate[%d][endstate%d] = 1; visstate[%d] = (uchar *) emalloc(nstates%d); stopstate[%d] = (uchar *) emalloc(nstates%d); progstate[%d] = (uchar *) emalloc(nstates%d); accpstate[%d] = (uchar *) emalloc(nstates%d); reached[%d] = reached%d; Maxbody = max(Maxbody, sizeof(P%d)); retrans(%d, nstates%d, start%d, src_ln%d, reached%d); exit(0); printf("p=progress; e=end; a=accept;\n"); printf("Source-State Labels: "); printf("A=atomic; D=d_step; L=local; G=global\n"); { printf("\nTransition Type: "); if (state_tables)#define ACCEPT_LAB %d /* user-defined accept labels */#define ACCEPT_LAB 1 /* at least 1 in np_ */#define PROG_LAB %d /* progress labels */uchar *visstate[%d];uchar *stopstate[%d];uchar *reached[%d];uchar *progstate[%d];uchar *accpstate[%d]; Maxbody = max(Maxbody, sizeof(Q%d)); r_ck(reached%d, nstates%d, %d, src_ln%d, src_file%d); case %d: j = sizeof(P%d); break; P0 *ptr = (P0 *) pptr(i);{ int j, k; unsigned long ordinal(char *, long, short);col_p(int i, char *z)long col_q(int i, char *z) { return 0; }long col_p(int i, char *z) { return 0; }/* just to allow compilation, to generate the error */#if defined(BITSTATE) && defined(COLLAPSE)#define Index(x, y) Boundcheck(x, y, II, tt, t) return h-BASE; this = o_this; return ordinal(scratch, x-scratch, 2+ptr->_t); x -= j; if (z) return (long) (x - z); if (!Mask[k++]) *x++ = *y; for ( ; j > 0; j--, y++) y = (char *) ptr; k = proc_offset[i]; if (z) x = z; else x = scratch; default: Uerror("bad proctype - collapse"); return ordinal(scratch, x-scratch, 1); /* chan */ j -= (q_max[ptr->_t] - ptr->Qlen) * (j - 2)/q_max[ptr->_t]; /* no need to store the empty slots at the end */ y = (char *) ptr; k = q_offset[i]; default: Uerror("bad qtype - collapse"); struct { uchar _t; /* q_type */ uchar Qlen; /* q_size */typedef struct Q%d {} Q0; uchar Qlen, _t;typedef struct Q0 { /* generic q */#endif } TH_str; uchar end[MAXPROC]; uchar begin[MAXPROC]; uchar high; uchar low;typedef struct TH_str { #ifdef CPOR case %d: r = ((Q%d *)z)->contents[slot].fld%d; break; ((Q0 *)z)->Qlen = --j; j = ((Q0 *)z)->Qlen; uerror("ref to uninitialized chan (unsend)");{ int m=0, j, k; uchar *z; unsend(int into)int if (strt) ((Q0 *)z)->Qlen = j+1; uerror("ref to uninitialized chan (unrecv)");{ int j; uchar *z; unrecv(int from, int slot, int fld, int fldvar, int strt) return m; default: Uerror("bad queue - unsend");char *p_name[MAXPROC+1];char *q_name[MAXQ+1];uchar q_claim[MAXQ+1];int q_R_check(int, int);int q_S_check(int, int);void onstack_zap(void);void onstack_put(void);void onstack_init(void);int onstack_now(void);void xrefsrc(int, S_F_MAP *, int, int);void wrap_stats(void);void usage(FILE *);void unrecv(int, int, int, int, int);void uerror(char *);void tagtable(int, int, int, short *, uchar *);void sv_save(char *);void sv_restor(int);void setq_claim(int, int, char *, int, char *);void sethierarchy(void);void settable(void);void retrans(int, int, int, short *, uchar *);void q_restor(void);void putrail(void);void putpeg(int, int);void p_q_save(int, int);void p_q_restor(int, int);void p_restor(int);void new_state(void);void imed(Trans *, int, int);void hinit(void);void exit(int);void do_reach(void);void delq(int);void d_hash(uchar *, int);void crack(int, int, Trans *, short *);void checkcycles(void);void assert(int, char *, int, int, Trans *);void Uerror(char *);void *sbrk(int);int unsend(int);int qrecv(int, int, int, int);int q_zero(int);int q_len(int);int q_full(int);int q_cond(short, Trans *);int gstore(char *, int, uchar);int hstore(char *, int, short);int endstate(void);int delproc(int, int);int write(int, void *, unsigned);int creat(char *, unsigned short);int close(int);/* int atoi(char *); */int addqueue(int, int);/* int abort(void); */int Boundcheck(int, int, int, int, Trans *);char *Malloc(unsigned long long);char *emalloc(unsigned long long);/** function prototypes **/ printf(" -lm\n");#if defined(COVEST) && defined(BITSTATE) printf("Compiled as: cc -o pan %%span.c", ctd); strcat(ctd, "-DCOVEST "); strcat(ctd, "-DSDUMP "); strcat(ctd, "-DVERBOSE "); { sprintf(carg, "-DVECTORSZ=%%d ", VECTORSZ); if (VECTORSZ != 1024)#ifdef VECTORSZ strcat(ctd, "-DSVDUMP "); strcat(ctd, "-DCOLLAPSE "); strcat(ctd, "-DOTIM "); strcat(ctd, "-DPRINTF "); strcat(ctd, "-DREACH "); strcat(ctd, "-DNOSTUTTER ");#ifdef NOSTUTTER strcat(ctd, "-DNOBOUNDCHECK ");#ifdef NOBOUNDCHECK strcat(ctd, "-DNIBIS "); strcat(ctd, "-DCTL "); strcat(ctd, "-DCHECK "); strcat(ctd, "-DHC3 "); strcat(ctd, "-DHC2 "); strcat(ctd, "-DHC1 "); strcat(ctd, "-DHC0 "); strcat(ctd, "-DVAR_RANGES "); strcat(ctd, "-DPEG "); strcat(ctd, "-DNP "); strcat(ctd, "-DXUSAFE ");#ifdef XUSAFE strcat(ctd, "-DNOREDUCE "); { sprintf(carg, "-DNFAIR=%%d ", NFAIR); if (NFAIR != 2)#ifdef NFAIR strcat(ctd, "-DNOFAIR ");#ifdef NOFAIR strcat(ctd, "-DSAFETY "); strcat(ctd, "-DNOCLAIM "); strcat(ctd, carg); { sprintf(carg, "-DMEMCNT=%%d ", MEMCNT); if (MEMCNT != n) n = 28; n = 25; strcat(ctd, "-DNOVSZ "); strcat(ctd, "-DPC "); strcpy(ctd, ""); strcpy(ctd, "-DBITSTATE ");{ char ctd[1024], carg[64]; int n;to_compile(void) "%s", #define SYNC %d #define ASYNC %d short Air[] = { ,%s (short) Air%d, (short) Air%d }; char *procname[] = { ":np_:", }; np_ uchar sv[VECTORSZ]; } State; int addproc(int n, int par%d int provided(int II, int ot, int tt, Trans *t) { switch(ot) { default: return 1; /* e.g., a claim */ } return 0; } iniglobals(); } void iniglobals(void) { #ifdef VAR_RANGES logval(" Maxbody = max(Maxbody, sizeof(State)-VECTORSZ); } accpstateacceptprogstateprogressstopstateend %s[%d][%d] = 1; %s-state label in d_step seq%s - ignored visstate[%d][%d] = 1; spin: warning, line %3d %s, proctype %s:global '%s %s' could be declared 'bit %s' '%s %s' could be declared 'byte %s' %s%s:", ((P%d *)pptr(h))->); ((P%d *)pptr(h))->; = :never:error: %s defines local %s ", now.now.cannot hide non-globals (%s)cannot hide channels (%s)/* hidden variable: */int _; /* a predefined write-only variable */ %s%s%s%s%s%s%s %s%s%s[%d]%s%s%s[%d]addqueue(%d, %d)%dtypedef struct P%d { /* %s */ unsigned _pid : 8; /* 0..255 */ unsigned _t : %d; /* proctype */ unsigned _p : %d; /* state */ } P%d; #define Air%d 0 #define Air%d (sizeof(P%d) - [0]Offsetof(P%d, %s%s) - %d*sizeof(uchar)short)int)cannot happen Air %s) #define _NP_ %d uchar reached%d[3]; /* np_ */ short nstates%d = 3; /* np_ */ #define endstate%d 2 /* np_ */ #define start%d 0 /* np_ */ case %d: /* np_ */ ((P%d *)pptr(h))->_t = %d; ((P%d *)pptr(h))->_p = 0; reached%d[0] = 1; accpstate[%d][1] = 1; break; #define start%d %d #define start_claim %d #define start_event %d case %d: /* %s */ ((P%d *)pptr(h))->_p = %d; reached%d[%d]=1; case %d: /* %s */ if () return 1; /* params: */ array in parameter list, %s ((P%d *)pptr(h))->hidden array in parameter, %s = par%d; /* locals: */ unsigned %s : %d unsigned %s : 1spin: warning: bit-array %s[%d] mapped to byte-array uchar %s short %s int %sundeclared structure element %s struct %s %svariable %s undeclared[%d]short q_flds[%d]; short q_max[%d]; case %d: j = sizeof(Q%d); q_flds[%d] = %d; q_max[%d] = %d; break; unsigned fld%d : 1; uchar fld%d; short fld%d; int fld%d; bad channel spec } contents[%d]; } Q%d; int Q_has(int into, int want%d, int fld%d{ int i; if (!into--) uerror("ref to unknown chan (recv-poll)"); if (into >= now._nr_qs || into < 0) Uerror("qrecv bad queue#"); for (i = 0; i < ((Q0 *)qptr(into))->Qlen; i++) { if (want%d && qrecv(into+1, i, %d, 0) != fld%d) continue; return i+1; } return 0; void qsend(int into, int sorted, int fld%d((Q%d *)z)-> /* =rv= */ case %d:%s (trpt+2)->o_m = 0; if (!sorted) goto append%d; for (j = 0; j < %sQlen; j++) { /* find insertion point */ ((Q%d *)z)->contents[j].fld if (fld%d > %s%d) continue; if (fld%d < %s%d) goto found%d; } found%d: for (k = %sQlen - 1; k >= j; k--) { /* shift up */ %scontents[k+1].fld%d = %scontents[k].fld%d; append%d: /* insert in slot j */ (trpt+1)->oval = j; %sQlen = %sQlen + 1; %s%d = fld%d; case %d: return %d; case %d: return (q_sz(from) == %d); case %d:%s if (fld == 0) r = %scontents[slot].fld0; switch (fld) { default: Uerror("too many fields in recv"); if (done) { j = %sQlen; %sQlen = --j; for (k=slot; kcontents %s[k].fld%d = %s[k+1].fld%d; } %s[j].fld%d = 0; if (fld+1 != %d) uerror("missing pars in receive"); case %d: j = sizeof(Q%d); break; void qsend(int, int, int#define Addproc(x) addproc(x, 0void wrapup(int);void iniglobals(void);void find_shorter(int);void do_the_search(void);void cleanup(void);void active_procs(void);#endif #define UnBlock /* don't bother */#define IfNotBlocked /* cannot block */#define UnBlock boq = -1#define IfNotBlocked if (boq != -1) continue;#if SYNCuchar noasserts = 0, noends = 0;uchar warned = 0, iterative = 0, like_java = 0, every_error = 0;long A_depth = 0, depth = 0;long J1, J2, J3, J4, j1, j2, j3, j4;Svtack *svtack; /* for old state vectors */Stack *stack; /* for queues, processes */char *scratch = (char *) &comp_tmp;State comp_tmp;uchar *Mask = (uchar *) &comp_msk;State comp_msk;State comp_now; /* compressed state vector */#if !defined(NOCOMP) || defined(BITSTATE)unsigned int maxgs = 0;extern int dfa_store(unsigned char *);extern int dfa_member(unsigned short);extern void dfa_init(unsigned short);#define INLINE_REVvoid dumpranges(void);void logval(char *, int);#ifdef VAR_RANGESState now; /* the full state vector */State A_Root; /* root of acceptance cycles */uchar *noptr; /* used by macro Pptr(x) */int Maxbody=0;int hmax=0, svmax=0, smax=0;int ssize=18;int ssize=22;#ifdef BITSTATEint TstOnly=0;#ifndef INLINEint state_tables=0, fairness=0, no_rck=0, Nr_Trails=0;int mask, a_cycles=0, upto=1, strict=0, verbose = 0;long Ccheck=0, Cholds=0;long PUT=0, PROBE=0, ZAPS=0;long Fa=0, Fh=0, Zh=0, Zn=0;unsigned long nr_states=0; /* nodes in DFA */double nlost=0, nShadow=0, hcmp=0, ngrabs=0;double nstates=0, nlinks=0, truncs=0, truncs2=0;int mreached=0, done=0, errors=0, Nrun=1, single=0;}; 0 0x273d1aa5, 0x8923b1dd, 0x5276db35, 0x0c565ef7, 0xaf203ed1, 0xe31f5909, 0x2e805a6d, 0x33fc3a55, 0x9c4e956f, 0xb5cf2c71, 0x9e8f5f21, 0xd5f8d8e7, 0x6cb25933, 0x86cdd651, 0xdbebd459, 0x828ae611, 0x2ead1fb7, 0x8e428171, 0xacd7c069, 0xb4c44bb3, 0xb91c8bc5, 0x8e5880f3, 0xa5247fd9, 0xbae92a15, 0x98b2e49d, 0xb616d379, 0x38e84cd7, 0x02b148e9, 0x0fc22f87, 0x3ff0c3ff, 0x04c11db7, 0x100d4e63, 0x88888EEF, 0x00400007, /* asuming 4 bytes per int */unsigned int HASH_CONST[] = {static unsigned long grow;static double fragment = (double) 0;static long left = 0L;static char *have;/* for emalloc: */double memlim = (double) (1<<30);double overhead = (double) 0;double memcnt = (double) 0;#ifdef MEMCNTTH_str H_str;uchar HASH_NR = 0;uchar *SS, *LL;long maxdepth=10000;uchar *this;Trail *trail, *trpt;FILE *efd;} Trail; int oval; Trans *o_t; long j6, j7; struct H_el *ostate; /* pointer to stored state */#if defined(FULLSTACK) && !defined(MA) short e_state; /* if escape trans - state of origin */#ifdef HAS_UNLESS short o_tt, o_To; unsigned short o_event; uchar o_event;#if nstates_event<256#ifdef EVENT_TRACE char o_n, o_ot, o_m; /* to save locals */int H_lvl;#ifdef CPOR uchar proviso;#if defined(FULLSTACK) && defined(MA) o_pm&128 -> a fairness, dummy move - all procs blocked o_pm&64 -> the current proc applied rule2 o_pm&32 -> fairness alg rule 2 undo mark o_pm&16 -> fairness alg rule 3 undo mark o_pm&8 -> fairness alg rule 1 undo mark o_pm&4 -> this is a progress state o_pm&2 -> this is an acceptance state o_pm&1 -> the current pid moved -- implements else tau&128 -> current transition is a stutter move tau&64 -> at least one next state is not on the stack tau&32 -> current transition is a preselected move tau&16 -> last move was truncated on stack tau&8 -> current transition is an atomic move tau&4 -> current transition is a claim move tau&2 -> request to enable timeout 1 level up (in claim) tau&1 -> timeout enabled Meaning of bit-flags:#if 0 uchar o_pm; /* a few more bit-flags */ uchar tau; /* 8 different bit-flags */ uchar pr; /* process id */ short st; /* current state */typedef struct Trail {} **H_tab, **S_Tab; unsigned state; unsigned D;#ifdef REACH unsigned long ln; unsigned short ln;#if VECTORSZ<65536#ifdef COLLAPSE unsigned long st_id;#if defined(CHECK) || (defined(COLLAPSE) && !defined(FULLSTACK)) unsigned proviso;#if defined(BITSTATE) && !defined(NOREDUCE) && !defined(SAFETY) unsigned tagged;#ifdef FULLSTACK struct H_el *nxt;struct H_el { } (S_A)? (trpt->ostate->tagged&~V_A) : 0; \ trpt->ostate->tagged = \ if (trpt->ostate) \#define onstack_zap() { \#define onstack_put() trpt->ostate = Lstate#if defined(FULLSTACK) && !defined(BITSTATE)#define onstack_zap() gstore((char *) &now, vsize, 4)#define onstack_put() ;#ifdef MA#define S_A 0#define A_V 0#define V_A 0#elseint S_A = 0;#define A_V (((now._a_t&1)?1:2) << (now._a_t&2))#define V_A (((now._a_t&1)?2:1) << (now._a_t&2))#if !defined(SAFETY) && !defined(NOCOMP)#define onstack_zap() LL[trpt->j6]--; LL[trpt->j7]--#define onstack_put() LL[trpt->j6]++; LL[trpt->j7]++#define onstack_now() (LL[trpt->j6] && LL[trpt->j7])#ifdef CNTRSTACK#endif#define max(a,b) (((a)<(b)) ? (b) : (a))#ifndef max#include "pan.h" #define Offsetof(X, Y) ((unsigned long long)(&(((X *)0)->Y)))#include #include #include #include printf("\n"); dumpval(tmp->vals, BYTESIZE); { printf("\t%%s\t: ", tmp->nm); printf("interval [0..255]:\n"); printf("\nValues assigned within ");dumpranges(void) printf("-255"); if (j >= 0 && j != 255) goto from; printf("-%%d, ", i-1); else printf(", "); { if (i-1 == j)upto: if (!(X[w] & (1<vals[(v)/8] |= 1<<((v)%%8);found: tmp->nm = s; ranges = tmp; tmp->nxt = ranges; tmp = (Vr_Ptr *) emalloc(sizeof(Vr_Ptr)); goto found; if (!strcmp(tmp->nm, s)) for (tmp = ranges; tmp; tmp = tmp->nxt) if (v<0 || v > 255) return;{ Vr_Ptr *tmp;logval(char *s, int v)Vr_Ptr *ranges = (Vr_Ptr *) 0;} Vr_Ptr; struct Vr_Ptr *nxt; unsigned char vals[BYTESIZE]; char *nm;typedef struct Vr_Ptr {#define BYTESIZE 32 /* 2^8 : 2^3 = 256:8 = 32 */ fflush(stdout); printf("]"); z->qu[i], z->ty[i]); printf("(%%d,%%d)", if (z->qu[i]) for (i = 0; i < 6; i++) { printf("\t["); if (z->qu[0]) printf("\n"); putchar(z->tp[i]); printf("\\n"); if (z->tp[i] == '\n') for (i = 0; z->tp[i]; i++) srcln[j]); z->l_safe, z->atom & 8 ?"L":"G", progstate[n][j]?"p" : "-", stopstate[n][j]?"e" : "-", accpstate[n][j]?"a" :"-", z->atom&6?"A":z->atom&32?"D":"-", printf(" [%%s%%s%%s%%s%%s%%d] line %%d => ", printf("]"); printf(" esc %%d", z->escp[i]); { if (!z->escp[i]) break; else if (state_tables >= 2) printf(" org %%3d", z->e_trans); if (z->e_trans) if (z->tpe[1]) printf(",%%d", z->tpe[1]); printf("[id %%3d tp %%3d", z->t_id, z->tpe[0]); j, z->forw, z->st); printf(" state %%3d -(tr %%3d)-> state %%3d ", if (!z) return;{ int i; crack(int n, int j, Trans *z, short srcln[]) tagtable(n, m, j, srcln, reach); if (!j) break; { j = trans[n][is]->escp[i]; for (i = 0; i < HAS_UNLESS; i++) tagtable(n, m, z->st, srcln, reach); { int i, j; crack(n, is, z, srcln); for (z = trans[n][is]; z; z = z->nxt) reach[is] = 0; || is <= 0 || reach[is] == 0) if (is >= m || !trans[n][is]{ Trans *z; tagtable(int n, int m, int is, short srcln[], uchar reach[]) stopstate[n][T->st] |= stopstate[n][v]; accpstate[n][T->st] |= accpstate[n][v];{ progstate[n][T->st] |= progstate[n][v];imed(Trans *T, int v, int n) /* set intermediate state */ } } exit(1); printf(" 'else' stmnts\n"); printf(" %%d, inherits %%d", i, nrelse); procname[n]); { printf("error: proctype '%%s' state", if (nrelse > 1) nrelse++; { if (strcmp(T0->tp, "else") == 0) nrelse = 0; exit(1); printf("conditional self-loop\n"); srcln[i], i); printf("line %%d, state %%d: has un", procname[n]); { printf("error: proctype '%%s' ", && strcmp(T0->tp, "(1)") == 0) { if (T0->st == i if (strcmp(procname[n], ":never:") != 0) { int nrelse; } else tagtable(n, m, is, srcln, reach); reach[i] = 1; printf("%%s\n", procname[n]); else printf("init\n"); if (!strcmp(procname[n], ":init:")) { printf("proctype "); if (state_tables) } } T1->tp, T0->tp); printf(" '%%s' <-> '%%s'\n", (j==5*DELTA)?"condi":"selec"); T0->tpe[aa], j, printf("[%%d-%%d] mixed %%stion ", if (T0->tpe[aa] && T0->tpe[aa] != j) for (aa = 0; aa < 2; aa++) for (T0 = T1; T0; T0 = T0->nxt) } goto degrade; l_degr = H_str.high; printf("(defeats reduction)\n"); printf("mixed condition "); printf("warning: line %%d ", srcln[i]); { { if (j == 5*DELTA) if (T1->nxt && T1->atom&8) if (T1->qu[0]) continue; T1 = trans[n][i]; j = T1->tpe[0]; /* and not mixed with other local operations */ /* can only mix 'r's or 's's if on same chan */ T1->l_safe = l_degr; for (T1 = trans[n][i]; T1; T1 = T1->nxt) /* degrade for CPOR */ T1->atom &= ~8;degrade: for (T1 = trans[n][i]; T1; T1 = T1->nxt) if (T1) l_degr = max(T1->l_safe, l_degr); for (T1 = trans[n][i]; T1; T1 = T1->nxt) if (!(T1->atom&8)) break; for (T1 = trans[n][i]; T1; T1 = T1->nxt) /* mark all options global if >=1 is global */ goto degrade; printf(" in selection\n"); g); printf("too many types (%%d)", printf("line %%d, ", srcln[i]);#if 1 { T1->qu[0] = 0; /* turn it off */ if (g > 6) } } } g++; T1->ty[g%%6] = j; { T1->qu[g%%6] = k; if (h >= 6) break; && T1->ty[h] == j) if (T1->qu[h] == k for (h = 0; h < 6; h++) { k = srunc(T0->tpe[aa], j); if (j != LOCAL) { j = srinc_set(T0->tpe[aa]); for (aa = 0; aa < 2; aa++) if (k) /* non-uniform selection */ g = 0; } } k = 1; != T1->tpe[0]) && T0->tpe[aa] if (T0->tpe[aa] } goto degrade; l_degr = H_str.high; { >= GLOBAL) { if (srinc_set(T0->tpe[aa]) for (aa = 0; aa < 2; aa++) goto degrade; l_degr = max(T4->l_safe, l_degr); for (T4 = T1; T4; T4 = T4->nxt) l_degr = H_str.low; /* find degradation level = highest safety level */ Trans *T4; { if (!(T0->atom&8)) { k = 0; if (T1->nxt) /* check if mixing of guards preserves reduction */ if (!T1) continue; T1 = trans[n][i]; if (accpstate[n][T1->st]) { if (accpstate[n][i] || visstate[n][i]) } goto degrade; l_degr = H_str.high; { if (progstate[n][T1->st]) for (T1 = trans[n][i]; T1; T1 = T1->nxt) } goto degrade; l_degr = H_str.high; { if (progstate[n][i])#if PROG_LAB>0 && defined(HAS_NP) { /* moves through these states are visible */ if (a_cycles) { } trans[n][i] = T4; { T3->nxt = trans[n][i]; if (T4) T3 = T2; else T4 = T2; if (T3) T3->nxt = T2; T2->nxt = (Trans *) 0; T4 = T3 = (Trans *) 0; { Trans *T4; } else /* outermost unless checked first */ } } trans[n][i] = T2; T2->nxt = trans[n][i]; T2->e_trans = p; { T2 = cpytr(T1); for (T1 = trans[n][p]; T1; T1 = T1->nxt) { if (p = T0->escp[k]) for (k = HAS_UNLESS-1; k >= 0; k--) { for (T0 = trans[n][i]; T0; T0 = T0->nxt) if (!like_java) /* the default */ */ * list of state i * and prepend them to the transition- * if so, copy and mark p's transitions * escape to some state p is defined /* check for each state i if an { if (!trans[n][i]) continue; { printf("STEP 3 proctype %%s\n", if (state_tables >= 2) } } } imed(T0, T1->st, n); reach[T1->st] = 1; T0 = T0->nxt; T0->nxt = cpytr(trans[n][T1->st]); if (!trans[n][T1->st]) continue; T1->st, T1->forw, i); { for (T1 = T1->nxt; T1; T1 = T1->nxt) imed(T0, T1->st, n); reach[T1->st] = 1; trans[n][i] = T0; T0 = cpytr(trans[n][T1->st]); if (!trans[n][T1->st]) continue; T1->st, T1->forw, i); printf("\t\tpull %%d (%%d) to %%d\n", { T1 = trans[n][i]->nxt; { if (trans[n][i] && trans[n][i]->nxt) /* optimize */ for (i = 1; i < m; i++) { printf("STEP 2 proctype %%s\n", if (state_tables >= 3) } while (cnt); } cnt++; } while (T3->nxt); T2->nxt = cpytr(T3); do { T3 = T3->nxt; } continue; imed(T2, T0->st, n); T2 = T2->nxt; { T2->nxt = cpytr(T0); if (!T3->nxt) { T3 = trans[n][T0->st]; for (T0 = T1; T0; T0 = T0->nxt) if (T0) i, T0->st); printf("\tstate %%d / %%d: choice in choice\n", if (T0) } break; && trans[n][T0->st]->nxt)/* choice in choice */ { if (T0->st && trans[n][T0->st]/* prescan: */ for (T0 = T1; T0; T0 = T0->nxt) T1 = T2?T2->nxt:(Trans *)0; { T2 = trans[n][i]; for (i = 1, cnt = 0; i < m; i++) do { return; crack(n, i, T0, srcln); for (T0 = trans[n][i]; T0; T0 = T0->nxt) for (i = 1; i < m; i++) procname[n]); { printf("STEP 1 proctype %%s\n", if (state_tables >= 4) int l_degr=H_str.low; /* degradation level */ int i, j, k, p, h, g, aa;{ Trans *T0, *T1, *T2, *T3; /* process n, with m states, is=initial state */retrans(int n, int m, int is, short srcln[], uchar reach[])voidint cnt; return 0; Uerror("cannot happen srunc"); case TIMEOUT_F: return 257; /* non-zero, and > MAXQ */ case ALPHA_F: case Q_FULL_T: return n-2-3*DELTA; case Q_EMPT_T: return n-2-2*DELTA; case Q_EMPT_F: return n-2-DELTA; case Q_FULL_F: return n-2;{ switch(m) {srunc(int n, int m)} return BAD; Uerror("cannot happen srinc_class"); if (n == 7*DELTA) return ALPHA_F; if (n == 6*DELTA) return TIMEOUT_F; if (n == 5*DELTA) return GLOBAL; if (n <= 2+4*DELTA) return Q_FULL_T; /* full */ if (n <= 2+3*DELTA) return Q_EMPT_T; /* empty */ if (n <= 2+2*DELTA) return Q_EMPT_F; /* 'r' or nempty */ if (n <= 2+ DELTA) return Q_FULL_F; /* 's' or nfull */{ if (n <= 2) return LOCAL;srinc_set(int n)int#ifndef NOREDUCE tmp->back = a->back; tmp->forw = a->forw; tmp->t_id = a->t_id; strcpy(tmp->tp, a->tp); tmp->tp = (char *) emalloc(strlen(a->tp)+1); tmp->ty[i] = a->ty[i]; { tmp->qu[i] = a->qu[i]; for (i = 0; i < 6; i++) tmp->tpe[1] = a->tpe[1]; tmp->tpe[0] = a->tpe[0]; tmp->escp[i] = a->escp[i]; for (i = 0; i < HAS_UNLESS; i++) tmp->e_trans = a->e_trans; tmp->st = a->st; tmp->l_safe = a->l_safe; /* transition safe for level l_safe */ tmp->atom = a->atom; int i;cpytr(Trans *a)} return tmp; tmp->back = d; tmp->forw = c; tmp->t_id = t_id; tmp->tp = t; tmp->tpe[1] = tpe1; tmp->tpe[0] = tpe0; tmp->st = b; tmp->l_safe = l_safe; /* transition safe for level l_safe */ if (!g) tmp->atom |= 8; /* no global references */ tmp->atom = a&(6|32); /* only (2|8|32) have meaning */{ Trans *tmp = (Trans *) emalloc(sizeof(Trans)); int g, int tpe0, int tpe1) int l_safe, char *t,settr( int t_id, int a, int b, int c, int d,Trans *bad: Uerror("cannot happen delete"); layers[nr] = x; t->left = t->right = t->lnk = (Vertex *) 0; x->right = t->right; { x = splay(i, t->left); { x = t->right; if (!t->left) /* delete the node itself */ layers[nr] = y; t->left = t->right = t->lnk = (Vertex *) 0; y->right = t->right; y->left = t->left; { y = z->lnk; } else if (z->lnk) /* z == t == v */ return; layers[nr] = t; z->lnk = (Vertex *) 0; { y->lnk = z->lnk; if (y) if (z != v) goto bad; ; for (z = t; z && z != v; y = z, z = z->lnk) { Vertex *z, *y = (Vertex *) 0; if (!t) return; i = cheap_key(v);{ Vertex *x, *t;delete_it(Vertex *v, int L) return z; if (checkit(z, v, n, sigma)) for (z = t; z; z = z->lnk) if (i == t->key) layers[nr] = t = splay(i, t); if (!t) return (Vertex *) 0; i = mk_special(sigma,n,v);{ Vertex *z, *t;find_it(Vertex *v, Vertex *n, uchar sigma, int L)no_match: if (h->Succ || h->dst[0] || h->dst[1]) return 1; { g = cacheDelta(v, f->S, 1); if (f->s && f->S != sigma) i = g->To; continue; if (g->s == 1 && i == g->S) goto no_match; if (f->Dst != g->Dst) g = cacheDelta(v, i, j); j = 0; { if (i == sigma) continue; for (i = f->From; i <= f->To; i++) { if (f->Dst != n) goto no_match; { if (INRANGE(f,sigma)) for (f = h->Succ; f; f = f->Nxt) i = g->To; if (g->s == 0 || g->S != i) goto no_match; if (h->dst[k] != g->Dst) g = cacheDelta(v, i, j); j = 0; { if (i == sigma) continue; for (i = h->from[k]; i <= h->to[k]; i++) { if (h->dst[k] != n) goto no_match; { if (sigma >= h->from[k] && sigma <= h->to[k]) if (h->dst[k]) for (k = 0; k < 2; k++) int i, k, j = 1;{ Edge *g, *f;checkit(Vertex *h, Vertex *v, Vertex *n, uchar sigma)static int layers[nr] = new; new = t; t->lnk = v; { v->lnk = t->lnk; /* put in linked list off v */ } else /* it's already there */ t->right = (Vertex *) 0; new->left = t; new->right = t->right; } else if (i > t->key) t->left = (Vertex *) 0; new->right = t; new->left = t->left; { new = v; if (i < t->key) t = splay(i, t); { layers[nr] = v; if (!t) v->key = i; t = layers[nr]; nr = ((L*TWIDTH)+Tally); i = mk_key(v); ulong i; int nr;{ Vertex *new, *t;insert_it(Vertex *v, int L) return t; t->right = N.left; t->left = N.right; r->left = t->right; l->right = t->left; t = t->right; l = t; l->right = t; if (!t->right) break; y->left = t; t->right = y->left; { y = t->right; if (i > t->right->key) { if (!t->right) break; } else if (i > t->key) t = t->left; r = t; r->left = t; if (!t->left) break; t = y; y->right = t; t->left = y->right; { y = t->left; if (i < t->left->key) { if (!t->left) break; { if (i < t->key) for (;;) l = r = &N; N.left = N.right = (Vertex *) 0; if (!t) return t;{ Vertex N, *l, *r, *y;splay(ulong i, Vertex *t) recyc_vertex(path[j]); delete_it(path[j], j); { numDelta(path[j], -1); if (path[j]->num == 0) for (j = iv+1; j < dfa_depth; j++) old->num++; insert_it(s, iv); setDelta(s, word[iv], old); delete_it(s, iv); y->num--; y = Delta(s, word[iv]); if (!k) nv = j; { s = path[j]; k = 1; path[j]->num--; /* only 1 moved from j to y */ s = y; y->num = 1; /* initial value 1 */ insert_it(s, j-1); setDelta(s, word[j-1], y); delete_it(s, j-1); numDelta(y, 1); insert_it(y, j); copyEdges(y, path[j]); { y = new_vertex(); if (path[j]->num > 1) for (j = 1; j <= iv; ++j) nv = k = 0; s = path[0];phase3: } while (new && iv > 0); new = find_it(path[iv], old, word[iv], iv); old = new; do { iv--; iv = dfa_depth;phase2: if (*p == F) return 1; /* it's already there */ *q++ = Delta(*p++, *w++); /* (*p)->delta[*w++]; */ for (i = pfrst; i < dfa_depth; i++) p = &path[pfrst]; q = (p+1); w = &word[pfrst];phase1: if (pfrst > nv) pfrst = nv; if (pfrst > iv) pfrst = iv; memcpy(&lastword[pfrst], &sv[pfrst], dfa_depth-pfrst); pfrst = (int) (u - lastword) - 1; ; while (*w++ == *u++) /* find first byte that differs */ w = word = sv; int i, j, k; uchar *w, *u = lastword;{ Vertex **p, **q, *s, *y, *old, *new = F;dfa_store(uchar *sv) return (*p == F); *q++ = Delta(*p++, *w++); for (i = n; i < dfa_depth; i++) p = &path[n]; q = (p+1); uchar *w = &word[n];{ Vertex **p, **q;dfa_member(ushort n) nr_states, cnt); printf("Minimized Automaton: %%6d nodes and %%6g edges\n", cnt += tree_stats(layers[i*TWIDTH+j]); for (i = 0; i < dfa_depth+1; i++) for (j = 0; j < TWIDTH; j++){ int i, j; double cnt = 0.0;dfa_stats(void) return cnt; cnt += tree_stats(t->right); cnt += tree_stats(t->left); cnt += tree_stats(t->lnk); cnt++; for (e = t->Succ; e; e = e->Nxt) if (t->dst[1]) cnt++; if (t->dst[0]) cnt++; t->key = 0; /* precaution */ if (!t->key) return 0; if (!t) return 0;{ Edge *e; double cnt=0.0;tree_stats(Vertex *t)doublestatic void complement_dfa(void) { Vertex *tmp = F; F = NF; NF = tmp; } NF = allDelta(r, i-1); t = allDelta(r, i-1); for (i = 1, r = R; i < dfa_depth; i++, r = t) path[0] = R = new_vertex(); F = new_vertex(); lastword[dfa_depth] = lastword[0] = 255; lastword = (uchar *) emalloc((dfa_depth+1)*sizeof(uchar)); layers = (Vertex **) emalloc(TWIDTH*(dfa_depth+1)*sizeof(Vertex *)); path = (Vertex **) emalloc((dfa_depth+1)*sizeof(Vertex *)); dfa_depth = nr_layers; /* one byte per layer */{ int i; Vertex *r, *t;dfa_init(ushort nr_layers)void m += HASH(n, 1); if ((ulong) n > vk2) vk2 = (ulong) n; { m += HASH(f->Dst, f->To - f->From + 1 + f->s); } else if ((ulong) f->Dst > vk2) vk2 = (ulong) f->Dst; { m += HASH(f->Dst, f->To - f->From + 1); } else if (f->s == 1 && sigma == f->S) vk2 = (ulong) f->Dst; && f->To - f->From + f->s > 0) if ((ulong) f->Dst > vk2 { m += HASH(f->Dst, f->To - f->From + f->s); { if (sigma >= f->From && sigma <= f->To) for (f = v->Succ; f; f = f->Nxt) if ((ulong) v->dst[i] > vk2) { m += HASH(v->dst[i], v->to[i]-v->from[i]+1); vk2 = (ulong) v->dst[i]; && v->to[i] > v->from[i]) if ((ulong) v->dst[i] > vk2 { m += HASH(v->dst[i], v->to[i]-v->from[i]); { if (sigma >= v->from[i] && sigma <= v->to[i]) if (v->dst[i]) register Edge *f; Vertex *last = (Vertex *) 0;mk_special(int sigma, Vertex *n, Vertex *v) return m; if ((ulong) e->Dst > vk2) vk2 = (ulong) e->Dst; { m += HASH(e->Dst, e->To - e->From + 1 + e->s); if ((ulong) v->dst[1] > vk2) vk2 = (ulong) v->dst[1]; { m += HASH(v->dst[1], v->to[1] - v->from[1] + 1); if (v->dst[1]) vk2 = (ulong) v->dst[0]; { m += HASH(v->dst[0], v->to[0] - v->from[0] + 1); register Edge *e;{ register ulong m = 0, vk2 = 0;mk_key(Vertex *v) /* not sensitive to order */ return v->key; Tally = (vk2>>2)&(TWIDTH-1); vk2 = (ulong) e->Dst; if ((ulong) e->Dst > vk2) for (e = v->Succ; e; e = e->Nxt) { Edge *e; if (v->Succ) vk2 = (ulong) v->dst[1]; } else if (v->dst[1]) vk2 = (ulong) v->dst[1]; if ((ulong) v->dst[1] > vk2) { vk2 = (ulong) v->dst[0]; if (v->dst[0]){ ulong vk2 = 0;cheap_key(Vertex *v)static ulong insert_edge(v, e); e->From = e->To = h; e = new_edge(newdst); /* add as a new edge */ e->S = h; { e->s = 1; if (e->s == 0) { e->To = e->S; if (e->s == 1 && e->S == e->To+1) { e->To = h; if (h == (int) e->To+1) e->s = e->S = 0; { e->From = e->S; if (e->s == 1 && e->S+1 == e->From) { e->From = h; { if (h+1 == (int) e->From) { if (e->Dst == newdst) { v->to[i] = h; if (h == (int) v->to[i]+1) return; { v->from[i] = h; { if (h+1 == (int) v->from[i]) if (v->dst[i] == newdst) /* check if newdst is already there */part2: break; e->s = 0; { e->From = e->To = e->S; recyc_edges(e); e->Nxt = (Edge *) 0; v->Succ = e->Nxt; else f->Nxt = e->Nxt;rem_do: if (f) { if (e->s == 0) {rem_tst: if (e->From > e->To) break; /* done */ e->Nxt = g; /* behind e */ g->Nxt = e->Nxt; /* insert g */ e->From = h+1; /* e=right half */ g->To = h-1; /* g=left half */ g->From = e->From; { g = new_edge(e->Dst); /* same dst */ } else /* split */ { e->To--; } else if (h == e->To) e->From++; goto rem_do; } else break; e->s = 0; { e->From = e->To = e->S; { if (e->s) { if (h == e->To) { if (h == e->From) if (h >= e->From && h <= e->To) goto rem_tst; { e->s = e->S = 0; { if (e->s == 1 && e->S == h) for (e = v->Succ; e; f = e, e = e->Nxt) goto part2; insert_edge(v, g); v->from[i] = h+1; /* right half */ g->To = h-1; /* left half */ g->From = v->from[i]; { g = new_edge(v->dst[i]);/* same dst */ } else { v->to[i]--; } else if (h == v->to[i]) v->from[i]++; } else v->from[i] = v->to[i] = 0; { v->dst[i] = (Vertex *) 0; { if (h == v->to[i]) { if (h == v->from[i]) /* remove the old entry, if there */{ Edge *e, *f = (Edge *) 0, *g;setDelta(Vertex *v, int h, Vertex *newdst) /* v->delta[h] = newdst; */ e->Dst->num = cnt;bad: Uerror("too many incoming edges"); if (d == 1 && cnt < e->Dst->num) { cnt = e->Dst->num + d*(1 + e->To - e->From + e->s); v->dst[i]->num = cnt; if (d == 1 && cnt < v->dst[i]->num) goto bad; { cnt = v->dst[i]->num + d*(1 + v->to[i] - v->from[i]); if (v->dst[i]) register ulong cnt;numDelta(Vertex *v, int d) return (Vertex *) 0; Uerror("cannot happen Delta"); return e->Dst; if (INRANGE(e,h)) for (e = v->Succ; e; e = e->Nxt) return v->dst[1]; if (v->dst[1] && h >= v->from[1] && h <= v->to[1]) return v->dst[0]; /* oldest edge */ if (v->dst[0] && h >= v->from[0] && h <= v->to[0]){ register Edge *e;Delta(Vertex *v, int h) /* v->delta[h] */ return (Edge *) 0; Uerror("cannot get here, cacheDelta"); if (INRANGE(ov,h)) return ov; for (ov = v->Succ; ov; ov = ov->Nxt) return ov; ov = &tmp; tmp.s = tmp.S = 0; tmp.Dst = v->dst[i]; tmp.To = v->to[i]; { tmp.From = v->from[i]; if (v->dst[i] && h >= v->from[i] && h <= v->to[i]) return ov; /* intercepts about 10%% */ if (!first && INRANGE(ov,h)){ static Edge *ov, tmp; int i;cacheDelta(Vertex *v, int h, int first) if (from->Succ) copyRecursive(to, from->Succ); to->dst[i] = from->dst[i]; to->to[i] = from->to[i]; { to->from[i] = from->from[i]; for (i = 0; i < 2; i++){ int i;copyEdges(Vertex *to, Vertex *from) v->Succ = f; f->Nxt = v->Succ; f->S = e->S; f->s = e->s; f->To = e->To; f->From = e->From; f = new_edge(e->Dst); if (e->Nxt) copyRecursive(v, e->Nxt);{ Edge *f;copyRecursive(Vertex *v, Edge *e) v->Succ = e; e->Nxt = v->Succ; e->Dst = d; e->To = t; e->From = f; v->from[1] = v->from[0]; v->from[0] = e->From; Vertex *d = v->dst[1]; int t = v->to[1]; { int f = v->from[1]; } /* shift */ v->dst[1] = v->dst[0]; v->dst[0] = e->Dst; v->to[1] = v->to[0]; v->to[0] = e->To; { v->from[1] = v->from[0]; v->from[0] = e->From; if (!v->dst[1]) recyc_edges(e); v->to[0] = e->To; v->from[0] = e->From; { v->dst[0] = e->Dst; if (!v->dst[0]){ /* put new edge first */insert_edge(Vertex *v, Edge *e) return dst; insert_it(v, n); dst->num = 256; v->dst[0] = dst; v->to[0] = 255; v->from[0] = 0;{ Vertex *dst = new_vertex();allDelta(Vertex *v, int n) return v; nr_states++; v = (Vertex *) emalloc(sizeof(Vertex)); v->num = 0; v->Succ = (Edge *) 0; free_vertices = (Vertex *) v->Succ; { v = free_vertices; if (free_vertices){ Vertex *v;new_vertex(void)static Vertex * nr_states--; free_vertices = v; v->Succ = (Edge *) free_vertices; recyc_edges(v->Succ);recyc_vertex(Vertex *v) return e; e->Dst = dst; e = (Edge *) emalloc(sizeof(Edge)); e->Nxt = (Edge *) 0; e->From = e->To = e->s = e->S = 0; free_edges = e->Nxt; { e = free_edges; if (free_edges){ Edge *e;new_edge(Vertex *dst)static Edge * free_edges = e; e->Nxt = free_edges; recyc_edges(e->Nxt); if (!e) return;{recyc_edges(Edge *e)static voidstatic Vertex *find_it(Vertex *, Vertex *, uchar, int);static void delete_it(Vertex *, int);static void insert_it(Vertex *, int); /* splay-tree code */static int dfa_depth, iv=0, nv=0, pfrst=0, Tally;static uchar *word, *lastword;/* string, and last string inserted */static Vertex *R, *F, *NF; /* Root, Final, Not-Final */static Vertex **path; /* run of word in the DFA */static Vertex **layers; /* one splay tree of nodes per layer */static Vertex *free_vertices;static Edge *free_edges;} Vertex; struct Vertex *lnk, *left, *right; /* splay tree plumbing */ struct Edge *Succ; /* in case there are more edges */ struct Vertex *dst[2];/* most nodes have 2 or more edges */ uchar from[2], to[2]; /* in-node predefined edge info */ ulong key, num; /* key for splay tree, nr incoming edges */typedef struct Vertex {} Edge; struct Edge *Nxt; struct Vertex *Dst; uchar s, S; /* if s=1, S is singleton */ uchar From, To; /* max range 0..255 */typedef struct Edge {extern void dfa_stats(void);extern int dfa_store(uchar *);extern int dfa_member(ushort);extern void dfa_init(ushort); /* 4 exported routines */extern char *emalloc(unsigned long long); /* imported routine */#define INRANGE(e,h) ((h>=e->From && h<=e->To)||(e->s==1 && e->S==h))#define HASH(y,n) (n)*(((int)y))#define TWIDTH 256#define ushort unsigned short#define ulong unsigned long*/#define uchar unsigned char/* nstates -= (double) stackcnt; printf("pan: removed %%d stackstates\n", stackcnt); x_cleanup(d); x_rm_stack(d, dfa_depth-2); stacker[dfa_depth-1] = 0; x_fixup(); d = x_cpy_rev(); if (wcnt != 0) Uerror("bad count in checkpoint file"); r_layer(fd, i); NF = insert_withkey(NF, dfa_depth); xread(fd, (char *) &NF->key, sizeof(Vertex *)); NF = new_vertex(); F = insert_withkey(F, dfa_depth); xread(fd, (char *) &F->key, sizeof(Vertex *)); F = new_vertex(); R = insert_withkey(R, 0); xread(fd, (char *) &R->key, sizeof(Vertex *)); path[0] = R = new_vertex(); lastword[dfa_depth] = lastword[0] = 255; lastword = (uchar *) emalloc((dfa_depth+1)*sizeof(uchar)); temptree = (Vertex **) emalloc((dfa_depth+2)*sizeof(Vertex *)); layers = (Vertex **) emalloc(TWIDTH*(dfa_depth+1)*sizeof(Vertex *)); path = (Vertex **) emalloc((dfa_depth+1)*sizeof(Vertex *)); Uerror("bad dfa_depth in checkpoint file"); if (dfa_depth != MA+a_cycles) xread(fd, (char *) &dfa_depth, sizeof(int)); xread(fd, (char *) &nlinks, sizeof(double)); xread(fd, (char *) &truncs2, sizeof(double)); xread(fd, (char *) &truncs, sizeof(double)); xread(fd, (char *) &nstates, sizeof(double)); Uerror("cannot open checkpoint file"); if ((fd = open(nm, 0)) < 0) /* O_RDONLY */ int i, j;{ int fd; char nm[64]; Vertex *d;r_xpoint(void) return c; x_anytail(temptree[dfa_depth-2], c, dfa_depth-2); /* make copy and let c point to these (reversing ptrs) */ /* every node on dfa_depth-2 that has v->key as succ */ c = new_vertex(); c->key = v->key; if (!v) return (Vertex *) 0; v = x_tail(temptree[dfa_depth-1], F->key); /* find 0 and !4 predecessor of F */{ Vertex *c, *v;x_cpy_rev(void) x_anytail(t->right, c, nr); x_anytail(t->left, c, nr); f->S = e->S; f->s = e->s; f->To = e->To; f->From = e->From; if ((ulong) e->Dst == c->key) x_anytail(temptree[nr-1], v, nr-1); if (nr > 0) c->Succ = f; f->Nxt = c->Succ; f->To = t->to[i]; f->From = t->from[i]; f = new_edge(v); { v = new_vertex(); v->key = t->key; if ((ulong) t->dst[i] == c->key){ int i; Edge *e, *f; Vertex *v;x_anytail(Vertex *t, Vertex *c, int nr) v = x_tail(t->right, want); if (v) return v; v = x_tail(t->left, want); if (v) return v; if (yes && !no) return t; else if (INRANGE(e, 4)) { if (INRANGE(e, 0)) if ((ulong) e->Dst == want) no = 1; if (t->from[i] <= 4 && t->to[i] >= 4) yes = 1; { if (t->from[i] <= 0 && t->to[i] >= 0) if ((ulong) t->dst[i] == want) yes = no = 0; if (!t) return v;{ int i, yes, no; Edge *e; Vertex *v = (Vertex *) 0;x_tail(Vertex *t, ulong want) v_insert(temptree[i], i); for (i = dfa_depth; i >= 0; i--) v_fix(temptree[i], (i+1)); for (i = 0; i < dfa_depth; i++)x_fixup(void) e->Dst->num += (e->To - e->From + 1 + e->s); t->dst[i]->num += (t->to[i] - t->from[i] + 1); if (t->dst[i]) insert_it(t, nr); /* into layers */ t->left = t->right = t->lnk = (Vertex *) 0; /* remove only leafs from temptree */ v_insert(t->right, nr); v_insert(t->left, nr);{ Edge *e; int i;v_insert(Vertex *t, int nr) v_fix(t->right, nr); v_fix(t->left, nr); e->Dst = find_withkey(e->Dst, nr); t->dst[i] = find_withkey(t->dst[i], nr); if (t->dst[i]){ int i; Edge *e;v_fix(Vertex *t, int nr) insert_edge(v, e); xread(fd, (char *) &(e->Dst), sizeof(Vertex *)); e->To = t[1]; e->From = t[0]; xread(fd, t, 2); { e = new_edge((Vertex *) 0); } else /* c == 0 */ v = insert_withkey(v, n); xread(fd, (char *) &(v->key), sizeof(Vertex *)); { v = new_vertex(); if (c == 1) if (c == 2) break; { xread(fd, &c, 1); char c, t[2]; Edge *e;r_layer(int fd, int n) Uerror("not found error, bad checkpoint data"); return t; if (t->key == (ulong) v) { temptree[L] = t = splay((ulong) v, t);{ Vertex *t = temptree[L];find_withkey(Vertex *v, int L) return new; temptree[L] = new; new = t; { recyc_vertex(v); Uerror("double insert, bad checkpoint data"); { if (t != R && t != F && t != NF) } else if (v->key > t->key) if (v->key < t->key) t = splay(v->key, t); if (!t) { temptree[L] = v; return v; }{ Vertex *new, *t = temptree[L];insert_withkey(Vertex *v, int L) { stacker[k] = e->S; x_rm_stack(e->Dst, k-1); { stacker[k] = (uchar) j; { for (j = e->From; j <= (int) e->To; j++) if (t) { x_remove(); if (k == 0){ int j; Edge *e;x_rm_stack(Vertex *t, int k) { tmp = F; F = NF; NF = tmp; } stackcnt++; dfa_store(stacker); stacker[dfa_depth-1] = 0; if (s) dfa_store(stacker); { tmp = F; F = NF; NF = tmp; } /* complement */ s = dfa_member(dfa_depth-1); stacker[dfa_depth-1] = 1; printf(" -- not a stackstate \n", r, j); printf("%%d,", stacker[i]); for (i = 0; i < dfa_depth; i++) { printf("%%d: ", stackcnt); if (r != 1 || j != 0) stacker[dfa_depth-1] = 4; j = dfa_member(dfa_depth-1); stacker[dfa_depth-1] = 0; r = dfa_store(stacker); /* double-check: */ int r, j;{ Vertex *tmp; int i, s;x_remove(void) recyc_vertex(c); x_cleanup(e->Dst); for (e = c->Succ; e; e = e->Nxt) if (!c) return;{ Edge *e; /* remove the tree and edges from c */x_cleanup(Vertex *c) wcnt -= n; memcpy(&b[delta], &wbuf[WCNT-wcnt], n); n -= m; Uerror("xread failed -- insufficient data"); if (wcnt < n-m) WCNT = wcnt = read(fd, wbuf, 4096); delta = m; { if (m > 0) memcpy(b, &wbuf[WCNT-m], m); if (m < n){ int m = wcnt; int delta = 0;xread(int fd, char *b, int n) wclose(fd); c = 2; xwrite(fd, (char *) &c, 1); { w_layer(fd, layers[i*TWIDTH+j]); xwrite(fd, (char *) &NF, sizeof(Vertex *)); xwrite(fd, (char *) &F, sizeof(Vertex *)); xwrite(fd, (char *) &R, sizeof(Vertex *)); xwrite(fd, (char *) &dfa_depth, sizeof(int)); xwrite(fd, (char *) &nlinks, sizeof(double)); xwrite(fd, (char *) &truncs2, sizeof(double)); xwrite(fd, (char *) &truncs, sizeof(double)); xwrite(fd, (char *) &nstates, sizeof(double)); printf("cannot creat checkpoint file\n"); { xwarned = 1; if (!xwarned) if ((fd = creat(nm, 0666)) <= 0) sprintf(nm, "%%s.xpt", Source); static uchar xwarned = 0; int i, j; uchar c;{ int fd; char nm[64];w_xpoint(void) w_layer(fd, v->right); w_layer(fd, v->left); w_layer(fd, v->lnk); w_vertex(fd, v); xwrite(fd, (char *) &c, 1); if (!v) return;{ uchar c=1;w_layer(int fd, Vertex *v) xwrite(fd, (char *) &(e->Dst), sizeof(Vertex *)); { t[1] = t[2] = e->S; if (e->s) xwrite(fd, (char *) &(e->Dst), sizeof(Vertex *)); xwrite(fd, t, 3); { t[1] = e->From, t[2] = e->To; xwrite(fd, (char *) &(v->dst[i]), sizeof(Vertex *)); xwrite(fd, t, 3); { t[1] = v->from[i], t[2] = v->to[i]; t[0] = 0; xwrite(fd, (char *) &v, sizeof(Vertex *));{ char t[3]; int i; Edge *e;w_vertex(int fd, Vertex *v) close(fd); wcnt = 0; write(fd, wbuf, wcnt); if (wcnt > 0)wclose(fd) wcnt += n; memcpy(&wbuf[wcnt], b, n); wcnt = 0; { write(fd, wbuf, wcnt); if (wcnt+n >= 4096)xwrite(int fd, char *b, int n)extern double nstates, nlinks, truncs, truncs2;static ulong stackcnt = 0;static uchar stacker[MA+1];static int WCNT = 4096, wcnt=0;static char wbuf[4096];static Vertex **temptree;#if defined(W_XPT) || defined(R_XPT)proctype %s not found Addproc(%d); #define _T5 %d #define _T2 %d case _T5: /* np_ */ if (!((!(trpt->o_pm&4) && !(trpt->tau&128)))) continue; /* else fall through */ case _T2: /* true */ m = 3; goto P999; /* np_ demon: */ trans[_NP_] = (Trans **) emalloc(2*sizeof(Trans *)); #ifdef CPOR T = trans[_NP_][0] = settr(9997,0,0,_T2,0,"(1)", %d, 0,2,0); T->nxt = settr(9998,0,1,_T5,0,"(np_)", %d, 1,2,0); T = trans[_NP_][1] = settr(9999,0,1,_T5,0,"(np_)", %d, 1,2,0); #else settr(9997,0,0,_T2,0,"(1)", 0,2,0); settr(9998,0,1,_T5,0,"(np_)", 1,2,0); settr(9999,0,1,_T5,0,"(np_)", 1,2,0); wpan.cpan.hpan.tpan.mpan.bspin: cannot create pan.[chtmfb] Spin Version 3.2.4 -- 10 January 1999#define Version "%s" #define Source "%s" #define uchar unsigned char #define DELTA %d #ifdef MA #if MA==1 #undef MA #define MA 100 #endif #endif #ifdef W_XPT #if W_XPT==1 #undef W_XPT #define W_XPT 1000000 #ifndef NFAIR #define NFAIR 2 /* must be >= 2 */ #define NTIM %d #define ETIM %d #define REM_REFS %d #define HAS_LAST %d #define HAS_SORTED %d #define HAS_RANDOM %d #define INLINE 1 #define HAS_ENABLED 1 #define HAS_UNLESS %d #define HAS_PROVIDED %d #define HAS_PCVALUE %d #define HAS_BADELSE %d #define HAS_NP %d #ifdef NP /* includes np_ demon */ #define HAS_NP 2 #define VERI %d #define endclaim 3 /* none */ #if !defined(NOCLAIM) && !defined NP #define endclaim endstate%d #define EVENT_TRACE %d #define endevent endstate%d #define NEGATED_TRACE 1 typedef struct S_F_MAP { char *fnm; int from; int upto; } S_F_MAP; /*** Generated by %s ***/ /*** From source: %s ***/ #ifndef NOBOUNDCHECK #define Index(x, y) Boundcheck(x, y, II, tt, t) #define Index(x, y) x #ifdef PEG struct T_SRC { char *fl; int ln; } T_SRC[NTRANS]; void tr_2_src(int m, char *file, int ln) { T_SRC[m].fl = file; T_SRC[m].ln = ln; } void putpeg(int n, int m) { printf("%%5d trans %%4d ", m, n); printf("file %%s line %%3d\n", T_SRC[n].fl, T_SRC[n].ln); #define tr_2_src(m,f,l) #endif void settable(void) { Trans *T; Trans *settr(int, int, int, int, int, #ifdef CPOR char *, int, int, int, int); char *, int, int, int); trans = (Trans ***) emalloc(%d*sizeof(Trans **)); switch (t->forw) { default: Uerror("bad forward move"); switch (t->back) { default: Uerror("bad return move"); case 0: goto R999; /* nothing to undo */ void sethierarchy() { H_str.low = %d; H_str.high = %d; H_str.begin[BASE+0] = %d; H_str.begin[BASE+%d] = %d; H_str.end[BASE+0] = H_str.begin[BASE+%d]; H_str.end[BASE+%d] = H_str.begin[BASE+%d] ; } /* end of sethierarchy() */ } no runable processvoid active_procs(void) { #define NTRANS %d long peg[NTRANS]; || %s(((P%d *)this)->now.%s[%d]) case %d: if ( (t->ty[i] == %s && (%s(%s%s)) || ) return 0; break; #define LOCAL 1 #define Q_FULL_F 2 #define Q_EMPT_F 3 #define Q_EMPT_T 4 #define Q_FULL_T 5 #define TIMEOUT_F 6 #define GLOBAL 7 #define BAD 8 #define ALPHA_F 9 int q_cond(short II, Trans *t) { int i = 0; for (i = 0; i < 6; i++) (!(trpt->tau&1))1 { if (t->ty[i] == TIMEOUT_F) return %s; if (t->ty[i] == ALPHA_F) #ifdef GLOB_ALPHA return 0; #else return (II+1 == (short) now._nr_pr && II+1 < MAXPROC); switch (t->qu[i]) { case 0: break; default: Uerror("unknown qid - q_cond"); return 0; } } return 1; short nstates%d=%d; /* %s */ #define nstates_claim nstates%d #define nstates_event nstates%d #define endstate%d %d /* PROC %s */ /* proctype %d: %s */ trans[%d] = (Trans **) emalloc(%d*sizeof(Trans *)); #define in_s_scope(x_y3_) 0 #define in_r_scope(x_y3_) 0 no namebad channel name '%s' trans[%d][%d]->escp[%d] = %d; reached%d[%d] = 1; /* escape #%d: %d */ /* end-escapes */ case %d: /* STATE %d - line %d %s - [] */ m = %d; goto P999; /* STATE %d */ #if defined(FULLSTACK) && defined(NOCOMP) && !defined(BITSTATE) && !defined(MA) sv_restor(!(t->atom&2)); sv_restor(0); goto R999; tr_2_src(%d, %s, %d); /*->*/ trans[%d][%d] = settr(%d,%d,%d,%d,%d,"", %d, %d, %d, %d); T = trans[ %d][%d] = settr(%d,%d,0,0,0,"", %d, %d, %d, %d); /* %s:%d */ T->nxt = settr(%d,%d,%d,0,0,"%d, %d); trans[%d][%d] = case %d: /* STATE %d - line %d %s - [IfNotBlocked ; if (trpt->o_pm&1) uerror("non-determinism in D_proctype"); m = %d; goto P999; /* STATE %d */ ; goto R999; settr(%d,%d,%d,%d,0,"-error: (%s:%d) saw 'unless' on a guard: =====>instead of do (or if) :: ... :: stmnt1 unless stmnt2 od (of fi) =====>use :: stmnt1 od (or fi) unless stmnt2 =====>or rewrite T = trans[%d][%d] = T = T->nxt = T->nxt = cycle of goto jumps /* goto mark-down, line %d - %d */ $$$$$$$$$T$h(d<8$$$$$$$$$$$L 444h h 444h h 4h  h 444444444444444h @ 44444444444444444p 44444444444h 4444h 4444444444444 4  h 44444444h 4L 4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444L    4 44 44444  , 44444444444 4 4444444 8 `   44P 4444444h 4444h h h h h h h h h h 44L _CPOR Error!!! in safety_level_namecontinue%s%s%sUerror("block in step seq")%s0%d !( -( ~((/*+%%&^|<><=>=!===||&&<<>>((trpt->tau)&1)'timeout' inside d_step sequenceclaim %s, (not runnable)eventmap %s, (not runnable)'run' in d_step sequence (use atomic)addproc(%d, too many parameters in run %s(...), 0enabled(II, (!(trpt->o_pm&4) && !(trpt->tau&128))((P0 *) Pptr(+BASE))->_p #ifndef XUSAFE ]&1) || (!(q_claim[q_R_check(, II)) && ]&2) || , II)) &&q_S_check( #endif q_len(q_full()==0)(q_len())(!q_full()>0)if (_tp != 's' || _qid+1 != \ || qrecv()-1, %d, 0) != ) continue || (x_y3_ == !q_full(]&2) if (q_claim[, II);lenfullif (q_%s)) { nlost++; m=3; goto P999; } nlost++; else { ; if (TstOnly) return 1; qsend(, %d channel name: %d msg parameters too many pars in send; )) if (q_zero({ boq = ; Uerror("rv-attempt in d_step"); }; } if (_tp != 'r' 0, %d, 0) != (((boq == -1 && && ) || (boq == q_zero( && ( == qrecv(0, %d, 0)) && Q_has(, 1, , 0, 0]&1) if ( { uerror("polling rv chan"); continue; } ) boq != { if (boq != ; } else { if (boq != -1) } ) == 0) if (q_len(; { int XX=1 != 0, %d, 0)) ; if (!(XX = Q_has())) ; if (TstOnly) return 1; } ; if (q_flds[((Q0 *)qptr(-1))->_t] != %d) #if VECTORSZ<=1024 #if defined(FULLSTACK) && defined(NOCOMP) && !defined(BITSTATE) && !defined(MA) if (t->atom&2) sv_save((char *)&now); p_q_save(II, ); #endif = XX-1, %d, %d); #ifdef VAR_RANGES logval("", ); #endif { boq = -1; #ifndef NOFAIR if (fairness && !(trpt->o_pm&32) && (now._a_t&2) && now._cnt[now._a_t&1] == II+2) { now._cnt[now._a_t&1] -= 1; #ifdef VERI if (II == 1) now._cnt[now._a_t&1] = 1; #ifdef DEBUG printf("%%3d: proc %%d fairness ", depth, II); printf("Rule 2: --cnt to %%d (%%d)\n", now._cnt[now._a_t&1], now._a_t); trpt->o_pm |= (32|64); } }) && \ not_RV() > 0 \ && qrecv(0, %d, 0) == Q_has(if (!()) if (trpt->o_pm&1) /* else */( () ? ) : ) )if (TstOnly) return 1; (trpt+1)->oval = Printf(%s((int)assert("", II, tt, t)Uerror("cannot get here")return 0if (TstOnly) return (II+1 == now._nr_pr); if (!delproc(1, II)) spin: bad node type %d (.m) $>$>$> $>$>$>$>Ht=p$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>8=$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>`4$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>8$>$>$>$>$>$>$>$>$>$>$>$>@<\<$$>$>$>$>$>$>$>$>d$>,$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$><4;@d$> $>$>$>$>$>t=t=l8$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>$>p|4$>$>;$>$>$>$>$>$>$>|9$>$>$>$>X<0$>$>no name - putname%s%s%s.undeclared variable '%s'proctype-name '%s' used as array-name_p_pidattempt to read value of '_'%s:ref to array element invalid in this context hint: instead of, e.g., x[rs] qu[3], use chan nm_3 = qu[3]; x[rs] nm_3; and use nm_3 in sends/recvs instead of qu[3] [%%d][][ Index(%d) ]%s[].%s((P%d *)Pptr(BASE+))->%s %3d, { %s, %d, %d }, { %s, %d, %d } putsrc mismatch %d - %d, file %s uchar reached%d [] = { }; #define reached_claim reached%d #define reached_event reached%d short src_ln%d [] = { "-"S_F_MAP src_file%d [] = { #define src_claim src_ln%d #define src_event src_ln%d %s0!()-(~((/*-+%%&^|<=>=><!===||&&<<>>run %s(,len(full(empty(nfull(nempty(!!!??<??[?[]enabled(eval(np_pc_value(( () -> ) : ) ) = printf(%sassert(.(goto)gotobreakelse-end-D_STEPATOMICsub-sequenceIFDOunlesstimeout'%c'%d8L]]]N O]]]pMHN]M\M]]]]]]]]]]]]]]]Z4]]]]]]]]]]]]]]]]]]X]]]]]]]]]]]O]]]]Y]]]]]]]]]]]]T\p\VV]]]]]]]]O]L]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]\[T_t] != %d) if (1) #if defined(FULLSTACK) && defined(NOCOMP) && !defined(BITSTATE) && !defined(MA) #if VECTORSZ<=1024 sv_restor(!(t->atom&2)); #else p_q_restor(II, ); #endif sv_restor(0); #endif else { unrecv, 0, %d, , %d); } p_restor(II); = trpt->ovalspin: bad node type %d (.b) ^DeDeDe^^DeDeDe^^De^he^DeDeDeDeDeDeDeDeDeDeDeDeDeDeDe^PdDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDe^DeDeDeDeDeDeDeDeDeDeDe^DeDeDeDeeDeDeDeDeDeDeDeDeDeDeDeDeDeDe_$_DeDeDeDeDeDeDeDe^De^DeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDeDe0e0e_^^De^DeDeDeDeDeheheheDeDeDeDeDeDeDeDeDeDe^^DeDeDeDeDeDeDe^^^^^DeDe^DeDeDeDeDeDeDedDeDeDeDe^^^^^^^^^^DeDe^; case %d: ((Q%d *)z)->contents j = trpt->oval; for (k = j; k < ((Q%d *)z)->Qlen; k++) { %s[k].fld%d = %s[k+1].fld%d; } j = ((Q0 *)z)->Qlen; ((Q%d *)z)->contents[j].fld %s%d = 0; m = (trpt+1)->o_m; if (m) (trpt-1)->o_pm |= 1; UnBlock; m = trpt->o_m; break; if (strt) boq = from+1; if (strt && slot<%d) { for (j--; j>=slot; j--) { %s[j+1].fld%d = %s[j].fld%d; } } [slot].fld if (strt) { %s%d = 0; if (fld == 0) %s0 = fldvar; switch (fld) { case %d: %s%d = fldvar; break; _pid(%s) %s%d.trail%s.trailrspin: cannot find file %s spin: warning, "%s" is newer than %s %d:%d:%d CYCLE> <<<<>>>> %3d: proc %d, no matching stmnt %d %3d: proc %d terminates %3d: stop error, proc %d (i=%d) trans %d, %c %3d: no process %d (state %d) [] spin: trail ends after %d steps %d:%d:%d:%d step %d: proc %d (state %d) - d %d d_step sequence too longS_%.3d_0: /* break-dest */ S_%.3d_0goto %s breaks from d_step seqcannot happen (dstep.c)illegal operator in 'd_step:' '' '%s'run operator in d_stepremote reference in d_stepprocess terminationnested d_step sequencenested atomic sequence || (1 /* else */)()(boq == -1 && continue'unless' inside d_step - ignoredif (!(1)) continue;boq == -1 && IfNotBlocked #if defined(FULLSTACK) && defined(NOCOMP) && !defined(BITSTATE) && !defined(MA) if (t->atom&2) #endif sv_save((char *)&now); Uerror("block in d_step seq, line %d")S_%.3d_0: /* 1 */ goto S_%.3d_0; S_%.3d_0: /* 2 */ goto S_%.3d_0; /* 'break' */ goto S_%.3d_0; /* NEXT */ cannot interpret d_step/* 'goto' */ /* '.' */ ; goto S_%.3d_0; /* ';' */ goto S_%.3d_%d%s: /* 3 */ Uerror("blocking sel in d_step (nr.%d, near line %d)"); typename %s was defined beforeillegal reference inside typedefstruct %s { /* user defined type */ }; %s is not a typenameredeclaration of '%s'(%s) only an unsigned can have width-field:hide::show:bad array size for '%s'spin: indexing %s[%d] - size is %d indexing error '%s'no subfields %sbad subfield type %d bad subfield entry %d cannot locate subfield %snon-zero 'rgt' on non-structurehidden array in parameter, %sunexpected struct layout %scannot happen cpnn%s..%s[%d]no field '%s' defined in structure '%s' %s%s.%s%s[%d].%s[%d] %s(%d):%s.%s = unexpected - no symbolntyp %d unexpected %s, no '.'spin: saw '' incomplete structure ref '%s'cannot retrieve field %d bad structure %sunexpected type - tail_addproctype %s redefinedexpected ')'expected predicatesyntax errorexpected '%c'truefalseexpected '<>' or '<->'expected '<->'%susage: spin -f formula [-v] [-n] -v verbose translation -n normalize tl formula and exit total memory used: %9ld largest stack sze: %9d ( || ) && U V ! (falsetrue(%s) D Unknown token: []<>-><->predicate||&&UVend of formula%ctl_spin: , saw '' tl_spin: %s ----------^ new: , old: nxt: other: Push %s, from %s, S%dtoo many Untilswarning: node %s not found && acceptT0T%d%s_%saccept_allinitaccept_T%d_UV|&!TF?TT<T h$true formula: [%s] compare to: %s [%s] => different => match New Node %s [] nr %d Done with %s Has Next [] Expand %s, from : assertion failed | /* Normlzd: */ /* * %d states in Streett automaton * %d Streett acceptance conditions * %d Buchi states 0accept_allacceptname too long %saccept%sDfs hits redundant state %s state %s, trans to %s redundant state %s equals state %s T0%s :: (1) -> goto %s %s: T0%s: if fi; T0_initnever { /* */ accept_init: 0 /* false */; accept_all: skip } tl_spin: memalloc %ld bytes releasing a free block size pool allocs frees %5d %6ld %6ld %6ld : assertion failed !true => false !false => true !!p => p !(p V q) => (!p U !q) !(p U q) => (!p V !q) !(p && q) => !p || !q !(p || q) => !p && !q ????\hDcache stores : %9ld cache hits : %9ld N CCCC(C(C~C(sCpCkC(@fC`C$XCSCMC'JCEC#@C 9C2C/C*C1#CC( CC( C&C/CB%B0BBBB BBB!BB"BBB B(B'BB0B{B'vB oBgB`BWB(TB)QB)IBF@BGAGFGLvGV[GPCGR GSGrFsFoperator: keyword: function-name: `KccicOc cccbbcbbbbbbvbgbXbcKb1bbaaaacacTaFa9a.aaaa`cac``````l`V`H`7``____@_/_!__^^H`^^D^9^.^^^]]]]]}]t]f]X]G].]_ca ]]]\\XX?w@kd@+d֔̔dxdg@d@"dƒd`C(dʑ`O? dǐd@kd` ` zkd@֔`N8+kԋddƒ`d يÊ}y֔c@)ydkCيk֔kdd`E kՈLj`kddC ` dkd̆dž`K;d,Cddž`wgWC=1Ԅي`J֔ dȃ֔d` dي`+֔d@)ydk`֔2dd`ƒ:d)~~~~`~@~~}}}y}}}dz}@}}||d|Z| |{{`{ {zz`zVzFz1zzzyyyyydsyfyKy yxxd`x xwdwwwwdwsw@wywvkvvvdƒ@vdvuuu@u uutt~tyt_tfy@td#tt֔sds)fysdyd`sAsg srrdrr֔|`r֔ rdqddqqdqeq@qqd֔p|p֔pddOpdu ppooooodpoZoLo)d oytnnndnndn`n#t n֔nd֔m#t n֔ndmdmm)d@m+mmdd+mullslZl)֔Gl lk)ddkkm)kk"k@k-kkdkj|jjjpjydd)`j@jdjdiieqviki@i֔idddhhhƒhdh`hwLhdƒ hggg@g.ggffkd+mf`f>f f֔feeee|ƒe֔ked֔ƒTe e֔ddd֔ƒdd֔xdddqddddyGd-ddcc`c ccbb@b!bbaa^aHa9a!aa```s`)@` `___n_d@_eq__^^֔`^ ^dd^]]]]]`]c`c!bba@]^aHa9a!a,]s`)]_ ]d\eq_\`\^֔ \[dd[yk[[d[[@[ [ƒZdZZcZAs@ZZ ZYYeqY@Yd)YYXXXoXeq@X,Xd%Xd`]cwXWdWba_`W WVVVVVV{VeVOV?V VUUdUC`Ud UTTVTTT`Tƒ TTSdeqSS@SdSyd SRdRsR^RdCIRd RAssRQQ}QdQ@QyteqQPdP)dCPdPw֔Pd@P#PPOO`ODO O)֔ OdNNdNNNHN֔ NNMMMMsRlM@MdMLddLƒLdLdsR`Ld.LL LKKKK)uoKYK=K,K#tKJJ֔`J JIIIddI`JINIIIdDI)d IHHHy`Hd HHƒGGGGGGfGGGG)@GGFF֔GFd`F@FGF)EEfyE@Ed|EDdD`D@DDNCdC)dLƒCCCGC CC C֔BddCBduB@BdBAA@AyAd̆@֔K@d@@@ @????d+m`? ?>Zl>f ?>kdd>_>d`> >sR=d===f=P=9=#=ytƒ=<d<S<@SdP<G@<:<"<<<dƒ;d;;`;cƒ ;:d::<@Sd:kيC`:ƒ :d999֔9`9dd+m499d8Ԅ8@8$8ƒ8֔8d7N7`7dM7kd 766666N6dk:6(6$865N6dkd+m>f5`5y@55444`47eq 44d33533{3t3[kc3@3eq 44d333t3[k[֔22f@2ceq 44d21yteq1de|ƒ1֔l1d֔ƒS1 1֔0dd֔ƒS10֔d0dd@00//YyZ/@//..`. .------`-- ----[hdddd,ceq,,dw@, ,d++9+d+@++* .eq**dƒ`*d3*y9*Asƒ)yt))d{)e)eq@)d) )-((((eq@(&(d(m)֔eq'd'[dyd'ƒ'm'@''eq&d&yd֔&`&dkN& &cu&ƒ%%%`% %$d$As$yt$a$d@$ $#Gd@Z#yd#iƒ##w#֔f#dAseqǐ@##@idd#yd֔ƒ##w#֔f#dAseq"d#+m""dydkt"q"@"0"""!!{!p!^! LL!A!%! ! y  k  0"@   dd`K fyd`1K1fy@d d`?,y@y֔@y@ydk֔dl@+mdlOd| ddfyrdg@dd֔֔ddC@֔ddƒg@K֔֔`dg@KCdu#t ֔d`֔ dƒK֔` Kd|`@kdfy@`<֔*d+`e  d֔ g dr@ dd   #` ֔V d    @  ֔  ` = -      Ys # @  `yd   dd@ddl`@kdNu@ dd"djq"P ֔@ymdGd YzYobN d?@ lkq"YT֔d  YN~@KdYe@kdd kzYobN@ zYoN@du#t`A֔ dd` d@@u#t֔Add`" d` `yJk<ddd` d|ddkdlʑ ddd@`  kd kd+`֔&dded`Nku2Nk`Nk֔ kddd` d`d`da`@ddd` d`dƒ,K kddu ` kE K@dkdd`"B hd`judmbVq"F0" u#t֔`d֔ d` `d `u#t ֔`dd "d` d`}vYL+ dc+@dl#@d֔e#@d`d dd-kk+ d}}vL` d@ kVq"p@ E@d [kdLƒQ? ֔ddCGd ka@@'doWAcƒ d:k666k:6dt"tdbE*~icL8ydLydk@-k@q"ƒd`E yq"`F ` P)?kq"rbH K` kƒd` ` ykq"0"V j@jkwd`eq dq"0"iQ dQwdwcE,keqdq"`M1dȿdRD1ddb@K q`Rq"C M`dRD1dF wdudX?0@wdйxb@k0иwpdи@и`1Ӷ̶kvZC ڵyĵ`M@d" kcD1d@dq"dvZC ڵyĵ`M@d"k޲D1d`)dq"kq"`D k@~kdq"u& r#֔ddeq`@ծk`d+ϭd@eqdr#֔TddL  `4ת-lxdky[kP8q"֔dlZY ֔` dܧѧ@,AsytʦG}Pdyt@P)yϥkr֔d`GAr,֔d}r`O uqT>dd/ آŢylyXAy3k֔% ˡvkcMk:$kd آŢylyXAy3kdgd֔T ֔dd%_KB* ͞dǞvYkQkK/#ˡ` ymd`d@֔ƛus`@dkd_dP֔? ymd|d@dddj@ ֔}md]YWd>d0}k`B;2'Kd@תGەȕ)yhj]@0הϔv<\J֔  d]YWdd_M}hC1de%0"| k֔dd ͒dL`eq u‘rd?kd@do@dd|͐` kޏŏn_K `)ytd)yэdkr@ˌdA!dyykd`dEd <֔`:u!`dފkddYWddܧѧŊ@l yd>fp֔^duS ` `A )iWGpo )dyddruƅmU:<fy dpofydeqdlGd@fydeqd)֔ƅytfydeq@dl)dfydeqdpfy@d'l)dȁ|hZD-.}}kfy` ֔dddu`ZA )Dydkdd`r eq~d~֔eq~ddtd~~0"ƒ>֔/d!d>fddd֔>f֔d֔ddd}sU֔Cddddsdh[dPCd8+dld` `L  Ԟ֔ĞdMwdjVB8 ֔dwdjL7,ydsR@d@_d@ޙԙǐd` "`d dDTe֔OddL dC֔ؖdd,`d  d`kK`<d$ "@kd` ldk_D1d@d` kqbK`E(kЫK`<dE/F_D1dq"cU @`kC*dq"wkضǶ@kdMf@$δpw_@#ͳydk@Ӳ`4kɱw_@#`ͳ ydӲ@4kd`@q"ktq"veW Ccd@k^q"elTH<.I D1dydo@`"@k#t֔@d?)`k dq"@delTX .`k\? /#dd@k\? /#@ddtjtbO2 }lPU @kzq"@W@k}@@|dp_@RB- xdO  yd`F pX@dM'd#֔dsdd+s֔}dk@'kd d>f֔֔'kdddW֔I.dd#tdNdddhdPyd8adfyGdP/d_ddddgd9Ndl1d"d'kddfyGdndRd ֔?d@  zqg`V;'`F5F@xFnV |gL FFaFF FFFFv_@x\ ` ` ` F`CF7,FFFx@FF5F~s^Q<,7, FFo\E qX?& w^E,@` FF@Fn@F`C FF` n@o[A) + * * 7* F* `*  * ) 7) FZ) E) 0) )  ) ( ( ( (  + ( `* ( ( 7`( F>( x"( ( ' F' ' ' j' Q'  ' ' & & & ( ( & & & z& @& & % % @% % $ $ b$ `$ & L$ >$ "$ $ # # X#  # # " `$ F" " " `" 0" " 7! F! ! ! k! @! !  ! !    `        F ` 2            { p  l \ D   ! k! @! !  !    ` D F      ` ? ` % F   | c \ D   ! k! @! !  ! x    @      @       s m @ .  @! @          m    l  F&   q @   7  x l x F@  7     FF 7]  x l x F@ ? 7     Fl +     `  7 | @        F`    7     Fn Y D 7 0 &  `     K 2           d @    F7 F  l `    7@     Fr @   7   F`       d ` @  F7 F    @  d `      w F7 F q F^ F     k!   z  k @ @! "     g @ 3 m % @!   l    `     ( "   @  ( "    `  ! G ^        x ` D   l F( "     Q    x  } ( b @ F.    h K 3 &          s b J 1 "  F `$ i_@" `F7)"`$ " D ( D pb I7`$ " &`N`$ Fnh ;rh oh Sh 5h !h h g @g g f f f f `f  f e e e e e @e e d d Wd >d  d c c `c c b b @b b a a a a a a a `$ a ka `a Oa  > y> `$ & d> Q> ;> ( !> > = = `$ & = = W= I= 9= = < < < U< 8< 0< < ; ; @; 8; '; ; ; : : : : ~: f: P: 6: ": : 9 9 9 9 9 `9 >9 C -9 9 l 9 8 8 8 8 8 8 V8 ;8 !8 8 C M " `$ ` 7 7 7 7 |7 r7 _7 F7 -7 7 7 6 6 6  6 6 6 6 p6 V6 C6 +6 6 6 6  5 5 5 C M 5 5 5 5 w5 `$ a [5 H5 65 &5  5 4 4 4 4  ! 4 4 4 4 y4 _4 G4 4 .4 4 4 3 3 3 t3 a3 `$ V3  3 3 2 2 2 2 `2   2 2 1 1 1 `1 B1 m  1 1 0 l 0 c0 @0 0 / / / / l / / 0 / l @/ 2/ " `$ ` / . 65 .  5 4 . . [. ?.  . . U `$ a - - 65 -  5 4 - 4 [. - `- U- =- 4- - - , , , , , o, @, , , l , + + C + + l `+ E+  !  + `$ F    K 0  a  a    | p `$ a e a V = 2 & `$ a     Z 2G  X  l V    m U X   `$ a  ܆ ˆ    o W `$ " H 1     | l @  !    @    @ C?  ?    `$ a  ` K      i @ ' `$ a   €  m [ `$ a L 3 d (     b @   ~  ! F~ ~ `~ @~ $~ ~ ~ } `$ a } } } }  ! } @ `} 4} } l m } }  `$ ` | | `| 7| !| 4 4 y4 _4 | 4 .4 4 4 z { {  l{ `{  L{ ?{ `$ `  { z } z z z `z U `$ " ;z _ 1z "z r7  z y y y y vy `y @y y y x x x  `$ a x {x - Z kx @x @ x w w w `$ a w w - w gw @w w v Z v `v @  v `$ a v Z u u u su `$ ` Uu  u t t Z t t it @t t l @ s s it s t l s s @s U `$ a s r - Z r @r )r r q q q q q l @ q @r )r Rq @q 0q  q q q q l q p `$ ` p p p `p $p p o o @o n?@ABCDE F$G;HTIiNQRST9UUVmX[^ehl q r5 uP vm y z } & @ ˔t F  #V Y 4u < C F S Z ^ltMyn4 Lb8wbKL#5LwH8KgLUZ^?awb\r5 7!899S:m ddpdp9<Hr0,V1V&o7 PdybjzT 2!I"^#t%&12345628J9c;=>?@AB C D7EMFeG|HINQR#S:TUUqVX[^ehlq6rQulvyz} ) B \ } F !#U!Y"4w"<"C#F#S#Z#^$-$"A$#V$$i$%}$&$'$($-$1$=$B%G%%L<%QQ%Wf%c{%h%m%s%t%z%%F&R,&^C&W&l&&&&&&&''7'P'f''(''E''6(&%N((((1(7)J\)Qs)))))* + +K+9R+=g+-+7++bV+8+_+,K,,#-1++3-.I.Hs.K.L.U/ZA/^z/a/b/0@263335G47`48y494:4<4+5 5~558A8X8a 9i.9lT9Pj9993P'9]:s:;;<&(<=D=>I3>?T??b?R@ik@@n@?AvVAA{AoBBC8CPC49sCnC C C !C !C !C !C "C # D&% D&% .D&% =D s^D D D D D E ,2E 8UE xE$pEEpDDD$E$DDDDD%D0DCDJD^DDDDD D D !D (D0D@DHD]DbEEEEb$dE$1D1D>D?D@DB$DC@DDJDETDHeDIDKDWD_DaDcDd?DeSDf]DgpDixDlDmDoDtDyD{D}DDZDrDxDDDDDD~DDDDD D$E0DODDPDDQKDRPDSPDjXDk^DloDnyDpDqDsDDDDDDDD DD"D(D6DCDUD\D\DDDDDD$D4DWDWDaD|DDDDDDDDDDLDTDZDgDqDwD|DDDDDDDDD)D3D3D8DGDPDfDwDDDDDDDDD(D2D8D@DIDeDtDDDDDDDDD$ D, D9 Da D D D D D D D D DK DP DZ Dl D D D D D D D' D9 DN D[ Dz D D D D D  D! D# D$ D% D' D(8 D)o D+t D, D- D/ D0 D1 D3 D42 D6X D7w D9 D< D= D> D? D@ DA DBDD$DF,DGIDHjDJDKDMDNDPDQDR"DSRDUXDV^DWtDYDZD[D\D]D_ Da(DbQDd[Df`DgjDhDjDkDlDmDoDqDrDsDtDv,Dw:DxFDyrD{D|D~DD D DBDQDwDDDDDD8DKDPDDDDD D7DVDnDDDDDD6DHDZDDDDDDD)D6DBDqD}DDDDDD DD"DNDcDyDDDDDD5DNDvDDDDDDDDHD\DdDDDDDDDDD(D0D?DhDDDDDDDpDDDD#DOD{DDDD+DWDxDDDD D D D "D+D=D`DjDpDvDDDD6D^DeDrD~D!D"D#D$D& D'3 D(R D)g D+z D, D- D/ D0 D2 D3 D4+!D60!D7:!D8L!D:T!D;`!D<t!D>|!D?!D@!DB!DC!DD!DF!DG!DJ!DM"DN "DO#"DPO"DQ{"DR"DS"DT"DU+#DW0#DXZ#DY#DZ#D[#D]#D^#D_$D`$Db0$DcK$DeW$Dh\$Di$Dj$Dl$Dm$Dn$Dp$Dq$Dr$Dt%Du%Dv(%DxT%Dz{%D|%D}%D%D%D%D%D &D(&DM&Dd&D&D&D&D&D&D'D''D,'D9'DL'Dh'D'D'D'D'D(D7(DK(DP(Do(D(D(D(D(˶D (D (D (D (D )D )D !)D 2)D F)D O)D n)D )D )D )D )D )D *D *D &*D ,*D <*D D*D I*E2F2F2F\2FW:F3E> I*$K*DF SF bF sF F F F F F F F F d7d8Fd89<Hr0,V1V<$7 ybjGK+R+=[,G DG!\G"rG#G%G&G1G2G3H4H55H6OH8hH9H;H=H>H?H@IAIB8ICOIDhIEIFIGIHIIINNJQgJRJSJTJUJVJX K['K^@KeWKhrKlKqKrKuKvLyLzdbIdb VdbDcDeDf;DgDDiiDjnbdcn$pjd$p}dodo dodoDpDqDr'Dt8DuHDvgDx~DyDzD{D|DtD~DDDDDDDDdpdq$d$dDDDD5D<DHDMdM$Od$`DDDD D&D0DODTDsDyDDDDDbd$d$TDDD DD*$,e$&e0e DDDD;D=DLDRDgDvDDDDDDDDD!D8DpDDDDDDD D8DMDTd>eGe2F[$[Pe$ܾdee DD DDSDeDDDDDDD"D4DgDyDDDDDD0bd0$2ve$}dd DD D (D 4D DDYD zDDDDDD"D(D=D!=D"ED#fD$D&D(D)D*D+D-D.D/D1D2D3D5D6D7D8D9D:D;D?D@DADBDEDI#DJ(DM-bdeeeeeee-$2e$QDDQDTDU6DV>DWEDYdDZjD`lDaxDbDeDfDgDhDiDlLDmzDnDoDpDqDrDtDu Dv5D|pD}D~DDDD D5DLDlDDDDDDD4DhDDDDD,DHDODxbdQx$ze& bf$tfDDDD<DbD{DDDDDDDD#D*DDD`DtDDDDD(DfDxDDDD D D D DDDD,D4D9EfeD9$;f$DDD D!D"!D#(D$2D'PD(XD)bD+lD6D7D8D:D;DCDDDEDG(DH0DJ:DL:DNBDOODPODQlDRDSDTDUDWDXDYDZD[D]D^f&< f&@ bdf&OD O$f *f *#g +Mg ,\g -pg -~g(0hP g(llP ddgd9<Hr0,V1VK+R+=7[++cV +b+gK-5++4<j9993P'f']:b*h :h Kh eh ph& X h$%h$h$ D%D&D'D(0D)\$^h$-xh,D-D/ D0D1*D2/D3;D4AD5DD6Jh-J$Lh$:h9D:D;D=D>8DAD=DCDDDEDH DDDJ$DK4DLWDMjDNtDODQDSDUDVDWDXDYDZD[D] D^DaDb$h:h:h;$$&h$fheie DfDhDiDk<DlMDm\DniDpxDr|DsDtDuDvDxDzhf$ i |i$hDDD"$$/i$@iNi DDD D$D-D;D@D\DhDtD}DDDDDDDDDDDDDDDDD,D@DnDDDDDDD)[idioiExiiii)$+i$ii iDDDDADsDD[ii$i$hi iDDD$DADWDoDwDDDDDDDDDDDD D8D`DuD{DDDDDDDDD*DBDNDdD|DDDji$j$<ji DDDD(DtDDD$*j$hi DDD D 8D FD `D mD DD;jEj$Oj _j$nji DDDDD#D.D@DTDdD mD!yD"D#D%D&D'D(D)D+D,D- D/"D0*D1*D*D28xj[ijTj+**:$:j 4j$8i7D8D9 D:D<D>7D?@D@RDBZDChDFDIDJDKDLDMDNDODPDQ$DR-DS?[i8j9i:A$Aj$W$jVDWDXDZ D[ D\AD]HDZMD_XD`][iWiX]$_j$djcjc DdDeDfDgDhDiDjDk Dl8DmPDnhDoDpDrDs$j$xDjwDxDzD{D|2D~<DAjxA$Ck$jDDDD$D4DUDjDDDDDDD!D4D=DPDhDqDDDDDDDDD DD7DBDDDTxjEBT$V+k$DDDD(D4;k6$6Gk$jDDD7DXDmDD$Vkk&h k$jDDDD0D9DDDMDSD`D{D|DDDDDDDDD4DPDgDDDDDDkEkk$ k$DDDD+DDDDDDDD D(D 8DSD d;kkf$fk(!P d*d,ld,9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:b l& 0l$$,>l#D$D&D',D(>D*HD+eD,D-D.D/D0D3(D4;D6PD7ZD8oD:xD;Il$$Rl$?`l>jl> D?D@DADB8DCEDD`DEu$wsl$I0lHlH DIDJDLDQDRDSDTDUDVDWDXDZ$l$^8l]jl] D^D_DaDb,DdGDe\DghDhrDiDlDmDnDoDpDqDrDs!Dn@DuLDvTDw\DxaE^j^l_a$fl$|>l{D|D}D%DZDoDxDDDDDIl|E}l}$l$il lDDD0D@D\DpDvD|DDDDDDDEllm$"m$`lj DDDD,DBD\DhDDDDDl,$3m$<FmXm hDDDD(DFDMDOD\DhDpDDDDDDDDDD0D9DOD`DsD{xjicm{$}nm$DDDD$DDDDDDDDDDDDKDTD`DsDDDDDDDDDD!D@DZDzDDDDDDDD D D D D3DCDXDtDDDDmmh2Fmm$m$dmDDDD$D/DED!LD"dD#nD$D&D)D+D,D-D/D1D23D3CD5wD6D7D8D9D:D;D>DADB:DCCDDNDFiDGzDHDIDKDLDMDODRDTDUDW/DXKDY`D!`DjDZ|mmIlEm7`~$~ddmd9<Hr0,V1V<$7 K+R+=[++cV+a+-5++4<j9993P'f']:mm}'Gn0nyn(n0nnGn"o%>J(o;oFopppq,qrbX #i $z % % % % &́ &݁ & & ' ' '& '3 'C 'T 'c (v (&4 &4 &5 ˂&6 &7 &80 .&94 ?&:8 P&<< ^&R@ o$VUDVDWDXDY.DZLD[RD^hD`xDa$$ehdd dDeDj Dk!Dl<DmSDk|DoDpDqDrDsDtDuDvăexexEet $  $zt y-y DzD} D~!D9DED[DhDDDD:zEzP{$r$4~ DDD D*D4D>D\DDDDDDDDDDCDHDPD`DkD|DDDDDDDD D+D<DTD`DDDDDDDDD$D0DEDRDXDbDtD|DDDDDDDDDDD(D8DHDXDhDxDDDDDDDDDDD(D8DHDXDhDxDDDDDDDDDDD*D7DTDeDoD}D}DDDDDDDDDDD2DCD \D qD qD DDDDDD%D>D@D`DzDDDDD D"D#D$ D'! D)e D+ D, D- D. D/ D0 D1 D2 D3$ D4E D5N D6T D7t D8 D: D; D< D> D? D@ DA DB DD DE DF DG+ DH2 DID DJK DKY DLw DM DN DO DP DQ DR DS DT DU }hH D 8q_E.D    $ #$YTDYDZD[$ 1$_`C^O^ D_DaDc#Dd)Df<DgJDh\DilDj}DlDmDnDoDp$[$t<CsOs DtDuDvDw$$&i${djlzD{D}D~ D2DEDJz{J$L$tf DDD-DXD\DeDzz$|$,Dž ԅiDDDDFDHDTDdDnDwDDDD߅$$i DDDD.D:DFDWDcDoDDDDDDDDDDDDDD-D3DGDZDDDDDD DD2D4DHDwDDD$$$l4> HDDD DD<DRDjDDDR^j$v$4 jlDDD,D;DQDgDlDDDDDDDD,DDD\D|DD D D D D <DTDtDDDDD D,DLDlDDDDD D,DLDdD D!D"D#D$D%D&<D'\D(tD)D*D+D,D- D.,D/LD0lD1D2D3D4D5D6$D7DD8dD9D:D;D<D=D> D?,D@DDA`DB|DCDDDF$ ! !(3T (;T ֆ(= U ddd9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:m&D  j k#&z 0&{ >&| N&} ]$DDDD2DHD^DDD$o$DDD D+D0D@DTDqDxDDDDDDD:DRDlDE$$|DD DHDoDDDDD D$D1D:D`D~DDDDDD4DED`D{DDDDDD$Ƈ$|DD D!D7DSDiDzDD$ڇ$< ' l$DDDD D'D:DID_DDDDDD-DC1:CE$EL$[d lm' DD+DNDoDDDD$v$DDDD&D NDZD dEf$f$ D$3$ ɈDDD5DKDaDwDDDDDD /D!ED"[҈]$]ڈ$&[%% d%h%D&D( D)D*D,,D-SD/D0D1D2%D3(D4=D6@D9UD:[D;vD<D=D>D?D@DCDE`DFDHDIDJ5DKKDLaDMwDNDODP&&&&&!&$*$Tl DTDWDX2DY]DZD]D^D_D]DaDb Dc8Dd`DeyDfDgDhDiDjDlDn(DrhDvDxDyDzD{D|4D~DDDDDDDbDDET;TGTRg^hjiRy^zj{ $ v$|$[DDDDD4DFD[Dn$p$$[h DD'D8DADXDfD|DDD$$%hDD9DBD~DDDEB$(s@U É(tDU Չ(uHU ߉(uLU (vPU (wTU (xXU (y\U (|`U dI&dL&+dL&9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:b2 G R b&# p&$ ~$1L&h0D1D2D4 D5D41D6<D7Axj1E2A$C$;&l:D;D?D@DBDC(DD6DEDDGYDHnDKDLDNDODPDQDRDTDV)DWKDXiDZD[D\D^DZD` DaDbDd6De>xj;<E=>$@$i(hhDiDkDlDDmDni$$r\)hqDrDtDuCDv`Dwere$gˊ${)hzD{D}D~CDhDm{m$o܊$4*hDDD#D3D:DDDvDDDDD$$<+h DDD'DXDXDlD~DDDDDDDDDDD&D0DVDrDDxjXbd$$,h DDD$DPDDDDDDDDDDSDYDyDDDxjE2F",$6$x.EO hDD D0D0DEDZDDDYxyX80$$/h DDDD"D<DHD\D{DDDD D"DCDvDvDDDDDDD DD&D-D2xjE2F"v2$7$L1h DDDDD %D TDDD DD$D0D<DTDZD pD!yD"D%D&D'D(D)D*D-SD.YD/`D0D1D3D4D5D77D8=D4]D&dD<xD=D>D=DADBDD+DE:DFADGFxjE2FF$Mȋ$K5JhJ DKDLDMDODP<DQ}DODSDTDUDVDXDYDZD\D]D^6D_?D`ODalD`DbDcDbDdDeDgDhDj0Dk8DlEDmWDniDotDpDrDsDtDoDv(Dw@DvfDxpDyyD{D|D~DxjKՋLLEM2FM$$L9hDD DD4DBDpDDDDDDDDDD)D5DcDz!|$|*$:h= lHDD DDD!D/DoDtDDDDDDD6DIDIiQeIK$K[$<h= lHDDDDDLD_DhDxDDDDDDDDDD DPDTDdD|DDDDE$m$=ŒDDDD)D1ˌ3$3܌$,>ŒDDDD"D)D<DAA$C$p>hl =HDDD(D0D9DBDdD~DDDDDDD,D@DDDVD\DiDDDDDD D D D D;DBDPDeDvv$x-$@lH DD D(D0DODcDeD xD!D"i[i<$H$&AX%l% H%D&D' D(D)1$3j$-Al,jl, v,D-D0D1D2D3,D4GD7jD8pD9zD:D;D<D=D>D@DADJDK DB(DC8DHLDA\DDhDE~DCD2DM-2F..$$QCnjPhP PDQDRDS"DU6DXTDYjDZpD\D_D`Da$  ! drDdtDdtD9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:b   ( :& U&! k&" y&" $1tD0D1D2D4D5/D67D7G12I$I$;DD;D<D= $ǎ$ADDADBDC $َ$GDFF DGDKDL(DMBDNYDOpDP}DQDSDTDUDSDKDXDYG GH$$]E4\>\ D]D^D` Da+Db6DdH$JH$hFZgDhDkDl9DpDrDsDtDuDwDxDy DzD{,D}4D~DDTDdDtD|DDDDDDDDDD DD,D<DLD\DlD|DDDDDDDDDDD%D.D@DEhmiE$Gh$dIz DDDD*D6D=DGDTDoDDDDDDD DD5DKDmDyDDDDDDDDDD$$lKȏ DDDD'D,,$.ҏ$KhDDD D$D8DBDXDhDpDDDD$$HLhDDDD;DDD[D dD y${$LhDDDD*DPDWD^DeDxDDDDDDDD D"D#D&D'D D)D*D,(D-@D.ID0OD3kD4{D5D7D:D;D<D=D>D=D?D@DADBDDC`DEmDFDGDH '0>O$_$LdOqK{K DLDNDODP"DN'DS4DTHDS[DXhD`DbDcDfDgDfDkDlDpDs,'L,$.$wPv{v DwDyDzD{)D|4Dy6D~D wF$F$PhDDD!DGDbDmDvDDDDDDDDD '$$QDDD(DNȐN$Pѐ$LR DDDD)DDDDDDDDDDm$$8ShDDD DDD3DGDNDPDXDjN$l$ShDDDDD+DODdd$f$ Tl DDDD$D<DQDSD`DpDxDDDD"$+$Th; DDDD D*D4D@DKDVDqDv"Ilv$xE$(UDD D D #D ,D 8D ="=$?U$hUe oDDDD#D,D.D<DDDQD^Ds"s$uy$!U h  D!D#D$D&WD#YD(hD)nD*D,D-D.D/D0D1D4D5D6D7"D:FD;wD<D=D>D?D@DA"!/01$$EWlDD DDEDGDHDJWDKfDGsDMDN"E$ϑ$RPXDRDVDW6DXJDYRDZ]D[eRSTg$g$_XD_D`DaDb!Dc*$,%$gXf9f DgDhDiDj6DkK$MF$o4YZndn 9nDoDrDsDtDuDv.DxpDyD{D}D~DDDD DD D%D/D:DWDhDDDDtDDD onojop$y$ZDDDD-DRD`"b$b( dU dV[dX[dX[9<Hr0,V1V<$7 K+R+=[++cV+a+-5++4<j9993P'f']:b  Ē Ғ ! " " " #* #7 #D $V $h&& |$-X[,, ,D-D/D0 D1-D2GD3oD4{D5D6D7D8D9D:D;D<-$$AL\̓?֓? ???DADDDEDF'DG0DH9DILDJVDKaDMiDNDODNDMDPDRDSAB B2FB$$W$]}dVDWDYDZD["DY2D\@D]M)WM$O2$at]DaDeDfDg(Dh/Di@Dj`DkiDm|DiDhDeDp)aCbebic$L$t$^]sDtDuDvDxDyDz&D|ID}aD~hDDDDDDDD$D/DGDW$Yh$_vDDDDD+D@D_DuDDDDDD)$$X`jlDDD DD.D7D<DgDyD{DDDDDDDD D!D,D<DQDeDxDDDDDD)$$ bDDDDDDD+D;D;DLDTDrDyD~DDDDDDDDDDDL$$$cDDD8D`DoDtDDDDE2F$ɔ$cޔDDDPD`DwDDD D D DD$$dDD DD!D(DDD[DmD D!D"D#D$D&D'D(D)D*D,0D.OD0~D1D2D4D5D6D7D8D9D;(D<4D=RD>ZD@`DA~DBDCDDDEDFDGDHDI DJDKDL+DMPDOjDQxDRDSDTDWDXDYD[D\D].D^6D`<DaZDboDcxDdDeDfDgDLDhDiDjDk Dl#Dm8DnHDoLDpTDqjDrD)DuDvDwDxDyD{D|D~D)D9DFD^D|DDDDDDDDDDD*DDDTDYD\DfD|DDDD#2FHV&h'x''6MNPY$˕$lDDD DDD D%D,D?DOD_DeDnDsDxDDDDDDDDDDDDDD(D8D@DGDDDDDDD8DBDWDgD}DDDDDD DD2DID_DdDjDzDDDDDDDD  D D &D 0DCDTDkDpDDDDDDDDDDٕ$$ qD D!D#D%D&'D'4D(DD)VD*`D,jD-{D.D/D0D1D2D3D4D7JD8SD9[D:eD<lD=D>D?D@DADBDCDDDE'DF:DGJDHdDJtDK~DLDMDPDQD3DSDTDUDVDW ! ,!ٕ"2F#9#$F$]tX\}d\ D]D`DaDb9D`>DdPDe`DfjDgxDhDiDjDkDlDmDnDoDpDqDp&Ds0Dt@DuDDvMDwbDxnDyzD|D}D~b]E^$k$XvXDDDDD,D4DDDDD}$$lwX DD DDD.D:DRDhD~DDDDDDDDDD%D9DJDRɖҖhH(T$T $xX 2DDD DD"D@D`DiDDDDC<e$E$y}dDDDDD,DIDKD\DbDvDDU$^$ znDDD%D8DIDdDjD{DDDDDUl$y$z֓j DDD2DDDXDsDDDDDDDDDUl$$ { D DD0D@DUDhDD$$|XDDD D3DCDTD n$p$$|ޔ## D$D'D) D*D,&D.]D/pD1D2D5D6D7D;D>]DAm$&& ї'o$o$Eh~DDEDGDHDIDJ)DKADLJDObDPDQDREE$$VUDVDY DZD[#D\/D]GD`TDbmDc}DdDeDfDgDiDkDmDo'DpGDqPDs`DcjDw|DxDyDzD{D|D}D{+D@DEVEV VWE$G #+(U dWdX>dX9<Hr0,V1V<$7 K+R+=[++cV+a+-5++4<j9993P'f']:bD& P&$ _$'Xm&D'D( $ v$,hD,D-D.uD/D0$$43D4D6D7 D9D:0D<8D=N4N$P$ALޔ@DADE DFDMDN(DO<DP[DQpDS|DUDVDWDXDZD]D^D_D`,Db<DcXDd]DiDjDkDlDn Do3DpKDr`DseDtDbDwDxDzD{D|D}D~DD+D<DSDpDDDDDDDDDDDDDDDD.D5DSD_DlDDDDDD D)D4DJDSDcDpDDDDDDDDDDD(D7DGDSDjDwDDDDDDDD$D4D>DXDgDDDDDDDDDDD-D9DIDSD`DDDD DD DD AAʘBEC2FCCWHXӘX|D D $F $ޔDDD%DQDXD`Drr$t*$8DDD D LDSDXDnDDD$L$ȌDDDD.DSDZD hD!m_pm$oy$%88$D%D&D'D(D.'D/LD0\D1D2D4D5D6 D7TD8D9D:D;(D<XD=D>D?D@(DA`DBDCDD$DEXDGDIDJDK DL(DM@DNXDO|DPDQDRDSDTDU,DV<DXTDY`D[D\D]D^D_D` DaPDbbDcrDdDeDfDiDjDkDlDmDnDpDq$$$u\tDuDvDzD{!D|.D}LD~pDDDDDD)D0D6DIDPDfDoDDDDDDD4D:D=DLD}`DlD|DDu(dvvEw2Fww$͙$ DDDDdDDDDDDDDDDDDDD)D/DADLDlDDDDDDDDDEݙ$$ޔDDDD DxDDDDDD DD&D0DHDOD`DtDDDDʘ$$DDD)D0D@DMD]DsD {D}D D E$d7d8'd89<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:b1;& ( ]g& H# &% & & Κ&& &' &5|' 5&A' W&S' y&P) &) &) & * &,* "&4* C& T* f&l* &t* &* ɜ&#* &'*  &+* )&D+ J&X<+ k&n+ &u+ &}+ ϝ&+   2 S&@, v&T-  Þ&"X/ Ҟ&#\/ &#`/ &#d/ &$h/ $$28:1D2D3D4D5!D6>$@L$:xD:D<D="D?>DAODBeDC|DBDDDEDGDH DIDJ0DKFDLXDK|DNDPDQDRDSDTDUDV ):E:$^$ZDZD]D^D_4D^MDaTDbkDcDeDfDgDhDjDkDlDm DkDo(Dp2Dq<DrRDuhDvDwDx)ZE[$q$|@D|D~DD9DLDdDpDDDDDDD2DMDcDyDDDDDDDD-)|/$/$pDDD$&/ $lɈ DDDD,D\DD D,DJDZDZDDDDDDDDDD"D0D8D@jn2F!ZG$G@$ؤOjl jaDDD$D<DeDxDDE2F$s$\lDDDD DGDMDk[ik$m$̥jh DDD2DCDCDJD\DDDDDDDDDD$D$D5DHD_DsDDDDDD D D (D ?D SD|DDDDDE)ȐC$$ɠ$ؠ hDDD $D!<D"TD#\D(D*$D,7D-<D.SD/mD1D2D4D5D7D8D9D<D=:D?RD!XDfDAhDBmh2F h=^m$oj$FEE DFDHDJ DK DL8DM@DQDRDTDVDWDY-D[0D\@D^EDKpDJ~DbDczFhG2FHiH$$gDgDkDlDm4Dn<DpjDqDrDsDtDuDlDkDwDxzghh2Fi$$}ؠ{{ h{j{||| D}DD0D>DDDODoDtDDDDDDDDDDD<DBDdDuDDE}$$8ؠj DDD2D>DtDDDE$Ρ$ܯjlDDD4D:xiڡ:$<$hɈ DDD D6D]DDDDDD D(DADGDyDDDDtDDDDDDDD4DKDLDbg$g$DDD'D@DYDrDDDDDDDE $ $/DDDDD"D ,D JD cD nD DDDDDDDD:DCDYDrDDDD!D"D#D$ D%,D&8D'CD(ND+fD,D-D.D/D0D3D4D5D#D"&D7(D8>D9hD:nD;D<D>D?D@;j9ȐIlDEM2F$W$DqCDDDF DGDH(DI4DL\DMtDNDPDQD$i$U(qTyT DUDX DYDZ8D\D]D^DaDbDcDdDfDgDkDmDo Dp7Dq@DYFDsPDtUUUiVU$W$xjwDxDy D{D|D}D D(D4D<DED`DhDnDtDDDDDDDDD DDD!D6DVD`DdDyDDDx$$8 jljDDD$D@DcDvDDE2F$ʢ$DD D D=DZDxDDDDD+DLDpDDDD3D8DTDXDtDxDDDDDD#D8DODfDtDDDDDDDD(D>DTDjDDDDDDDD(D>DTDjDDDDDDD D$D ED D DDDDDD2DTD}DDDDD D+DHD^D|D!DD$D%D( D) D*9 D+Z D-v D D, D+ D/ D1 D2 D19 D4P D6g D7 D6 D: D; D< D=9 D? D@ DA DB DC DD DE DF! DG7 DIM DJc DK DL DM DN DO DP DQ( DOH DSX DTn DV DW DY DZ D; DUDT$D\4D]KD^dD]D`DbDcDdDeDdDf$Dh:DiPDjlDiDkDlޢ2F$$qdDqDrDs$dd%d9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:mb/9& / ^&@3 )&; Z& F ӣ , - . / 0 11 2D 3W 4e 5w 6 7 8 9 :ʤ ;ۤ < = > ? C) D7 FG&MM S&NM d$ihhDiDkDlDm5Dk@DoLDp_Dqdqid$f$utDuDvDwDx!Dy=$?$},D}D~D(DJD`DvDDDD$$DDDD2DHD^DtDDDDDDD&D<DRDhD~DDDD$ԥ$DDDDDDDD.DID_DuDDDDDDDD%D;DDD`DiDDDDDDDDD"D5DKDUDkDuDDDDDDD DD3DIDSDiDDDDDDDD D6D?DWDsDDDDDDDD,DCDYDoDDDDDDDD$D:DPD fD |D D D DDDDD,DBDXDnDDDDDD!D" D$% D%; D'Q D(g D)} D+ D, D- D+ D/ D0 D2 D5 D6 D8 D9 D:0 D;M D<j D= D< D> D? D@ D? DA DB. DCD DFD DGZ DHp DI DJ DK DL DM DN DO DQ DT DV DW DX DY DZ D[4 D]K D^g D_} D` Da E5 D $ $glfDgDiDj DkDl&Dj1Dm@DnEgE$G$rlqq Xmq qqDrDsDt Du"Dv;DwHDxQDzlD|D}D~D$s&M $e DDDDD1DDDjDDDDDDDDD&D,DDDZDdDz2F|$|æ$lXm ҦDDDD4DZDtDDDDDDDDE2F$ݦ$,DD DD&D<DRDhD~DDDDDDDD.DkDDDDDDDDD0D8DHD^DhDxDDDDDDDDDDDD,DBDXDnDDDIl2Fh$7$GDDDD3DaDpDD D D DDD>D\D{DDDDDDDD$ Q$![ D!D#D%D&(D'AD%CD(LD)zE!z$|`$-|,D-D0D1D2D3(D49D5JD6\D5lD7xD8D1D: -p.$$>=D>D?D@DA$DB2DC;DDEDFO$Q$JhhIDJDKDLDODP>DR@DSQDXTDYeD\vD]}$$ah`DaDbDd)DfDDgPDjDk$$oxhnDoDz D{D|D~DDDDDDio$$PhDDDD(D2DFDODgDqD{DDDD$ǧ$DDD2DLDnDDDDDDD%D8DNlاELP$P$l DDDD"D0DCDXDaDDDDDDDDD DNDfD|DDDDD#D@D\DrDDDDDDDD$D+DZDyDDDDD#D(DGDDD D D6D[DqDDDDDD BD!VD"XD#wD$D'#$#$+$** *D+D/D1D2D31D4LD5aD6jD7uD8D9D:D;D>D@DA DC,DEfDF~DGDHDJDMDQbDR~DSDTDVDWDXDYDZ$D[@D]VD^]D_sDazDbDdDeDgDiDm4Dn:DoSDqXDrhDtDul++2+C-/$V$yxlx DyD{D|(D}4D{6D~LDXD`DDDDDD#D3DCDSDcDsDDvy~y$$X DDDD)D0D?DJDXDdD}DDDDDDDnDDDDDDDDDD.DZDvDDDDD,D@DVDdDDDDDDD$$4DDDD,DCDXDrDDDDDDDDDDDD$ &$&$\DDDD'D8DHDXDcDeDt t$vŨ$ ۨ  DDDD!D4DGDXDcDeDt t$v$ LD D"D$D%(D':D)\D*sD+D,D.D/D2D5D6 $$:09D:D;D<D=!D>.D?8D@J$L$D|CDDDGDHDJ8DKDDLTDMgDPDQDSDUDVDW DUDX$DY/DG1D[DD\I DDEI$K $cbDcDeDhDiDj'Dm4DnDDoWDrwDsDuDxDzD{$Dz\D}lD~wDhyDD ccde$5$\hDD D D-D0D=D\DtDDoi$F$hDDD$D1D8DEDDDDoi$\$hDDDD,DTD`DpDDD DLDtDDDDD(D4D@D\DDDDDDoi$n$hDDDD$D<DdDpDDD0DD8DDD|DD TDxDDD D#D$D&"D%,D$hD(xD)oi$$,@h+D,D-D.D1;D/PD4\D5n$p$;:j: D;D<D=D>(D?1DA\DBr$tͩ$L$ީKK jKDLDODP$DQ/DS:DT`DUDVDWDYLDZD[$D\D]D^hD_D`@DaDbDcDdDe\DfDg4DhDi DjxDmDnDo Dp Ds DuF Dv\ Dx Dz D{ D~ D D D" D8 DC D[ Dg Dz D D D D D D D D9 D@ Di D| D D D D D D& DG DL Du D D D D D D D2 DS DX D D D D D D D+D>D_DdDDDDDD DD-D@DaDDDDDDDDD-D@DdDlDDDDDDDD D:DPDYDbD|DDDDDDDDNDoDxDDDDDDDDD D -D HD rD DDDDDDDD#D0DCDLDmDDDDDD D#D$D%D&5D2ND3aD5tD7D'D)D*D+D,D- D.D00D&JD9`D:mD;D<D=D>D?D@DBDC$DD<DQZDRmDEtDFDGDHDIDJ DKIDLjDMDNDDDSDTDUDVDWDX DY#DZ5D[HD\bD]dDUwD_DaDcD`D_DeDfDgDhDi/DkBDlODm\DneDoxDpDrDsDtDuDvDwDxDyDz$D|HD}iD~|DDDDDDDD&D@DZD_DpDDDDDDD:DPDcDyDDDDDD,D?D`D|DDDDDDDDDD,D?DLD_DrD|DDDDDDDDD D1 DD DW Dj D} D D D D D D D!D#!D@!De!Dl!D!D!D!D!D!D!D!D!D"D"DP"D"D"D"D"D"D"D#D!#D8#D?#DR#De#Dx#D#D#D#D#D#D#D$D$D+$D>$DQ$Dd$Dw$D$D$D$D$D$D$D$D%D "%D 5%D<%De%Dx%D%D%D%D%D&D"&D+&DL&Dl&D&D&D&D &D!&D-&D.'D" 'D$&'D%,'D&?'D'`'D(v'D)'D+'D!'D/'D0'D1 (D2(D3,(D4C(D5U(D6h(D7(D8(D0(D:(D<(D>(D;(D:(DA(DB-)DC@)DFH)DGQ)DHd)DIw)DJ|)DL)DO)DP)DQ*DRQ*DUX*DVb*DWu*DX|*DZ*D\*D]*D^*D_+Da+Dc8+DdK+De^+Dfy+Dg+Dh+Di+Dj+Dk+Dl+Dm+Do ,Dr,Ds,Dw-,DyH,D|Z,D}m,Dzt,Dy,D,D,D,D-D-D0-D8-DB-Dd-D-D-D-D-D-D-D9.DK.DP.D].Dp.D~.D.D.D.D.D.D.D.D.D.D/D/D$/oiLEM2FM$/$&/$L>ީ hjDDD%D+D@D\DoDuDDDDDDDDD DD/DXDDDDDDD DDDJDeDoDDDDDDDDDDDDTD]DdDDDD)D BD bDDIl$$Bީh jDD DD5DODjDpDDDD!D"D#D%D&D'/D(FD*YD+r,t$t;$/\Dh.D/D0D15D2@D3HD4PD6tD7y${L$;Dh:j: D;D<D=D>(D?r$t[ *f *q *| * * + @ Eժ(IV (JV (KV  (KV (KV &(LV 2(LV dLEdLE>dLE9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:bH&!N ǫ&"N ԫ$(LEjl'D(D)D*D++D-5D.N$P$2EH1l1 D2D3D4D6$D7-D;UD<]D=e$g$AFH@DADBDE,$.$I4FjHDIDKDLDM$DK&DN4DODDPNDQYDRaIa$c!$VFjUDVDX DY DZ,D[7D]HD^TDXVD`lV0Vn$n;$dGcDdDgDi Dj+Dl4DmDDnPDopDqDlDsDtDuDvDwDxDydlexie$J$}Gjl|j| D}DDD@DGDXDdDqDwDDDDDDDDDDDD*D4}0}2F~6$6[$$Ijlj DDDD<DCDTD`DrDtDDDDDDDDDDD D,D@DFDTD_DaDxD~DDDDDDDDDD#02F%$%k$LK{ DDD DD(D3DQDXDhDm[iim$o$K jDD D(DXD|DDDHDD DDDdDD<DDDDDXDD0DDDtDDD D D$ D/ DF DH Dr D  D  D  D  D D D D D DA DH D D D D D D D) Dh D  D! D# D$ D% D& D# D($ D)1 D*D D+L D, D1 D2 D- D. D/ D, D4 D5] D7d D8 D; D< D> D? DADBADDHDEDFDGDI DJ#DK6DLMDNTDOTDPsDQDRDSDTDUDPDWDXDYD\"D]5DZ<DYfD^tD_D`DaDbDcDdDeDfDg0DhHDi`DjxDlDmDnDoDpDqDr Ds8DtTDvpDyoiE2F(dNNT$Ӭ$}H^|| j|D}DDD,D>$@(V (V (V ( ,W d^d^d^9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:b($"^!j! D"D%D& D'"D)(D*3D+>D8dD9{D<D=D@DBDCDDDEDFDGDI2DL8DNLDOlDQDNDRDSDTDUDWDXDYDZ%D[>D\@D]VD^lD_D`DaDbDcDdDeDf*Dg@DhVDilDjDkDlDmDnDoDpDq+DrHDs^DtDuDvDxDyDqD{D}&D~0DLDDD~DDDDDD>DKDaDwDDDDDDDDoi"E#2F#$:$leDDDDXDtDDD$J$ fZ DDDDD(Dr$tf$fj DDD DD(D>DODcDw$yy$fDD D D<D\DjDDDDDD(D4DJD`DDDDDDDDD D6DLD`DwDDDDDDD3DID_DDDDD D D D 0D PD \DrDDDDDDD D6DLD`DwEy$y$ xlhD D!D"D'lD(uD)D*D-D.D1D4D;D?@D@E$Gdndnѭdn9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:`vڭ-1=B/GEL\QqWcm%FɮR^'>Unӯ":svSb .$$n#D$D&D'D(#D):D&<D+H@$J$JR$/ o_.j. D/D1 D2(D3LD5`D6eu/~/8e$g$:toD:D<D=D@XD<fDAt:v$v$EoDEDJ DKDM8DNVDO}DPDQDRDUDVDY3D[GD]LD^|D_D`DaDbDdDfDhDjDkDlDjDn$Do*DqFDsKDtgDuvDvDwDxDyDzD{D}DDDDD3D8DPD`DbDtD}DDDDDDDDD DD$D=DTDcDhDxDDDDDDDDD.D?DKD\DuDDDDEEEFGHc$²$uDDD8D\DrDtDkղlݲ$$@vhDDD)D<DIDVDdDiEi$k (@W dvdvdv9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:b ' 6 E U&N _& N i&$N y$!vjl  D!D"D# D$9D";D%DD&PD'bD({D)E!$$-Hwjl,D-D.D/ D09D.>D1HD2`D3yD1{D4D5D6D7D8E-$$<x;D<D>D? D@8DAbD?dDBlDCwDDwDEDFDHDIDJDKD>DLDMDN0DOZDM\DLcDVlDWDXDYDZD[D\DVD^D_D`"E<2F<dzCw)$)$dDzjlcDdDeDf Dg9DeZDhdDiiEdi$k$mzljl DmDnDoDp.Dq>DrQ$S$v{uDvDwD~XDvDDDDDDDDD$$|. 9DDDD3DADDDDD DD=DDDcDvD|DDDDDDD0D=DPDlDyDDDDDU$_$~. nzdDD DD'DDDDDD/DJD]DpDwD|DDDDDDDDD.DKDPDcDDDDDDDDDD)D<DODfDnDDDDDDD D D .D 55$7$.q ŴҴߴDDDD)D0D?DLDYDrD D"D#D$D&D'D(D*$D+/D-TD/\D0lD1uD3D4D5D6D7D8D:D;D<#D=(D?:DA@DBPDDDEDFDGDIDJDKDLDM'DN:DPHDRPDSaDTsDUDVDWDZD[D\+D]AD^TD_bDbhDcDeDfDgDiDjDk"Db,Dm@DnIDo\DqDtDuDvDxDzDD|E&(N $% J(`W o(`g ~(`w ddd9<Hr0,V1VK+R+=7[++cV +b+-5++4<j9993P'f']:b&!,N &"0N $)h(D)D+D,D-:D/QD+SD1`D3{D4D5D6D7D8)$/$<{;@; D<D>D?D@(DBBDCTDDtDCDBDEDF;j<Ej<$L$JXIDJDKDL$^$PtmODPDRDSDT5DR<DVHDWMPM$Ow$[ĊZD[D]D^D_7D]ADaPDbeDcj[j$l$g0njff ifDgDhDkDl)Dm<DnGDoRDp_DrwDsDvDwDyDzD{D|D}D-D9DEDQD^DsDDlDDDjgnhxji[ii$$h DDDD$D,D7DBDVDlDDDDDDDDDDD3DJDWDtDDDDDDDDʶ;jEjնjn$޶$h DDD+D8DDDRDnDyDDDDDʶն$$h DDD%D0D<DJDhDqDDDDDDDDDʶն$$iDDD DDD D8DDDZDlDDDDDDDDDD;jEj[ii$'$ 6 D D DD'D4DID^DvIl v$x@$dQɈ hDDD D D @D!ND#pD$D#DDD&D';jEj2F$^$+(l*D+D-D.D/"D1(D25D3TD4lD6D7D8D7D6D3D:E+;j+Ej+$q$> ~== ==D>D@DBDC(DD4DE@DFLDGXDHdDIDKDLDMDNDODQDRDT.DU3>3$5$YXXhX XXDYD[D] D_%D`JDaTDc`DdnDeDfDhDiDjDkDmDnYʶZ[$з$rPnjqq DrDu Dv Dw@DxcDveDusDztD|D};jrEjrs$ $h  DD D8DDDRDeDxD|DDDDDʶ,h$M$he DD DD D<D\DeDDDDDDDD(D(D(;jEjbhնd*$*q$( he DD DD D<D\DeDDDDDD/D:D:D<;jEjbhնd>$>$he ȸDD DD8DAD`DuDDDDDDDD/D4DXDeDDDDDDDDDCDSD`DnDnDp;jEjbhնdڸ`/r$r$ܜɈ h DDD D D@DNDsD}DDDDDDDDDD#D)D4D;DHDVDXD];jEj2F,}]$_5$<hDD D D 3D HD XDdDoDzDDD$H$hW DD DD$D;D AD"TD$ZD%cD&hD'm,am$oj$,th*W* *D,D/ D14D3@D4RD5hD6xD7D8D;D<D=D>D?#D@6DBNDCdDDD<DFDG~,,,E-i-$$K4J>J DKDMDNDO%DM7DPDDQMDRRȐKR$T$VdhUDVDXDYDZ:D\RDXTD^`D_pD`{DaDbV$$fmeDfDhDiDj5Dh<DlHDmMfM$O dCdD˹dD9<Hr0,V1V<$7 R+=[++cV+a+-5++4<j9993P'f'dDdDԹdD9<Hr0,V1V߹R+=7[++cV +b+-5++4<j993+,1%t; L&`N $DDD! D#D$D%D&D'D)D*D+D,D-D/D0D1ND9PD:\D;D=D>D?DBDCDFDLDM$$Q(PDQDS DTDV$DX9DYLDZmD[yD]D^D`Da3DbXDi?Dk]DXbDmpDsDtEQQ$$xDxDyDz#$%ǽ$~D~DD$!ؽ ddd9<Hr0,V1V<$7 93[P'f'߹R+=++cV+a+-5++4<j99c$d DD D DLD dD!pD"uE(dw$w0d$&|>d%Id% Vd%D&D*D+D, D-%D.-D/DD0SD1Xbd&'X$Z-$5اD5D9D:bd5$=$>D>D@DADBDCDE!DF'DIIDKRDLoDMDNDPDQDSDT#DU=DWHDXRDY\DZbD\D]D^D`DaDbDdDeDhDimDjDkDlDmDnDo Dp,Dq8Dw?Dx]bd>]$_K$|P]{D|D}DD8DSD]DlD|DDDDDg|h}$q$<DDD D%%$'(` dcdddd9<Hr0,V1V߹R+=7[++cV +b+-5++4<j99¾ Ӿ    &N #&N .$dDD D!D",D#2D$7$9@$(D(D)D*!$#R$.ĬD.D/D0$g$4ج~3v3 D4D6D8D9,D:mD;zD<D=DCDDDED>DA D=DF(DG.DH0DL:DMCDNHDPQDQaDRqDSDUDVDWDXE4$$\D\D]D^D_2D`7Da<$>$lkDlDmDoDpDqDrDsD}`D~vDDDDDDDDDDDD D0DB$D$jlDDDnDDDD0DHD`DxDDDDDDD$ſ$ ׿ DDDDD0D>DPD`DqDDDDDDDDE$$׿DDD$$׿ DDDD!$!(` d9d<1d<9<Hr0,V1V߹R+=7[++cV +b+-5++4<j99< L [ h&N &N &N &N &N &N &N $7<6D7D9D:D;(D:FD<TD=dD>xD=D?D@DAD@DBDCDDDC6DEDDFT7V$V$JIDJDKDMDN#DO+DP4DQ4DRKDS\DRqDT|DUDVDWDXP4$ $\@D\D^D`"Db(Dc-2\-$/;$gpDgDiDj'Dk,K&gN V(h` ,$.v$o>dnn nDoDqDt(DwxDyDzD{DyD| D}o$$DDDDLDoDuD$$@DDDD>DJD\DDD$$DDD DDDJDXDiDzD$$xDDDD5D<DLD\DwDDDD$$$ DDD$DBDNDWW$Y$-7 @dDDD DD/DMDDDDDD DBDNDpDDJ$U$-7 @dDDDD'DEDcc$ef$u DD D$D +D HD _D fD hDpDvD{DDDDDDDDDDD2F$$$"h!u! !D"D$ D&D'4D(?D*TD+lD,zD.D0D1"$$54u4 4D5D9D:D;1D=<D>ED?ZD@tDAxDBD9DD5677$ $HԿDHDLDM DN8DOHDRvDT|DVDXDZD[DMDLD]D^HIJ$;$bKaDbDd DeDf,DgIDeKDiXDk`DlsDm|DdDoDpTb]bfbob$w$tss DtDwDxDy#Dz@D{]D|cD~hDqDDDDyDwDDDDDDDD DTt]tftt$$DDD D0D:DHDWD_DpDDDDDDD2$$lDD DD/D5DTDZDhDxD$$DDD$D7D=DFDLDPDYDdDi'i$k/$pK: DOZDDD,DLDhDDDD2$f$<DDD,DDDLDaDdDyD|DDDDDDDDDDDDD-$/t$lDDDDD(D/D=DQ$S$DDDD(D 1D JD cDzDDDD#DDDaDhDDD D!D"D#D!D$D%D'D(D)&D &D+4D,DD-PD.YD/dD1lD2D3D1D5D6D7D5D9D=D:D;D9DD@0DACDBcDCtDBDDDEDGDHDIDKDL%&$$PODPDSDTDU3DVJDXdDYqDZD[DZD\D^D`Dc Dd)De)Df@DgTDfiDktDlDnDoDpDqDrDsDuDvDxDzD|D}D~&Dw,D8D?DHDWDaDuD~DDDDDDDDDDDDD%D5D@DTD]DmDxDDDDDDDDDDD4DdDmDyDDDDDDDDDDD DPDDDDDDDDDDD4D=DFDOD[DgDDDDPPPPQd)$$DDDD&D<DJD`DiDpDDDDDDDD D D DD"D2DHD^DtD2$( dd*d9<Hr0,V1V߹R+=7[++cV +b+-5++4<j995g"|&$N $('' D(D)D*'D+0D,K$M$0d/D0D1D2D:4D<@D=YD>bD?uDADBDCDDDFDHDIDJDKDL!DM*DN4DP<DQODShDTxDU}$$YXDYDZD[D\5DZ?D]LD^kD_D`DaDbD`DcDdDeDfDgDjDkYE__$$o nDoDpDqDsDt%Du<DvPDumDwxox$z${dzz D{D}DD0DMDTDhD{DDDDDDD{|0}$9$LLU DDD!D&^&$(g$tDDDD,DDD\DDDDDDDDD DD3DTD^D`DnD~Dz^$$ DDDD D4D;DLDcDjDlDxD~DDDDDDDDDDDDD z $$DDDD4DODXD vD D D DDDDDD $$,DDDD%D0DFDiDD$$# "D#D%D'(D(/D*LD,vD.D0D:D;D<#$$@?? ??D@DCDDDE+DFLDHyDIDJDKDLDHDNDODPDQDRDS DT'DU3DV;@A;$=$$ZDZD]D^ D` Da6Db;DdQDe_DgdDhmDiDjDkDlDmDnDmDpDqDrZ$6 ddLd9<Hr0,V1V߹R+=7[++cV +b+-5++4<j99U$+*D+D.D0D1D2!D34D4KD5YD6`D7{D8D9D:D;BD=nD>~D?D@D?DBDCDD(DFADHNDIdDHyDK|DL+,,$$PODPDS DTDU$DW6DXJDYPD[VD\XD]D^D`PQ$$dHDdDgDhDi(Dj?DkXDmqDn~DhDqdddEe$(% '(& G(' ddid9<Hr0,V1V߹R+=7[++cV +b+-5++4<j99t&N $DDD$D,D@DIDUD^DdDhD qD!D"@d$$&%D&D(D*D+-D-4D.MD/fD0x&x$z$43D4D5D74D9\D:uD;D<D=D?D@DADBDCDEDFDG DHDI&DJ6DK<DMDDN]DOeDQhDRDSD]D^D_DaDbDdDeDgDhDi Dj)Dm?Dn\4\$^$r`>dqq DrDw DyDz#D{7D|KD~PD~DDDDDDDDDDDD6D<DDDJDPDnDtD}DDDDDDDDDDrrstuuu$$>d DDDD$D.D6$8!$DDDD!D3D@DJD[DkDxDDDDDDDDD D<DPDdDDDDDDDD+D0D\DoDDDDD DD)D,D6DIDdDiDDDD D D ,DCDVD\DxDDD#DDD'4D(PD)]D*fD+vD,|D-D.D0D2D3D4D5D6D7 D:D< D=&D'/DC5DEXDF_2:C_$addLd9<Hr0,V1V߹R+=7[++cV +b+-5++4<j99W&N $DDD D!1D"7D#HD_D%lD&qq$s$*)D*D-D.D/1D1<D2BD3RD4gD6}D7D8D9D;D<D=D>*+$ $B|DBDCDDDE2$4$I3HH DIDJDLDMDN)DO3DPFDRPDS^$`E$WiVRV \VDWDYDZD[(D]1D^6fW6$8n$bHaDbDdDfDg$Dh0Di<DjHDlTDmYfbY$[}$qpDqDsDtDu'Dv@DwYDx^'q^$`$|{{ D|D}D~D4DLDDDDD$$  DDDD4DLDDDD$$>d DDD DD+D|DDDDDDDD$( (Ě d d 1d 9<Hr0,V1V8N\-Lby$[L@ ˔t F_q$F%*08=CK%S<[TB{G$!   D!D"D#"$'d3init.c/usr/src/build/53700-i386/BUILD/glibc-2.2.4/csu/gcc2_compiled.int:t(0,1)=r(0,1);-2147483648;2147483647;char:t(0,2)=r(0,2);0;127;long int:t(0,3)=r(0,3);-2147483648;2147483647;unsigned int:t(0,4)=r(0,4);0000000000000;0037777777777;long unsigned int:t(0,5)=r(0,5);0000000000000;0037777777777;long long int:t(0,6)=@s64;r(0,6);01000000000000000000000;0777777777777777777777;long long unsigned int:t(0,7)=@s64;r(0,7);0000000000000;01777777777777777777777;short int:t(0,8)=@s16;r(0,8);-32768;32767;short unsigned int:t(0,9)=@s16;r(0,9);0;65535;signed char:t(0,10)=@s8;r(0,10);-128;127;unsigned char:t(0,11)=@s8;r(0,11);0;255;float:t(0,12)=r(0,1);4;0;double:t(0,13)=r(0,1);8;0;long double:t(0,14)=r(0,1);12;0;complex int:t(0,15)=s8real:(0,1),0,32;imag:(0,1),32,32;;complex float:t(0,16)=r(0,16);8;0;complex double:t(0,17)=r(0,17);16;0;complex long double:t(0,18)=r(0,18);24;0;__builtin_va_list:t(0,19)=*(0,20)=(0,20)../include/libc-symbols.h/usr/src/build/53700-i386/BUILD/glibc-2.2.4/build-i386-linux/config.h../sysdeps/gnu/_G_config.h../sysdeps/unix/sysv/linux/bits/types.h../include/features.h../include/sys/cdefs.h../misc/sys/cdefs.h/usr/lib/gcc-lib/i386-redhat-linux/2.96/include/stddef.hsize_t:t(8,1)=(0,4)__u_char:t(4,1)=(0,11)__u_short:t(4,2)=(0,9)__u_int:t(4,3)=(0,4)__u_long:t(4,4)=(0,5)__u_quad_t:t(4,5)=(0,7)__quad_t:t(4,6)=(0,6)__int8_t:t(4,7)=(0,10)__uint8_t:t(4,8)=(0,11)__int16_t:t(4,9)=(0,8)__uint16_t:t(4,10)=(0,9)__int32_t:t(4,11)=(0,1)__uint32_t:t(4,12)=(0,4)__int64_t:t(4,13)=(0,6)__uint64_t:t(4,14)=(0,7)__qaddr_t:t(4,15)=(4,16)=*(4,6)__dev_t:t(4,17)=(4,5)__uid_t:t(4,18)=(4,3)__gid_t:t(4,19)=(4,3)__ino_t:t(4,20)=(4,4)__mode_t:t(4,21)=(4,3)__nlink_t:t(4,22)=(4,3)__off_t:t(4,23)=(0,3)__loff_t:t(4,24)=(4,6)__pid_t:t(4,25)=(0,1)__ssize_t:t(4,26)=(0,1)__rlim_t:t(4,27)=(4,4)__rlim64_t:t(4,28)=(4,5)__id_t:t(4,29)=(4,3)__fsid_t:t(4,30)=(4,31)=s8__val:(4,32)=ar(4,33)=r(4,33);0000000000000;0037777777777;;0;1;(0,1),0,64;;__daddr_t:t(4,34)=(0,1)__caddr_t:t(4,35)=(4,36)=*(0,2)__time_t:t(4,37)=(0,3)__useconds_t:t(4,38)=(0,4)__suseconds_t:t(4,39)=(0,3)__swblk_t:t(4,40)=(0,3)__clock_t:t(4,41)=(0,3)__clockid_t:t(4,42)=(0,1)__timer_t:t(4,43)=(0,1)__key_t:t(4,44)=(0,1)__ipc_pid_t:t(4,45)=(0,9)__blksize_t:t(4,46)=(0,3)__blkcnt_t:t(4,47)=(0,3)__blkcnt64_t:t(4,48)=(4,6)__fsblkcnt_t:t(4,49)=(4,4)__fsblkcnt64_t:t(4,50)=(4,5)__fsfilcnt_t:t(4,51)=(4,4)__fsfilcnt64_t:t(4,52)=(4,5)__ino64_t:t(4,53)=(4,5)__off64_t:t(4,54)=(4,24)__t_scalar_t:t(4,55)=(0,3)__t_uscalar_t:t(4,56)=(0,5)__intptr_t:t(4,57)=(0,1)__socklen_t:t(4,58)=(0,4)../linuxthreads/sysdeps/pthread/bits/pthreadtypes.h../sysdeps/unix/sysv/linux/bits/sched.h__sched_param:T(10,1)=s4__sched_priority:(0,1),0,32;;_pthread_fastlock:T(9,1)=s8__status:(0,3),0,32;__spinlock:(0,1),32,32;;_pthread_descr:t(9,2)=(9,3)=*(9,4)=xs_pthread_descr_struct:__pthread_attr_s:T(9,5)=s36__detachstate:(0,1),0,32;__schedpolicy:(0,1),32,32;__schedparam:(10,1),64,32;__inheritsched:(0,1),96,32;__scope:(0,1),128,32;__guardsize:(8,1),160,32;__stackaddr_set:(0,1),192,32;__stackaddr:(0,19),224,32;__stacksize:(8,1),256,32;;pthread_attr_t:t(9,6)=(9,5)pthread_cond_t:t(9,7)=(9,8)=s12__c_lock:(9,1),0,64;__c_waiting:(9,2),64,32;;pthread_condattr_t:t(9,9)=(9,10)=s4__dummy:(0,1),0,32;;pthread_key_t:t(9,11)=(0,4)pthread_mutex_t:t(9,12)=(9,13)=s24__m_reserved:(0,1),0,32;__m_count:(0,1),32,32;__m_owner:(9,2),64,32;__m_kind:(0,1),96,32;__m_lock:(9,1),128,64;;pthread_mutexattr_t:t(9,14)=(9,15)=s4__mutexkind:(0,1),0,32;;pthread_once_t:t(9,16)=(0,1)_pthread_rwlock_t:T(9,17)=s32__rw_lock:(9,1),0,64;__rw_readers:(0,1),64,32;__rw_writer:(9,2),96,32;__rw_read_waiting:(9,2),128,32;__rw_write_waiting:(9,2),160,32;__rw_kind:(0,1),192,32;__rw_pshared:(0,1),224,32;;pthread_rwlock_t:t(9,18)=(9,17)pthread_rwlockattr_t:t(9,19)=(9,20)=s8__lockkind:(0,1),0,32;__pshared:(0,1),32,32;;pthread_spinlock_t:t(9,21)=(0,1)pthread_barrier_t:t(9,22)=(9,23)=s20__ba_lock:(9,1),0,64;__ba_required:(0,1),64,32;__ba_present:(0,1),96,32;__ba_waiting:(9,2),128,32;;pthread_barrierattr_t:t(9,24)=(9,25)=s4__pshared:(0,1),0,32;;pthread_t:t(9,26)=(0,5)wchar_t:t(11,1)=(0,3)wint_t:t(11,2)=(0,4)../include/wchar.h../wcsmbs/wchar.h../sysdeps/unix/sysv/linux/i386/bits/wchar.h__mbstate_t:t(13,1)=(13,2)=s8__count:(0,1),0,32;__value:(13,3)=u4__wch:(11,2),0,32;__wchb:(13,4)=ar(4,33);0;3;(0,2),0,32;;,32,32;;_G_fpos_t:t(3,1)=(3,2)=s12__pos:(4,23),0,32;__state:(13,1),32,64;;_G_fpos64_t:t(3,3)=(3,4)=s16__pos:(4,54),0,64;__state:(13,1),64,64;;../include/gconv.h../iconv/gconv.h :T(17,1)=e__GCONV_OK:0,__GCONV_NOCONV:1,__GCONV_NODB:2,__GCONV_NOMEM:3,__GCONV_EMPTY_INPUT:4,__GCONV_FULL_OUTPUT:5,__GCONV_ILLEGAL_INPUT:6,__GCONV_INCOMPLETE_INPUT:7,__GCONV_ILLEGAL_DESCRIPTOR:8,__GCONV_INTERNAL_ERROR:9,; :T(17,2)=e__GCONV_IS_LAST:1,__GCONV_IGNORE_ERRORS:2,;__gconv_fct:t(17,3)=(17,4)=*(17,5)=f(0,1)__gconv_init_fct:t(17,6)=(17,7)=*(17,8)=f(0,1)__gconv_end_fct:t(17,9)=(17,10)=*(17,11)=f(0,20)__gconv_trans_fct:t(17,12)=(17,13)=*(17,14)=f(0,1)__gconv_trans_context_fct:t(17,15)=(17,16)=*(17,17)=f(0,1)__gconv_trans_query_fct:t(17,18)=(17,19)=*(17,20)=f(0,1)__gconv_trans_init_fct:t(17,21)=(17,22)=*(17,23)=f(0,1)__gconv_trans_end_fct:t(17,24)=(17,25)=*(17,26)=f(0,20)__gconv_trans_data:T(17,27)=s20__trans_fct:(17,12),0,32;__trans_context_fct:(17,15),32,32;__trans_end_fct:(17,24),64,32;__data:(0,19),96,32;__next:(17,28)=*(17,27),128,32;;__gconv_step:T(17,29)=s56__shlib_handle:(17,30)=*(17,31)=xs__gconv_loaded_object:,0,32;__modname:(17,32)=*(0,2),32,32;__counter:(0,1),64,32;__from_name:(4,36),96,32;__to_name:(4,36),128,32;__fct:(17,3),160,32;__init_fct:(17,6),192,32;__end_fct:(17,9),224,32;__min_needed_from:(0,1),256,32;__max_needed_from:(0,1),288,32;__min_needed_to:(0,1),320,32;__max_needed_to:(0,1),352,32;__stateful:(0,1),384,32;__data:(0,19),416,32;;__gconv_step_data:T(17,33)=s36__outbuf:(17,34)=*(0,11),0,32;__outbufend:(17,34),32,32;__flags:(0,1),64,32;__invocation_counter:(0,1),96,32;__internal_use:(0,1),128,32;__statep:(17,35)=*(13,1),160,32;__state:(13,1),192,64;__trans:(17,28),256,32;;__gconv_info:T(17,36)=s8__nsteps:(8,1),0,32;__steps:(17,37)=*(17,29),32,32;__data:(17,38)=ar(4,33);0;-1;(17,33),64,0;;__gconv_t:t(17,39)=(17,40)=*(17,36)_G_iconv_t:t(3,5)=(3,6)=u44__cd:(17,36),0,64;__combined:(3,7)=s44__cd:(17,36),0,64;__data:(17,33),64,288;;,0,352;;_G_int16_t:t(3,8)=(0,8)_G_int32_t:t(3,9)=(0,1)_G_uint16_t:t(3,10)=(0,9)_G_uint32_t:t(3,11)=(0,4)_IO_stdin_used:G(0,1)/scratch/CPORspin/Src3.2v4/y.tab.cyyrcsid:S(0,21)=ar(0,22)=r(0,22);0000000000000;0037777777777;;0;74;(0,2)/usr/include/stdlib.h/usr/include/features.h/usr/include/sys/cdefs.h/usr/include/gnu/stubs.hsize_t:t(5,1)=(0,4)wchar_t:t(5,2)=(0,3)div_t:t(1,1)=(1,2)=s8quot:(0,1),0,32;rem:(0,1),32,32;;ldiv_t:t(1,3)=(1,4)=s8quot:(0,3),0,32;rem:(0,3),32,32;;/usr/include/sys/types.h/usr/include/bits/types.h__u_char:t(8,1)=(0,11)__u_short:t(8,2)=(0,9)__u_int:t(8,3)=(0,4)__u_long:t(8,4)=(0,5)__u_quad_t:t(8,5)=(0,7)__quad_t:t(8,6)=(0,6)__int8_t:t(8,7)=(0,10)__uint8_t:t(8,8)=(0,11)__int16_t:t(8,9)=(0,8)__uint16_t:t(8,10)=(0,9)__int32_t:t(8,11)=(0,1)__uint32_t:t(8,12)=(0,4)__int64_t:t(8,13)=(0,6)__uint64_t:t(8,14)=(0,7)__qaddr_t:t(8,15)=(8,16)=*(8,6)__dev_t:t(8,17)=(8,5)__uid_t:t(8,18)=(8,3)__gid_t:t(8,19)=(8,3)__ino_t:t(8,20)=(8,4)__mode_t:t(8,21)=(8,3)__nlink_t:t(8,22)=(8,3)__off_t:t(8,23)=(0,3)__loff_t:t(8,24)=(8,6)__pid_t:t(8,25)=(0,1)__ssize_t:t(8,26)=(0,1)__rlim_t:t(8,27)=(8,4)__rlim64_t:t(8,28)=(8,5)__id_t:t(8,29)=(8,3)__fsid_t:t(8,30)=(8,31)=s8__val:(8,32)=ar(0,22);0;1;(0,1),0,64;;__daddr_t:t(8,33)=(0,1)__caddr_t:t(8,34)=(8,35)=*(0,2)__time_t:t(8,36)=(0,3)__useconds_t:t(8,37)=(0,4)__suseconds_t:t(8,38)=(0,3)__swblk_t:t(8,39)=(0,3)__clock_t:t(8,40)=(0,3)__clockid_t:t(8,41)=(0,1)__timer_t:t(8,42)=(0,1)__key_t:t(8,43)=(0,1)__ipc_pid_t:t(8,44)=(0,9)__blksize_t:t(8,45)=(0,3)__blkcnt_t:t(8,46)=(0,3)__blkcnt64_t:t(8,47)=(8,6)__fsblkcnt_t:t(8,48)=(8,4)__fsblkcnt64_t:t(8,49)=(8,5)__fsfilcnt_t:t(8,50)=(8,4)__fsfilcnt64_t:t(8,51)=(8,5)__ino64_t:t(8,52)=(8,5)__off64_t:t(8,53)=(8,24)__t_scalar_t:t(8,54)=(0,3)__t_uscalar_t:t(8,55)=(0,5)__intptr_t:t(8,56)=(0,1)__socklen_t:t(8,57)=(0,4)/usr/include/bits/pthreadtypes.h/usr/include/bits/sched.h__sched_param:T(12,1)=s4__sched_priority:(0,1),0,32;;_pthread_fastlock:T(11,1)=s8__status:(0,3),0,32;__spinlock:(0,1),32,32;;_pthread_descr:t(11,2)=(11,3)=*(11,4)=xs_pthread_descr_struct:__pthread_attr_s:T(11,5)=s36__detachstate:(0,1),0,32;__schedpolicy:(0,1),32,32;__schedparam:(12,1),64,32;__inheritsched:(0,1),96,32;__scope:(0,1),128,32;__guardsize:(5,1),160,32;__stackaddr_set:(0,1),192,32;__stackaddr:(0,19),224,32;__stacksize:(5,1),256,32;;pthread_attr_t:t(11,6)=(11,5)pthread_cond_t:t(11,7)=(11,8)=s12__c_lock:(11,1),0,64;__c_waiting:(11,2),64,32;;pthread_condattr_t:t(11,9)=(11,10)=s4__dummy:(0,1),0,32;;pthread_key_t:t(11,11)=(0,4)pthread_mutex_t:t(11,12)=(11,13)=s24__m_reserved:(0,1),0,32;__m_count:(0,1),32,32;__m_owner:(11,2),64,32;__m_kind:(0,1),96,32;__m_lock:(11,1),128,64;;pthread_mutexattr_t:t(11,14)=(11,15)=s4__mutexkind:(0,1),0,32;;pthread_once_t:t(11,16)=(0,1)pthread_t:t(11,17)=(0,5)u_char:t(6,1)=(8,1)u_short:t(6,2)=(8,2)u_int:t(6,3)=(8,3)u_long:t(6,4)=(8,4)quad_t:t(6,5)=(8,6)u_quad_t:t(6,6)=(8,5)fsid_t:t(6,7)=(8,30)loff_t:t(6,8)=(8,24)ino_t:t(6,9)=(8,20)dev_t:t(6,10)=(8,17)gid_t:t(6,11)=(8,19)mode_t:t(6,12)=(8,21)nlink_t:t(6,13)=(8,22)uid_t:t(6,14)=(8,18)off_t:t(6,15)=(8,23)pid_t:t(6,16)=(8,25)id_t:t(6,17)=(8,29)ssize_t:t(6,18)=(8,26)daddr_t:t(6,19)=(8,33)caddr_t:t(6,20)=(8,34)key_t:t(6,21)=(8,43)/usr/include/time.htime_t:t(13,1)=(8,36)clockid_t:t(13,2)=(8,41)timer_t:t(13,3)=(8,42)ulong:t(6,22)=(0,5)ushort:t(6,23)=(0,9)uint:t(6,24)=(0,4)int8_t:t(6,25)=(0,10)int16_t:t(6,26)=(0,8)int32_t:t(6,27)=(0,1)int64_t:t(6,28)=(0,6)u_int8_t:t(6,29)=(0,11)u_int16_t:t(6,30)=(0,9)u_int32_t:t(6,31)=(0,4)u_int64_t:t(6,32)=(0,7)register_t:t(6,33)=(0,1)/usr/include/endian.h/usr/include/bits/endian.h/usr/include/sys/select.h/usr/include/bits/select.h/usr/include/bits/sigset.h__sig_atomic_t:t(25,1)=(0,1)__sigset_t:t(25,2)=(25,3)=s128__val:(25,4)=ar(0,22);0;31;(0,5),0,1024;;sigset_t:t(21,1)=(25,2)timespec:T(26,1)=s8tv_sec:(8,36),0,32;tv_nsec:(0,3),32,32;;/usr/include/bits/time.htimeval:T(27,1)=s8tv_sec:(8,36),0,32;tv_usec:(8,38),32,32;;suseconds_t:t(21,2)=(8,38)__fd_mask:t(21,3)=(0,3)fd_set:t(21,4)=(21,5)=s128__fds_bits:(21,6)=ar(0,22);0;31;(21,3),0,1024;;fd_mask:t(21,7)=(21,3)/usr/include/sys/sysmacros.hblkcnt_t:t(6,34)=(8,46)fsblkcnt_t:t(6,35)=(8,48)fsfilcnt_t:t(6,36)=(8,50)random_data:T(1,5)=s28fptr:(1,6)=*(6,27),0,32;rptr:(1,6),32,32;state:(1,6),64,32;rand_type:(0,1),96,32;rand_deg:(0,1),128,32;rand_sep:(0,1),160,32;end_ptr:(1,6),192,32;;drand48_data:T(1,7)=s24__x:(1,8)=ar(0,22);0;2;(0,9),0,48;__old_x:(1,8),48,48;__c:(0,9),96,16;__init:(0,9),112,16;__a:(0,7),128,64;;/usr/include/alloca.h__compar_fn_t:t(1,9)=(1,10)=*(1,11)=f(0,1)spin.h/usr/include/stdio.hFILE:t(34,1)=(34,2)=xs_IO_FILE:__FILE:t(34,3)=(34,2)/usr/include/libio.h/usr/include/_G_config.hwint_t:t(41,1)=(0,4)/usr/include/wchar.h/usr/include/bits/wchar.h__mbstate_t:t(42,1)=(42,2)=s8__count:(0,1),0,32;__value:(42,3)=u4__wch:(41,1),0,32;__wchb:(42,4)=ar(0,22);0;3;(0,2),0,32;;,32,32;;_G_fpos_t:t(39,1)=(39,2)=s12__pos:(8,23),0,32;__state:(42,1),32,64;;_G_fpos64_t:t(39,3)=(39,4)=s16__pos:(8,53),0,64;__state:(42,1),64,64;;/usr/include/gconv.h :T(45,1)=e__GCONV_OK:0,__GCONV_NOCONV:1,__GCONV_NODB:2,__GCONV_NOMEM:3,__GCONV_EMPTY_INPUT:4,__GCONV_FULL_OUTPUT:5,__GCONV_ILLEGAL_INPUT:6,__GCONV_INCOMPLETE_INPUT:7,__GCONV_ILLEGAL_DESCRIPTOR:8,__GCONV_INTERNAL_ERROR:9,; :T(45,2)=e__GCONV_IS_LAST:1,__GCONV_IGNORE_ERRORS:2,;__gconv_fct:t(45,3)=(45,4)=*(45,5)=f(0,1)__gconv_init_fct:t(45,6)=(45,7)=*(45,8)=f(0,1)__gconv_end_fct:t(45,9)=(45,10)=*(45,11)=f(0,20)__gconv_trans_fct:t(45,12)=(45,13)=*(45,14)=f(0,1)__gconv_trans_context_fct:t(45,15)=(45,16)=*(45,17)=f(0,1)__gconv_trans_query_fct:t(45,18)=(45,19)=*(45,20)=f(0,1)__gconv_trans_init_fct:t(45,21)=(45,22)=*(45,23)=f(0,1)__gconv_trans_end_fct:t(45,24)=(45,25)=*(45,26)=f(0,20)__gconv_trans_data:T(45,27)=s20__trans_fct:(45,12),0,32;__trans_context_fct:(45,15),32,32;__trans_end_fct:(45,24),64,32;__data:(0,19),96,32;__next:(45,28)=*(45,27),128,32;;__gconv_step:T(45,29)=s56__shlib_handle:(45,30)=*(45,31)=xs__gconv_loaded_object:,0,32;__modname:(45,32)=*(0,2),32,32;__counter:(0,1),64,32;__from_name:(8,35),96,32;__to_name:(8,35),128,32;__fct:(45,3),160,32;__init_fct:(45,6),192,32;__end_fct:(45,9),224,32;__min_needed_from:(0,1),256,32;__max_needed_from:(0,1),288,32;__min_needed_to:(0,1),320,32;__max_needed_to:(0,1),352,32;__stateful:(0,1),384,32;__data:(0,19),416,32;;__gconv_step_data:T(45,33)=s36__outbuf:(45,34)=*(0,11),0,32;__outbufend:(45,34),32,32;__flags:(0,1),64,32;__invocation_counter:(0,1),96,32;__internal_use:(0,1),128,32;__statep:(45,35)=*(42,1),160,32;__state:(42,1),192,64;__trans:(45,28),256,32;;__gconv_info:T(45,36)=s8__nsteps:(5,1),0,32;__steps:(45,37)=*(45,29),32,32;__data:(45,38)=ar(0,22);0;-1;(45,33),64,0;;__gconv_t:t(45,39)=(45,40)=*(45,36)_G_iconv_t:t(39,5)=(39,6)=u44__cd:(45,36),0,64;__combined:(39,7)=s44__cd:(45,36),0,64;__data:(45,33),64,288;;,0,352;;_G_int16_t:t(39,8)=(0,8)_G_int32_t:t(39,9)=(0,1)_G_uint16_t:t(39,10)=(0,9)_G_uint32_t:t(39,11)=(0,4)/usr/lib/gcc-lib/i386-redhat-linux/2.96/include/stdarg.h__gnuc_va_list:t(51,1)=(0,19)_IO_lock_t:t(38,1)=(0,20)_IO_marker:T(38,2)=s12_next:(38,3)=*(38,2),0,32;_sbuf:(38,4)=*(34,2),32,32;_pos:(0,1),64,32;;__codecvt_result:T(38,5)=e__codecvt_ok:0,__codecvt_partial:1,__codecvt_error:2,__codecvt_noconv:3,;_IO_FILE:T(34,2)=s148_flags:(0,1),0,32;_IO_read_ptr:(8,35),32,32;_IO_read_end:(8,35),64,32;_IO_read_base:(8,35),96,32;_IO_write_base:(8,35),128,32;_IO_write_ptr:(8,35),160,32;_IO_write_end:(8,35),192,32;_IO_buf_base:(8,35),224,32;_IO_buf_end:(8,35),256,32;_IO_save_base:(8,35),288,32;_IO_backup_base:(8,35),320,32;_IO_save_end:(8,35),352,32;_markers:(38,3),384,32;_chain:(38,4),416,32;_fileno:(0,1),448,32;_blksize:(0,1),480,32;_old_offset:(8,23),512,32;_cur_column:(0,9),544,16;_vtable_offset:(0,10),560,8;_shortbuf:(38,6)=ar(0,22);0;0;(0,2),568,8;_lock:(38,7)=*(38,1),576,32;_offset:(8,53),608,64;__pad1:(0,19),672,32;__pad2:(0,19),704,32;_mode:(0,1),736,32;_unused2:(38,8)=ar(0,22);0;51;(0,2),768,416;;_IO_FILE:t(38,9)=(34,2)__io_read_fn:t(38,10)=(38,11)=f(8,26)__io_write_fn:t(38,12)=(38,13)=f(8,26)__io_seek_fn:t(38,14)=(38,15)=f(0,1)__io_close_fn:t(38,16)=(38,17)=f(0,1)fpos_t:t(34,4)=(39,1)/usr/include/bits/stdio_lim.h/usr/include/string.h/usr/include/ctype.h :T(56,1)=e_ISupper:256,_ISlower:512,_ISalpha:1024,_ISdigit:2048,_ISxdigit:4096,_ISspace:8192,_ISprint:16384,_ISgraph:32768,_ISblank:1,_IScntrl:2,_ISpunct:4,_ISalnum:8,;/usr/include/memory.hLextok:T(33,1)=s40ntyp:(0,9),0,16;ismtyp:(0,8),16,16;val:(0,1),32,32;ln:(0,1),64,32;indstep:(0,1),96,32;fn:(33,2)=*(33,3)=xsSymbol:,128,32;sym:(33,2),160,32;sq:(33,4)=*(33,5)=xsSequence:,192,32;sl:(33,6)=*(33,7)=xsSeqList:,224,32;lft:(33,8)=*(33,1),256,32;rgt:(33,8),288,32;;Lextok:t(33,9)=(33,1)Access:T(33,10)=s20who:(33,2),0,32;what:(33,2),32,32;cnt:(0,1),64,32;typ:(0,1),96,32;lnk:(33,11)=*(33,10),128,32;;Access:t(33,12)=(33,10)Symbol:T(33,3)=s72name:(8,35),0,32;Nid:(0,1),32,32;type:(0,8),64,16;hidden:(0,11),80,8;colnr:(0,11),88,8;nbits:(0,1),96,32;nel:(0,1),128,32;setat:(0,1),160,32;val:(33,13)=*(0,1),192,32;Sval:(33,14)=*(33,8),224,32;xu:(0,1),256,32;xup:(33,15)=ar(0,22);0;1;(33,2),288,64;access:(33,11),352,32;ini:(33,8),384,32;Slst:(33,8),416,32;Snm:(33,2),448,32;owner:(33,2),480,32;context:(33,2),512,32;next:(33,2),544,32;;Symbol:t(33,16)=(33,3)Ordered:T(33,17)=s8entry:(33,2),0,32;next:(33,18)=*(33,17),32,32;;Ordered:t(33,19)=(33,17)Queue:T(33,20)=s28qid:(0,8),0,16;qlen:(0,8),16,16;nslots:(0,8),32,16;nflds:(0,8),48,16;setat:(0,1),64,32;fld_width:(33,13),96,32;contents:(33,13),128,32;stepnr:(33,13),160,32;nxt:(33,21)=*(33,20),192,32;;Queue:t(33,22)=(33,20)Element:T(33,23)=s32n:(33,24)=*(33,9),0,32;Seqno:(0,1),32,32;seqno:(0,1),64,32;status:(0,11),96,8;sub:(33,6),128,32;esc:(33,6),160,32;Nxt:(33,25)=*(33,23),192,32;nxt:(33,25),224,32;;Element:t(33,26)=(33,23)Sequence:T(33,5)=s16frst:(33,27)=*(33,26),0,32;last:(33,27),32,32;extent:(33,27),64,32;maxel:(0,1),96,32;;Sequence:t(33,28)=(33,5)SeqList:T(33,7)=s8this:(33,29)=*(33,28),0,32;nxt:(33,6),32,32;;SeqList:t(33,30)=(33,7)Label:T(33,31)=s20s:(33,32)=*(33,16),0,32;c:(33,32),32,32;e:(33,27),64,32;visible:(0,1),96,32;nxt:(33,33)=*(33,31),128,32;;Label:t(33,34)=(33,31)Lbreak:T(33,35)=s8l:(33,32),0,32;nxt:(33,36)=*(33,35),32,32;;Lbreak:t(33,37)=(33,35)RunList:T(33,38)=s36n:(33,32),0,32;tn:(0,1),32,32;pid:(0,1),64,32;priority:(0,1),96,32;pc:(33,27),128,32;ps:(33,29),160,32;prov:(33,24),192,32;symtab:(33,32),224,32;nxt:(33,39)=*(33,38),256,32;;RunList:t(33,40)=(33,38)ProcList:T(33,41)=s24n:(33,32),0,32;p:(33,24),32,32;s:(33,29),64,32;prov:(33,24),96,32;tn:(0,8),128,16;det:(0,8),144,16;nxt:(33,42)=*(33,41),160,32;;ProcList:t(33,43)=(33,41)Lexptr:t(33,44)=(33,24) :T(33,45)=eINIV:0,PUTV:1,LOGV:2,;va_list:t(62,1)=(51,1)Mpars:G(0,1)runsafe:G(0,1)Expand_Ok:G(0,1)realread:G(0,1)IArgs:G(0,1)NamesNotAdded:G(0,1)claimproc:G(8,35)eventmap:G(8,35)Embedded:S(0,1)inEventMap:S(0,1)has_ini:S(0,1)yylhs:G(0,23)=ar(0,1);0;-1;(0,8)yylen:G(0,24)=ar(0,1);0;-1;(0,8)yydefred:G(0,25)=ar(0,1);0;-1;(0,8)yydgoto:G(0,26)=ar(0,1);0;-1;(0,8)yysindex:G(0,27)=ar(0,1);0;-1;(0,8)yyrindex:G(0,28)=ar(0,1);0;-1;(0,8)yygindex:G(0,29)=ar(0,1);0;-1;(0,8)yytable:G(0,30)=ar(0,1);0;-1;(0,8)yycheck:G(0,31)=ar(0,1);0;-1;(0,8)yyerror:F(0,20)fmt:p(8,35)spin.yyygrowstack:f(0,1)newsize:(0,1)i:(0,1)newss:(0,32)=*(0,8)newvs:(0,33)=*(33,44)yyparse:F(0,1)yym:(0,1)yyn:(0,1)yystate:(0,1)rl:(0,34)=*(33,43)j:(0,1)rl:(0,34)yydebug:G(0,1)yynerrs:G(0,1)yyerrflag:G(0,1)yychar:G(0,1)yyssp:G(0,32)yyvsp:G(0,33)yyval:G(33,44)yylval:G(33,44)yyss:G(0,32)yysslim:G(0,32)yyvs:G(0,33)yystacksize:G(0,1)spinlex.c__compar_fn_t:t(1,5)=(1,6)=*(1,7)=f(0,1)__u_char:t(10,1)=(0,11)__u_short:t(10,2)=(0,9)__u_int:t(10,3)=(0,4)__u_long:t(10,4)=(0,5)__u_quad_t:t(10,5)=(0,7)__quad_t:t(10,6)=(0,6)__int8_t:t(10,7)=(0,10)__uint8_t:t(10,8)=(0,11)__int16_t:t(10,9)=(0,8)__uint16_t:t(10,10)=(0,9)__int32_t:t(10,11)=(0,1)__uint32_t:t(10,12)=(0,4)__int64_t:t(10,13)=(0,6)__uint64_t:t(10,14)=(0,7)__qaddr_t:t(10,15)=(10,16)=*(10,6)__dev_t:t(10,17)=(10,5)__uid_t:t(10,18)=(10,3)__gid_t:t(10,19)=(10,3)__ino_t:t(10,20)=(10,4)__mode_t:t(10,21)=(10,3)__nlink_t:t(10,22)=(10,3)__off_t:t(10,23)=(0,3)__loff_t:t(10,24)=(10,6)__pid_t:t(10,25)=(0,1)__ssize_t:t(10,26)=(0,1)__rlim_t:t(10,27)=(10,4)__rlim64_t:t(10,28)=(10,5)__id_t:t(10,29)=(10,3)__fsid_t:t(10,30)=(10,31)=s8__val:(10,32)=ar(10,33)=r(10,33);0000000000000;0037777777777;;0;1;(0,1),0,64;;__daddr_t:t(10,34)=(0,1)__caddr_t:t(10,35)=(10,36)=*(0,2)__time_t:t(10,37)=(0,3)__useconds_t:t(10,38)=(0,4)__suseconds_t:t(10,39)=(0,3)__swblk_t:t(10,40)=(0,3)__clock_t:t(10,41)=(0,3)__clockid_t:t(10,42)=(0,1)__timer_t:t(10,43)=(0,1)__key_t:t(10,44)=(0,1)__ipc_pid_t:t(10,45)=(0,9)__blksize_t:t(10,46)=(0,3)__blkcnt_t:t(10,47)=(0,3)__blkcnt64_t:t(10,48)=(10,6)__fsblkcnt_t:t(10,49)=(10,4)__fsblkcnt64_t:t(10,50)=(10,5)__fsfilcnt_t:t(10,51)=(10,4)__fsfilcnt64_t:t(10,52)=(10,5)__ino64_t:t(10,53)=(10,5)__off64_t:t(10,54)=(10,24)__t_scalar_t:t(10,55)=(0,3)__t_uscalar_t:t(10,56)=(0,5)__intptr_t:t(10,57)=(0,1)__socklen_t:t(10,58)=(0,4)__mbstate_t:t(17,1)=(17,2)=s8__count:(0,1),0,32;__value:(17,3)=u4__wch:(16,1),0,32;__wchb:(17,4)=ar(10,33);0;3;(0,2),0,32;;,32,32;;_G_fpos_t:t(14,1)=(14,2)=s12__pos:(10,23),0,32;__state:(17,1),32,64;;_G_fpos64_t:t(14,3)=(14,4)=s16__pos:(10,54),0,64;__state:(17,1),64,64;; :T(20,1)=e__GCONV_OK:0,__GCONV_NOCONV:1,__GCONV_NODB:2,__GCONV_NOMEM:3,__GCONV_EMPTY_INPUT:4,__GCONV_FULL_OUTPUT:5,__GCONV_ILLEGAL_INPUT:6,__GCONV_INCOMPLETE_INPUT:7,__GCONV_ILLEGAL_DESCRIPTOR:8,__GCONV_INTERNAL_ERROR:9,; :T(20,2)=e__GCONV_IS_LAST:1,__GCONV_IGNORE_ERRORS:2,;__gconv_fct:t(20,3)=(20,4)=*(20,5)=f(0,1)__gconv_init_fct:t(20,6)=(20,7)=*(20,8)=f(0,1)__gconv_end_fct:t(20,9)=(20,10)=*(20,11)=f(0,20)__gconv_trans_fct:t(20,12)=(20,13)=*(20,14)=f(0,1)__gconv_trans_context_fct:t(20,15)=(20,16)=*(20,17)=f(0,1)__gconv_trans_query_fct:t(20,18)=(20,19)=*(20,20)=f(0,1)__gconv_trans_init_fct:t(20,21)=(20,22)=*(20,23)=f(0,1)__gconv_trans_end_fct:t(20,24)=(20,25)=*(20,26)=f(0,20)__gconv_trans_data:T(20,27)=s20__trans_fct:(20,12),0,32;__trans_context_fct:(20,15),32,32;__trans_end_fct:(20,24),64,32;__data:(0,19),96,32;__next:(20,28)=*(20,27),128,32;;__gconv_step:T(20,29)=s56__shlib_handle:(20,30)=*(20,31)=xs__gconv_loaded_object:,0,32;__modname:(20,32)=*(0,2),32,32;__counter:(0,1),64,32;__from_name:(10,36),96,32;__to_name:(10,36),128,32;__fct:(20,3),160,32;__init_fct:(20,6),192,32;__end_fct:(20,9),224,32;__min_needed_from:(0,1),256,32;__max_needed_from:(0,1),288,32;__min_needed_to:(0,1),320,32;__max_needed_to:(0,1),352,32;__stateful:(0,1),384,32;__data:(0,19),416,32;;__gconv_step_data:T(20,33)=s36__outbuf:(20,34)=*(0,11),0,32;__outbufend:(20,34),32,32;__flags:(0,1),64,32;__invocation_counter:(0,1),96,32;__internal_use:(0,1),128,32;__statep:(20,35)=*(17,1),160,32;__state:(17,1),192,64;__trans:(20,28),256,32;;__gconv_info:T(20,36)=s8__nsteps:(5,1),0,32;__steps:(20,37)=*(20,29),32,32;__data:(20,38)=ar(10,33);0;-1;(20,33),64,0;;__gconv_t:t(20,39)=(20,40)=*(20,36)_G_iconv_t:t(14,5)=(14,6)=u44__cd:(20,36),0,64;__combined:(14,7)=s44__cd:(20,36),0,64;__data:(20,33),64,288;;,0,352;;_G_int16_t:t(14,8)=(0,8)_G_int32_t:t(14,9)=(0,1)_G_uint16_t:t(14,10)=(0,9)_G_uint32_t:t(14,11)=(0,4)_IO_lock_t:t(13,1)=(0,20)_IO_marker:T(13,2)=s12_next:(13,3)=*(13,2),0,32;_sbuf:(13,4)=*(7,2),32,32;_pos:(0,1),64,32;;__codecvt_result:T(13,5)=e__codecvt_ok:0,__codecvt_partial:1,__codecvt_error:2,__codecvt_noconv:3,;_IO_FILE:T(7,2)=s148_flags:(0,1),0,32;_IO_read_ptr:(10,36),32,32;_IO_read_end:(10,36),64,32;_IO_read_base:(10,36),96,32;_IO_write_base:(10,36),128,32;_IO_write_ptr:(10,36),160,32;_IO_write_end:(10,36),192,32;_IO_buf_base:(10,36),224,32;_IO_buf_end:(10,36),256,32;_IO_save_base:(10,36),288,32;_IO_backup_base:(10,36),320,32;_IO_save_end:(10,36),352,32;_markers:(13,3),384,32;_chain:(13,4),416,32;_fileno:(0,1),448,32;_blksize:(0,1),480,32;_old_offset:(10,23),512,32;_cur_column:(0,9),544,16;_vtable_offset:(0,10),560,8;_shortbuf:(13,6)=ar(10,33);0;0;(0,2),568,8;_lock:(13,7)=*(13,1),576,32;_offset:(10,54),608,64;__pad1:(0,19),672,32;__pad2:(0,19),704,32;_mode:(0,1),736,32;_unused2:(13,8)=ar(10,33);0;51;(0,2),768,416;;_IO_FILE:t(13,9)=(7,2)__io_read_fn:t(13,10)=(13,11)=f(10,26)__io_write_fn:t(13,12)=(13,13)=f(10,26)__io_seek_fn:t(13,14)=(13,15)=f(0,1)__io_close_fn:t(13,16)=(13,17)=f(0,1)Lextok:T(6,1)=s40ntyp:(0,9),0,16;ismtyp:(0,8),16,16;val:(0,1),32,32;ln:(0,1),64,32;indstep:(0,1),96,32;fn:(6,2)=*(6,3)=xsSymbol:,128,32;sym:(6,2),160,32;sq:(6,4)=*(6,5)=xsSequence:,192,32;sl:(6,6)=*(6,7)=xsSeqList:,224,32;lft:(6,8)=*(6,1),256,32;rgt:(6,8),288,32;;Lextok:t(6,9)=(6,1)Access:T(6,10)=s20who:(6,2),0,32;what:(6,2),32,32;cnt:(0,1),64,32;typ:(0,1),96,32;lnk:(6,11)=*(6,10),128,32;;Access:t(6,12)=(6,10)Symbol:T(6,3)=s76name:(10,36),0,32;Nid:(0,1),32,32;type:(0,8),64,16;hidden:(0,11),80,8;colnr:(0,11),88,8;nbits:(0,1),96,32;nel:(0,1),128,32;setat:(0,1),160,32;val:(6,13)=*(0,1),192,32;Sval:(6,14)=*(6,8),224,32;xu:(0,1),256,32;xup:(6,15)=ar(10,33);0;1;(6,2),288,64;access:(6,11),352,32;ini:(6,8),384,32;Slst:(6,8),416,32;Snm:(6,2),448,32;owner:(6,2),480,32;context:(6,2),512,32;s_depth:(0,1),544,32;next:(6,2),576,32;;Symbol:t(6,16)=(6,3)Ordered:T(6,17)=s8entry:(6,2),0,32;next:(6,18)=*(6,17),32,32;;Ordered:t(6,19)=(6,17)Queue:T(6,20)=s28qid:(0,8),0,16;qlen:(0,8),16,16;nslots:(0,8),32,16;nflds:(0,8),48,16;setat:(0,1),64,32;fld_width:(6,13),96,32;contents:(6,13),128,32;stepnr:(6,13),160,32;nxt:(6,21)=*(6,20),192,32;;Queue:t(6,22)=(6,20)Element:T(6,23)=s36n:(6,24)=*(6,9),0,32;Seqno:(0,1),32,32;seqno:(0,1),64,32;status:(0,11),96,8;l_safe:(0,1),128,32;sub:(6,6),160,32;esc:(6,6),192,32;Nxt:(6,25)=*(6,23),224,32;nxt:(6,25),256,32;;Element:t(6,26)=(6,23)Sequence:T(6,5)=s16frst:(6,27)=*(6,26),0,32;last:(6,27),32,32;extent:(6,27),64,32;maxel:(0,1),96,32;;Sequence:t(6,28)=(6,5)SeqList:T(6,7)=s8this:(6,29)=*(6,28),0,32;nxt:(6,6),32,32;;SeqList:t(6,30)=(6,7)Label:T(6,31)=s20s:(6,32)=*(6,16),0,32;c:(6,32),32,32;e:(6,27),64,32;visible:(0,1),96,32;nxt:(6,33)=*(6,31),128,32;;Label:t(6,34)=(6,31)Lbreak:T(6,35)=s8l:(6,32),0,32;nxt:(6,36)=*(6,35),32,32;;Lbreak:t(6,37)=(6,35)RunList:T(6,38)=s36n:(6,32),0,32;tn:(0,1),32,32;pid:(0,1),64,32;priority:(0,1),96,32;pc:(6,27),128,32;ps:(6,29),160,32;prov:(6,24),192,32;symtab:(6,32),224,32;nxt:(6,39)=*(6,38),256,32;;RunList:t(6,40)=(6,38)ProcList:T(6,41)=s24n:(6,32),0,32;p:(6,24),32,32;s:(6,29),64,32;prov:(6,24),96,32;tn:(0,8),128,16;det:(0,8),144,16;nxt:(6,42)=*(6,41),160,32;;ProcList:t(6,43)=(6,41)Lexptr:t(6,44)=(6,24) :T(6,45)=eINIV:0,PUTV:1,LOGV:2,;y.tab.hIType:T(0,21)=s36nm:(6,32),0,32;cn:(6,24),32,32;params:(6,24),64,32;anms:(0,22)=*(10,36),96,32;dln:(0,1),128,32;cln:(0,1),160,32;dfn:(6,32),192,32;cfn:(6,32),224,32;nxt:(0,23)=*(0,21),256,32;;IType:t(0,24)=(0,21)lineno:G(0,1)IArgno:G(0,1)Inlining:G(0,1)in_comment:S(0,11)notquote:f(0,1)c:p(0,1)isalnum_:F(0,1)isalpha_:f(0,1)isdigit_:f(0,1)getword:f(0,20)first:p(0,1)tst:p(0,25)=*(0,26)=f(0,1)c:(0,2)follow:f(0,1)tok:p(0,1)ifyes:p(0,1)ifno:p(0,1)c:(0,1)def_inline:f(0,20)s:p(6,32)ln:p(0,1)ptr:p(10,36)nms:p(6,24)tmp:(0,27)=*(0,24)nw:(10,36)iseqname:f(0,1)t:p(10,36)tmp:(0,27)getinline:f(0,1)uninline:f(0,20)pickup_inline:F(0,20)t:p(6,32)apars:p(6,24)p:(6,24)q:(6,24)do_directive:f(0,20)fromwhere:p(0,1)prep_inline:F(0,20)nest:(0,1)dln:(0,1)firstchar:(0,1)cnr:(0,1)p:(10,36)buf:(0,28)=ar(10,33);0;65535;(0,2)t:(6,24)lex:f(0,1)Names:S(0,29)=ar(0,1);0;-1;(0,30)=s16s:(10,36),0,32;tok:(0,1),32,32;val:(0,1),64,32;sym:(10,36),96,32;;check_name:f(0,1)s:p(10,36)tt:(6,24)yylex:F(0,1)last:V(0,1)hold:V(0,1)IArg_nst:V(0,1)Inliner:G(0,31)=ar(10,33);0;15;(10,36)IArg_cont:G(0,32)=ar(10,33);0;31;(0,33)=ar(10,33);0;511;(0,2)Inline_stub:G(0,34)=ar(10,33);0;15;(0,27)yytext:G(0,33)yyin:G(0,35)=*(7,1)yyout:G(0,35)ReDiRect:S(10,36)seqnames:S(0,27)sym.c__mbstate_t:t(14,1)=(14,2)=s8__count:(0,1),0,32;__value:(14,3)=u4__wch:(13,2),0,32;__wchb:(14,4)=ar(7,33);0;3;(0,2),0,32;;,32,32;;context:G(1,32)cls_depth:G(0,1)all_names:G(0,21)=*(1,19)Nid:G(0,1)last_name:S(0,21)samename:f(0,1)a:p(1,32)b:p(1,32)hash:F(0,1)s:p(7,36)h:(0,1)lookup:F(1,32)sp:(1,32)no:(0,21)trackvar:F(0,20)n:p(1,24)m:p(1,24)runstmnts:G(1,24)trackrun:F(0,20)checkrun:F(0,20)parnm:p(1,32)posno:p(0,1)n:(1,24)now:(1,24)v:(1,24)m:(0,1)res:(0,1)buf:(0,22)=ar(7,33);0;15;(0,2)buf2:(0,22)trackchanuse:F(0,20)w:p(1,24)t:p(0,1)cnt:(0,1)setptype:F(0,20)vis:p(1,24)oln:(0,1)setonexu:f(0,20)sp:p(1,32)setallxu:f(0,20)fp:(1,24)tl:(1,24)Xu_List:G(1,24)setxus:F(0,20)p:p(1,24)m:(1,24)Xu_new:(1,24)Mtype:G(1,24)setmtype:F(0,20)ismtype:F(0,1)str:p(7,36)sputtype:F(0,1)foo:p(7,36)m:p(0,1)puttype:f(0,1)buf:(0,23)=ar(7,33);0;31;(0,2)symvar:f(0,20)symdump:F(0,20)walk:(0,21)chname:F(0,20)X:T(0,24)=s8typ:(0,1),0,32;nm:(7,36),32,32;;xx:S(0,25)=ar(0,1);0;-1;(0,24)chan_check:f(0,20)a:(0,26)=*(1,12)b:(0,1)d:(0,1)chanaccess:F(0,20)buf:(0,23)symtab:S(0,27)=ar(7,33);0;255;(1,32)vars.cmaxcolnr:S(0,1)getval:F(0,1)sn:p(1,24)s:(1,32)setval:F(0,1)v:p(1,24)n:p(0,1)rm_selfrefs:F(0,20)s:p(1,32)i:p(1,24)checkvar:F(0,1)ofnm:(1,32)getglobal:f(0,1)n:(0,1)cast_val:F(0,1)v:p(0,1)w:p(0,1)s:(0,8)u:(0,11)buf:(0,21)=ar(7,33);0;31;(0,2)setglobal:f(0,1)dumpclaims:F(0,20)fd:p(0,22)=*(2,1)pid:p(0,1)oPid:(0,1)dumpglobals:F(0,20)walk:(0,23)=*(1,19)dummy:(1,24)prefetch:(0,1)colpos:(0,1)dumplocal:F(0,20)r:p(0,24)=*(1,40)z:(1,32)main.cversion.h/usr/include/signal.h__sig_atomic_t:t(42,1)=(0,1)__sigset_t:t(42,2)=(42,3)=s128__val:(42,4)=ar(10,33);0;31;(0,5),0,1024;;sig_atomic_t:t(40,1)=(42,1)sigset_t:t(40,2)=(42,2)/usr/include/bits/signum.h__sighandler_t:t(40,3)=(40,4)=*(40,5)=f(0,20)/usr/include/bits/sigaction.hsigaction:T(45,1)=s140sa_handler:(40,3),0,32;sa_mask:(42,2),32,1024;sa_flags:(0,1),1056,32;sa_restorer:(45,2)=*(45,3)=f(0,20),1088,32;;clock_t:t(46,1)=(10,41)time_t:t(46,2)=(10,37)tm:T(46,3)=s44tm_sec:(0,1),0,32;tm_min:(0,1),32,32;tm_hour:(0,1),64,32;tm_mday:(0,1),96,32;tm_mon:(0,1),128,32;tm_year:(0,1),160,32;tm_wday:(0,1),192,32;tm_yday:(0,1),224,32;tm_isdst:(0,1),256,32;__tm_gmtoff:(0,3),288,32;__tm_zone:(20,32),320,32;;/usr/include/unistd.h/usr/include/bits/posix_opt.hssize_t:t(52,1)=(10,26)/usr/include/bits/confname.h :T(57,1)=e_PC_LINK_MAX:0,_PC_MAX_CANON:1,_PC_MAX_INPUT:2,_PC_NAME_MAX:3,_PC_PATH_MAX:4,_PC_PIPE_BUF:5,_PC_CHOWN_RESTRICTED:6,_PC_NO_TRUNC:7,_PC_VDISABLE:8,_PC_SYNC_IO:9,_PC_ASYNC_IO:10,_PC_PRIO_IO:11,_PC_SOCK_MAXBUF:12,_PC_FILESIZEBITS:13,_PC_REC_INCR_XFER_SIZE:14,_PC_REC_MAX_XFER_SIZE:15,_PC_REC_MIN_XFER_SIZE:16,_PC_REC_XFER_ALIGN:17,_PC_ALLOC_SIZE_MIN:18,_PC_SYMLINK_MAX:19,; :T(57,2)=e_SC_ARG_MAX:0,_SC_CHILD_MAX:1,_SC_CLK_TCK:2,_SC_NGROUPS_MAX:3,_SC_OPEN_MAX:4,_SC_STREAM_MAX:5,_SC_TZNAME_MAX:6,_SC_JOB_CONTROL:7,_SC_SAVED_IDS:8,_SC_REALTIME_SIGNALS:9,_SC_PRIORITY_SCHEDULING:10,_SC_TIMERS:11,_SC_ASYNCHRONOUS_IO:12,_SC_PRIORITIZED_IO:13,_SC_SYNCHRONIZED_IO:14,_SC_FSYNC:15,_SC_MAPPED_FILES:16,_SC_MEMLOCK:17,_SC_MEMLOCK_RANGE:18,_SC_MEMORY_PROTECTION:19,_SC_MESSAGE_PASSING:20,_SC_SEMAPHORES:21,_SC_SHARED_MEMORY_OBJECTS:22,_SC_AIO_LISTIO_MAX:23,_SC_AIO_MAX:24,_SC_AIO_PRIO_DELTA_MAX:25,_SC_DELAYTIMER_MAX:26,_SC_MQ_OPEN_MAX:27,_SC_MQ_PRIO_MAX:28,_SC_VERSION:29,_SC_PAGESIZE:30,_SC_RTSIG_MAX:31,_SC_SEM_NSEMS_MAX:32,_SC_SEM_VALUE_MAX:33,_SC_SIGQUEUE_MAX:34,_SC_TIMER_MAX:35,_SC_BC_BASE_MAX:36,_SC_BC_DIM_MAX:37,_SC_BC_SCALE_MAX:38,_SC_BC_STRING_MAX:39,_SC_COLL_WEIGHTS_MAX:40,_SC_EQUIV_CLASS_MAX:41,_SC_EXPR_NEST_MAX:42,_SC_LINE_MAX:43,_SC_RE_DUP_MAX:44,_SC_CHARCLASS_NAME_MAX:45,_SC_2_VERSION:46,_SC_2_C_BIND:47,_SC_2_C_DEV:48,_SC_2_FORT_DEV:49,_SC_2_FORT_RUN:50,_SC_2_SW_DEV:51,_SC_2_LOCALEDEF:52,_SC_PII:53,_SC_PII_XTI:54,_SC_PII_SOCKET:55,_SC_PII_INTERNET:56,_SC_PII_OSI:57,_SC_POLL:58,_SC_SELECT:59,_SC_UIO_MAXIOV:60,_SC_IOV_MAX:60,_SC_PII_INTERNET_STREAM:61,_SC_PII_INTERNET_DGRAM:62,_SC_PII_OSI_COTS:63,_SC_PII_OSI_CLTS:64,_SC_PII_OSI_M:65,_SC_T_IOV_MAX:66,_SC_THREADS:67,_SC_THREAD_SAFE_FUNCTIONS:68,_SC_GETGR_R_SIZE_MAX:69,_SC_GETPW_R_SIZE_MAX:70,_SC_LOGIN_NAME_MAX:71,_SC_TTY_NAME_MAX:72,_SC_THREAD_DESTRUCTOR_ITERATIONS:73,_SC_THREAD_KEYS_MAX:74,_SC_THREAD_STACK_MIN:75,_SC_THREAD_THREADS_MAX:76,_SC_THREAD_ATTR_STACKADDR:77,_SC_THREAD_ATTR_STACKSIZE:78,_SC_THREAD_PRIORITY_SCHEDULING:79,_SC_THREAD_PRIO_INHERIT:80,_SC_THREAD_PRIO_PROTECT:81,_SC_THREAD_PROCESS_SHARED:82,_SC_NPROCESSORS_CONF:83,_SC_NPROCESSORS_ONLN:84,_SC_PHYS_PAGES:85,_SC_AVPHYS_PAGES:86,_SC_ATEXIT_MAX:87,_SC_PASS_MAX:88,_SC_XOPEN_VERSION:89,_SC_XOPEN_XCU_VERSION:90,_SC_XOPEN_UNIX:91,_SC_XOPEN_CRYPT:92,_SC_XOPEN_ENH_I18N:93,_SC_XOPEN_SHM:94,_SC_2_CHAR_TERM:95,_SC_2_C_VERSION:96,_SC_2_UPE:97,_SC_XOPEN_XPG2:98,_SC_XOPEN_XPG3:99,_SC_XOPEN_XPG4:100,_SC_CHAR_BIT:101,_SC_CHAR_MAX:102,_SC_CHAR_MIN:103,_SC_INT_MAX:104,_SC_INT_MIN:105,_SC_LONG_BIT:106,_SC_WORD_BIT:107,_SC_MB_LEN_MAX:108,_SC_NZERO:109,_SC_SSIZE_MAX:110,_SC_SCHAR_MAX:111,_SC_SCHAR_MIN:112,_SC_SHRT_MAX:113,_SC_SHRT_MIN:114,_SC_UCHAR_MAX:115,_SC_UINT_MAX:116,_SC_ULONG_MAX:117,_SC_USHRT_MAX:118,_SC_NL_ARGMAX:119,_SC_NL_LANGMAX:120,_SC_NL_MSGMAX:121,_SC_NL_NMAX:122,_SC_NL_SETMAX:123,_SC_NL_TEXTMAX:124,_SC_XBS5_ILP32_OFF32:125,_SC_XBS5_ILP32_OFFBIG:126,_SC_XBS5_LP64_OFF64:127,_SC_XBS5_LPBIG_OFFBIG:128,_SC_XOPEN_LEGACY:129,_SC_XOPEN_REALTIME:130,_SC_XOPEN_REALTIME_THREADS:131,_SC_ADVISORY_INFO:132,_SC_BARRIERS:133,_SC_BASE:134,_SC_C_LANG_SUPPORT:135,_SC_C_LANG_SUPPORT_R:136,_SC_CLOCK_SELECTION:137,_SC_CPUTIME:138,_SC_THREAD_CPUTIME:139,_SC_DEVICE_IO:140,_SC_DEVICE_SPECIFIC:141,_SC_DEVICE_SPECIFIC_R:142,_SC_FD_MGMT:143,_SC_FIFO:144,_SC_PIPE:145,_SC_FILE_ATTRIBUTES:146,_SC_FILE_LOCKING:147,_SC_FILE_SYSTEM:148,_SC_MONOTONIC_CLOCK:149,_SC_MULTI_PROCESS:150,_SC_SINGLE_PROCESS:151,_SC_NETWORKING:152,_SC_READER_WRITER_LOCKS:153,_SC_SPIN_LOCKS:154,_SC_REGEXP:155,_SC_REGEX_VERSION:156,_SC_SHELL:157,_SC_SIGNALS:158,_SC_SPAWN:159,_SC_SPORADIC_SERVER:160,_SC_THREAD_SPORADIC_SERVER:161,_SC_SYSTEM_DATABASE:162,_SC_SYSTEM_DATABASE_R:163,_SC_TIMEOUTS:164,_SC_TYPED_MEMORY_OBJECTS:165,_SC_USER_GROUPS:166,_SC_USER_GROUPS_R:167,_SC_2_PBS:168,_SC_2_PBS_ACCOUNTING:169,_SC_2_PBS_LOCATE:170,_SC_2_PBS_MESSAGE:171,_SC_2_PBS_TRACK:172,_SC_SYMLOOP_MAX:173,_SC_STREAMS:174,_SC_2_PBS_CHECKPOINT:175,_SC_V6_ILP32_OFF32:176,_SC_V6_ILP32_OFFBIG:177,_SC_V6_LP64_OFF64:178,_SC_V6_LPBIG_OFFBIG:179,_SC_HOST_NAME_MAX:180,_SC_TRACE:181,_SC_TRACE_EVENT_FILTER:182,_SC_TRACE_INHERIT:183,_SC_TRACE_LOG:184,;Etimeouts:G(0,1)Ntimeouts:G(0,1)analyze:G(0,1)columns:G(0,1)dumptab:G(0,1)has_remote:G(0,1)interactive:G(0,1)jumpsteps:G(0,1)m_loss:G(0,1)nr_errs:G(0,1)s_trail:G(0,1)ntrail:G(0,1)verbose:G(0,1)xspin:G(0,1)no_print:G(0,1)no_wrapup:G(0,1)Caccess:G(0,1)limited_vis:G(0,1)like_java:G(0,1)IsAsgn:S(0,1)OrIsAsgn:S(0,1)Operator:S(0,21)=ar(10,33);0;10;(0,2)Keyword:S(0,22)=ar(10,33);0;9;(0,2)Function:S(0,23)=ar(10,33);0;15;(0,2)add_ltl:S(0,24)=*(10,36)ltl_file:S(0,24)nvr_file:S(0,24)PreCnt:S(0,1)PreProc:S(10,36)alldone:F(0,20)estatus:p(0,1)preprocess:F(0,20)a:p(10,36)b:p(10,36)a_tmp:p(0,1)precmd:(0,25)=ar(10,33);0;127;(0,2)cmd:(0,26)=ar(10,33);0;255;(0,2)cpyfile:F(0,27)=*(7,1)src:p(10,36)tgt:p(10,36)inp:(0,27)out:(0,27)buf:(0,28)=ar(10,33);0;1023;(0,2)main:F(0,1)argc:p(0,1)argv:p(0,24)s:(6,32)preprocessonly:(0,1)T:(0,1)formula:(0,29)=ar(10,33);0;511;(0,2)cmd:(0,25)out2:(0,30)=ar(10,33);0;31;(0,2)fd:(0,27)buf:(0,28)yywrap:F(0,1)non_fatal:F(0,20)s1:p(10,36)s2:p(10,36)fatal:F(0,20)emalloc:F(10,36)tmp:(10,36)trapwonly:F(0,20)n:p(6,24)i:(0,8)setaccess:F(0,20)sp:p(6,32)what:p(6,32)cnt:p(0,1)a:(0,31)=*(6,12)nn:F(6,24)s:p(6,24)ll:p(6,24)rl:p(6,24)n:(6,24)rem_lab:F(6,24)a:p(6,32)b:p(6,24)c:p(6,32)tmp1:(6,24)tmp2:(6,24)tmp3:(6,24)explain:f(0,20)Fname:G(6,32)oFname:G(6,32)Same:S(6,27)PreArg:S(0,32)=ar(10,33);0;31;(10,36)out1:S(0,30)ps_msc.cPsPre:S(0,21)=ar(0,1);0;-1;(7,36)MH:G(0,1)oMH:G(0,1)pspno:S(0,1)ldepth:S(0,1)TotSteps:S(0,1)Scaler:S(0,12)putlegend:F(0,20)startpage:F(0,20)putprelude:F(0,20)snap:(0,22)=ar(7,33);0;255;(0,2)fd:(0,23)=*(2,1)putpostlude:F(0,20)psline:F(0,20)x0:p(0,1)iy0:p(0,1)x1:p(0,1)iy1:p(0,1)r:p(0,12)g:p(0,12)b:p(0,12)y0:(0,1)y1:(0,1)dx:(0,1)colbox:F(0,20)x:p(0,1)y:p(0,1)h:p(0,1)putgrid:F(0,20)p:p(0,1)putarrow:F(0,20)from:p(0,1)to:p(0,1)stepnumber:F(0,20)i:p(0,1)y:(0,1)spitbox:F(0,20)dx:p(0,1)r:(0,12)g:(0,12)b:(0,12)bw:(0,12)a:(0,1)d:(0,22)putpages:F(0,20)lasti:(0,1)nmh:(0,12)reali:(0,1)realt:(0,1)topop:(0,1)putbox:F(0,20)pstext:F(0,20)tmp:(7,36)dotag:F(0,20)pid:(0,1)pfd:S(0,23)I:S(0,24)=*(7,36)D:S(1,13)R:S(1,13)M:S(0,25)=*(0,8)T:S(0,25)L:S(0,24)ProcLine:S(7,36)maxx:S(0,1)mesg.cqtab:G(0,21)=*(1,22)nqs:G(0,1)firstrow:G(0,1)n_rem:S(1,24)q_rem:S(0,21)cnt_mpars:F(0,1)qmake:F(0,1)q:(0,21)qfull:F(0,1)whichq:(0,1)qlen:F(0,1)q_is_sync:F(0,1)qsend:F(0,1)qrecv:F(0,1)full:p(0,1)sa_snd:f(0,1)q:p(0,21)k:(0,1)New:(0,1)Old:(0,1)typ_ck:F(0,20)ft:p(0,1)at:p(0,1)buf:(0,22)=ar(7,33);0;127;(0,2)tag1:(0,23)=ar(7,33);0;31;(0,2)tag2:(0,23)a_snd:f(0,1)a_rcv:f(0,1)oi:(0,1)s_snd:f(0,1)rX:(0,24)=*(1,40)sX:(0,24)channm:F(0,20)lbuf:(0,25)=ar(7,33);0;255;(0,2)r:(1,32)difcolumns:f(0,20)tr:p(7,36)j:p(0,1)nn:(1,24)docolumns:f(0,20)QH:T(0,26)=s8n:(0,1),0,32;nxt:(0,27)=*(0,26),32,32;;QH:t(0,28)=(0,26)qhide:F(0,20)q:p(0,1)p:(0,29)=*(0,28)qishidden:F(0,1)p:(0,29)sr_talk:f(0,20)a:p(7,36)s:(0,30)=ar(7,33);0;63;(0,2)sr_buf:F(0,20)lbuf:(0,23)sr_mesg:F(0,20)fd:p(0,31)=*(2,1)doq:F(0,20)r:p(0,24)nochan_manip:F(0,20)d:p(0,1)ltab:G(0,32)=ar(7,33);0;2499;(0,21)Buf:G(0,33)=ar(7,33);0;1023;(0,2)qh:G(0,29)flow.cAl_El:G(1,27)labtab:G(0,21)=*(1,34)Elcnt:G(0,1)DstepStart:G(0,1)breakstack:S(0,22)=*(1,37)cur_s:S(0,23)=*(1,30)Unique:S(0,1)break_id:S(0,1)open_seq:F(0,20)top:p(0,1)t:(0,23)s:(1,29)rem_Seq:F(0,20)unrem_Seq:F(0,20)Rjumpslocal:f(0,1)q:p(1,27)stop:p(1,27)lb:(1,27)f:(1,27)h:(0,23)cross_dsteps:F(0,20)a:p(1,24)b:p(1,24)close_seq:F(1,29)nottop:p(0,1)do_unless:F(1,24)No:p(1,24)Es:p(1,24)Sl:(0,23)Re:(1,24)tok:(0,1)seqlist:F(0,23)s:p(1,29)r:p(0,23)new_el:f(1,27)m:(1,27)has_chanref:f(0,1)if_seq:f(1,27)s:(0,23)e:(1,27)t:(1,27)z:(0,23)prev_z:(0,23)move_else:(0,23)ref_chans:(0,1)escape_el:f(0,20)f:p(1,27)e:p(1,29)attach_escape:f(0,20)n:p(1,29)unless_seq:f(1,27)mk_skip:F(1,27)t:(1,24)add_el:f(0,20)e:p(1,27)y:(1,27)colons:f(1,27)add_seq:F(0,20)set_lab:f(0,20)l:(0,21)get_lab:F(1,27)md:p(0,1)has_lab:F(1,32)mov_lab:f(0,20)z:p(1,32)y:p(1,27)fix_dest:F(0,20)c:p(1,32)keep_ln:(0,1)keep_fn:(1,32)find_lab:F(0,1)markit:p(0,1)pushbreak:F(0,20)r:(0,22)l:(1,32)buf:(0,24)=ar(7,33);0;31;(0,2)break_dest:F(1,32)make_atomic:F(0,20)added:p(0,1)walk_atomic:f(0,20)a:p(1,27)b:p(1,27)ofn:(1,32)dumplabels:F(0,20)innermost:S(1,24)sched.cX:G(0,21)=*(6,40)run:G(0,21)LastX:G(0,21)rdy:G(0,22)=*(6,43)LastStep:G(6,27)nproc:G(0,1)nstop:G(0,1)Tval:G(0,1)Rvous:G(0,1)depth:G(0,1)nrRdy:G(0,1)Have_claim:G(0,8)Skip_claim:G(0,8)Priority_Sum:S(0,1)runnable:F(0,20)p:p(0,22)weight:p(0,1)noparams:p(0,1)r:(0,21)ready:F(0,22)n:p(6,32)p:p(6,24)s:p(6,29)det:p(0,1)prov:p(6,24)fp:(6,24)fpt:(6,24)find_maxel:F(0,1)p:(0,22)formdump:f(0,20)f:(6,24)announce:F(0,20)w:p(10,36)enable:F(0,1)m:p(6,24)start_claim:F(0,20)wrapup:F(0,20)fini:p(0,1)ov:(0,1)p_blocked:f(0,1)silent_moves:f(6,27)e:p(6,27)f:(6,27)pickproc:f(0,20)z:(0,23)=*(6,30)has_else:(6,27)Choices:(0,24)=ar(10,33);0;255;(0,8)nr_else:(0,1)only_choice:(0,1)no_choice:(0,1)proc_no_ch:(0,1)proc_k:(0,1)unex:(0,1)y:(6,27)buf:(0,25)=ar(10,33);0;255;(0,2)sched:F(0,20)e:(6,27)Y:(0,21)oX:(0,21)go:(0,1)complete_rendez:F(0,1)orun:(0,21)tmp:(0,21)s_was:(6,27)ointer:(0,1)addsymbol:f(0,20)r:p(0,21)t:(6,32)setlocals:f(0,20)walk:(0,26)=*(6,19)sp:(6,32)oneparam:f(0,20)t:p(6,24)a:p(6,24)at:(0,1)ft:(0,1)buf:(0,27)=ar(10,33);0;127;(0,2)tag1:(0,28)=ar(10,33);0;31;(0,2)tag2:(0,28)setparams:f(0,20)q:p(6,24)a:(6,24)findloc:F(6,32)r:(6,32)getlocal:F(0,1)sn:p(6,24)setlocal:F(0,1)whoruns:F(0,20)lnr:p(0,1)talk:f(0,20)p_talk:F(0,20)lastnever:V(0,1)newnever:(0,1)remotelab:F(0,1)remotevar:F(0,1)prno:(0,1)trick:(0,1)MadeChoice:G(0,1)is_blocked:S(0,25)run.cSeed:S(0,3)E_Check:S(0,1)Srand:F(0,20)s:p(0,4)Rand:F(0,3)rev_escape:F(6,27)e:p(0,21)=*(6,30)r:(6,27)eval_sub:F(6,27)g:(6,27)z:(0,21)nr_choices:(0,1)buf:(0,22)=ar(10,33);0;255;(0,2)x:(0,21)eval_sync:f(0,1)now:(6,24)assign:f(0,1)now:p(6,24)t:(0,1)nonprogress:f(0,1)r:(0,23)=*(6,40)z:(6,32)eval:F(0,1)interprint:f(0,1)tmp:(6,24)s:(10,36)lbuf:(0,24)=ar(10,33);0;15;(0,2)Enabled1:f(0,1)v:(0,1)Enabled0:F(0,1)pc_enabled:f(0,1)result:(0,1)Y:(0,23)oX:(0,23)pangen1.cpangen1.hCode2:S(37,1)=ar(0,1);0;-1;(7,36)pangen3.hHeader:S(38,1)=ar(0,1);0;-1;(7,36)Addp0:S(38,2)=ar(0,1);0;-1;(7,36)Addp1:S(38,3)=ar(0,1);0;-1;(7,36)Addq0:S(38,4)=ar(0,1);0;-1;(7,36)Addq1:S(38,5)=ar(0,1);0;-1;(7,36)Addq11:S(38,6)=ar(0,1);0;-1;(7,36)Addq2:S(38,7)=ar(0,1);0;-1;(7,36)Addq3:S(38,8)=ar(0,1);0;-1;(7,36)Addq4:S(38,9)=ar(0,1);0;-1;(7,36)Addq5:S(38,10)=ar(0,1);0;-1;(7,36)Code0:S(38,11)=ar(0,1);0;-1;(7,36)R0:S(38,12)=ar(0,1);0;-1;(7,36)R0a:S(38,13)=ar(0,1);0;-1;(7,36)R0b:S(38,14)=ar(0,1);0;-1;(7,36)Code1:S(38,15)=ar(0,1);0;-1;(7,36)Code3:S(38,16)=ar(0,1);0;-1;(7,36)R2:S(38,17)=ar(0,1);0;-1;(7,36)R3:S(38,18)=ar(0,1);0;-1;(7,36)R4:S(38,19)=ar(0,1);0;-1;(7,36)R5:S(38,20)=ar(0,1);0;-1;(7,36)R6:S(38,21)=ar(0,1);0;-1;(7,36)R8a:S(38,22)=ar(0,1);0;-1;(7,36)R8b:S(38,23)=ar(0,1);0;-1;(7,36)R9:S(38,24)=ar(0,1);0;-1;(7,36)R10:S(38,25)=ar(0,1);0;-1;(7,36)R10_5:S(38,26)=ar(0,1);0;-1;(7,36)R12:S(38,27)=ar(0,1);0;-1;(7,36)R13:G(38,28)=ar(0,1);0;-1;(7,36)R14:G(38,29)=ar(0,1);0;-1;(7,36)R15:G(38,30)=ar(0,1);0;-1;(7,36)Proto:S(38,31)=ar(0,1);0;-1;(7,36)SvMap:S(38,32)=ar(0,1);0;-1;(7,36)Npars:G(0,1)u_sync:G(0,1)u_async:G(0,1)LstSet:S(1,32)acceptors:S(0,1)progressors:S(0,1)nBits:S(0,1)Types:S(0,21)=ar(0,1);0;-1;(0,1)reverse_names:f(0,20)p:p(0,22)=*(1,43)genheader:F(0,20)genaddproc:F(0,20)genother:F(0,20)gensvmap:F(0,20)ln:S(0,23)=ar(0,1);0;-1;(0,24)=s20s:(7,36),0,32;t:(7,36),32,32;n:(0,1),64,32;m:(0,1),96,32;p:(0,1),128,32;;end_labs:f(0,20)l:(0,25)=*(1,34)foo:(0,26)=ar(7,33);0;39;(0,2)ntimes:F(0,20)fd:p(0,27)=*(2,1)c:p(0,28)=*(7,36)prehint:F(0,20)checktype:F(0,20)buf:(0,29)=ar(7,33);0;31;(0,2)f:(1,24)posnr:(0,1)dolocal:F(0,1)ofd:p(0,27)pre:p(7,36)dowhat:p(0,1)how:p(7,36)walk:(0,30)=*(1,19)buf:(0,31)=ar(7,33);0;63;(0,2)buf2:(0,32)=ar(7,33);0;127;(0,2)buf3:(0,32)doglobal:f(0,1)walk:(0,30)dohidden:f(0,20)do_var:F(0,20)sep:p(7,36)ter:p(7,36)do_init:f(0,20)blog:f(0,1)r:(0,1)put_ptype:f(0,20)m0:p(0,1)m1:p(0,1)tc_predef_np:f(0,20)put_pinit:f(0,20)P:p(0,22)fpt:(1,24)p:(1,24)ini:(0,1)huntstart:F(1,27)huntele:F(1,27)o:p(0,1)g:(1,27)typ2c:F(0,20)wsbits:(0,1)ncases:f(0,20)fd:p(0,27)c:p(0,28)genaddqueue:F(0,20)buf0:(0,33)=ar(7,33);0;255;(0,2)q:(0,34)=*(1,22)genhierarchy:F(0,20)pangen2.cpangen2.hPreamble:S(38,1)=ar(0,1);0;-1;(7,36)Tail:S(38,2)=ar(0,1);0;-1;(7,36)pangen4.hDfa:S(39,1)=ar(0,1);0;-1;(7,36)pangen5.hXpt:S(40,1)=ar(0,1);0;-1;(7,36)OkBreak:G(0,1)nocast:G(0,8)terse:G(0,8)no_arrays:G(0,8)has_last:G(0,8)has_badelse:G(0,8)has_enabled:G(0,8)has_pcvalue:G(0,8)has_np:G(0,8)has_sorted:G(0,8)has_random:G(0,8)has_xu:G(0,8)has_unless:G(0,8)has_provided:G(0,8)_isok:G(0,8)evalindex:G(0,8)withprocname:G(0,8)mst:G(0,1)claimnr:G(0,1)eventmapnr:G(0,1)LowLvl:G(0,1)TopLvl:G(0,1)proc_cnt:G(0,1)uniq:S(0,1)AllGlobal:S(0,8)fproc:f(0,1)p:(0,21)=*(1,43)reverse_procs:f(0,20)q:p(0,22)=*(1,40)tm_predef_np:f(0,20)tt_predef_np:f(0,20)gensrc:F(0,20)p:(0,21)find_id:f(0,1)dolen:f(0,20)ai:p(0,1)qln:p(0,1)AA:T(0,23)=s17TT:(0,24)=ar(7,33);0;8;(0,2),0,72;CC:(0,25)=ar(7,33);0;7;(0,2),72,64;;BB:S(0,26)=ar(7,33);0;3;(0,23)Done_case:F(0,20)nm:p(7,36)nid:(0,1)qln:(0,1)Docase:f(0,20)nid:p(0,1)genconditionals:f(0,20)last:(0,1)walk:(0,27)=*(1,19)pregat:(0,28)=ar(7,33);0;127;(0,2)putproc:f(0,20)p:p(0,21)addTpe:f(0,20)cnt_seq:f(0,20)h:(0,29)=*(1,30)typ_seq:f(0,20)hidden:f(0,1)getNid:f(0,1)valTpe:f(0,1)Tpe:f(0,20)put_escp:f(0,20)x:(0,29)put_sub:f(0,20)Tt0:p(0,1)Tt1:p(0,1)max_lvl:(0,1)inherit:(0,1)put_el:f(0,20)Global_ref:(0,1)Max_Safe_Lvl:(0,1)nested_unless:f(0,20)g:p(1,27)y:(1,6)z:(1,6)put_seq:f(0,20)h:(0,29)patch_atomic:f(0,20)mark_seq:f(0,20)mark_seq_cpor:f(0,20)max_l_safe:p(0,1)find_target:f(1,27)target:F(1,27)scan_seq:f(0,1)scan_seq_cpor:f(0,1)glob_args:f(0,1)glob_args_cpor:f(0,1)has_global:f(0,1)max_safe_level:f(0,1)tmp_max:(0,1)safety_level_name:f(0,1)Bailout:f(0,20)fd:p(0,30)=*(2,1)putstmnt:F(0,20)fd:p(0,30)now:p(1,24)putname:F(0,20)suff:p(7,36)x:(0,1)putremote:F(0,20)promoted:(0,1)getweight:f(0,1)has_typ:F(0,1)tc:G(0,30)th:G(0,30)tt:G(0,30)tm:G(0,30)tb:G(0,30)cur_proc:G(0,21)Pid:G(0,1)cls_begin:G(0,31)=ar(7,33);0;254;(0,1)Nn:S(0,32)=ar(7,33);0;1;(1,24)Det:S(0,1)T_sum:S(0,1)T_mus:S(0,1)t_cyc:S(0,1)TPE:S(7,32)EPT:S(7,32)pangen3.cSRC:T(0,21)=s12ln:(0,8),0,16;st:(0,8),16,16;fn:(1,32),32,32;nxt:(0,22)=*(0,21),64,32;;SRC:t(0,23)=(0,21)frst:S(0,24)=*(0,23)skip:S(0,24)putnr:f(0,20)putfnm:f(0,20)putfnm_flush:f(0,20)putskip:F(0,20)tmp:(0,24)unskip:F(0,20)lst:(0,24)putsrc:F(0,20)dumpskip:f(0,20)dumpsrc:F(0,20)symbolic:f(0,1)fd:p(0,25)=*(2,1)tv:p(1,24)comwork:f(0,20)fd:p(0,25)buf:(0,26)=ar(7,33);0;511;(0,2)comment:F(0,20)col:S(0,1)lastfnm:S(1,32)lastdef:S(1,16)lastfrom:S(0,1)pangen4.cundostmnt:F(0,20)any_undo:F(0,1)any_oper:F(0,1)oper:p(0,1)check_proc:f(0,20)genunio:F(0,20)buf1:(0,21)=ar(7,33);0;255;(0,2)q:(0,22)=*(1,22)proper_enabler:F(0,1)guided.cloff_t:t(36,1)=(7,24)ino_t:t(36,2)=(7,20)dev_t:t(36,3)=(7,17)gid_t:t(36,4)=(7,19)mode_t:t(36,5)=(7,21)nlink_t:t(36,6)=(7,22)uid_t:t(36,7)=(7,18)off_t:t(36,8)=(7,23)pid_t:t(36,9)=(7,25)ssize_t:t(36,10)=(7,26)time_t:t(39,1)=(7,37)clockid_t:t(39,2)=(7,42)timer_t:t(39,3)=(7,43)int8_t:t(36,11)=(0,10)int16_t:t(36,12)=(0,8)int32_t:t(36,13)=(0,1)int64_t:t(36,14)=(0,6)u_int8_t:t(36,15)=(0,11)u_int16_t:t(36,16)=(0,9)u_int32_t:t(36,17)=(0,4)u_int64_t:t(36,18)=(0,7)register_t:t(36,19)=(0,1)blkcnt_t:t(36,20)=(7,47)fsblkcnt_t:t(36,21)=(7,49)fsfilcnt_t:t(36,22)=(7,51)/usr/include/sys/stat.h/usr/include/bits/stat.hstat:T(47,1)=s88st_dev:(7,17),0,64;__pad1:(0,9),64,16;st_ino:(7,20),96,32;st_mode:(7,21),128,32;st_nlink:(7,22),160,32;st_uid:(7,18),192,32;st_gid:(7,19),224,32;st_rdev:(7,17),256,64;__pad2:(0,9),320,16;st_size:(7,23),352,32;st_blksize:(7,46),384,32;st_blocks:(7,47),416,32;st_atime:(7,37),448,32;__unused1:(0,5),480,32;st_mtime:(7,37),512,32;__unused2:(0,5),544,32;st_ctime:(7,37),576,32;__unused3:(0,5),608,32;__unused4:(0,5),640,32;__unused5:(0,5),672,32;;TstOnly:G(0,1)whichproc:f(0,20)oX:(0,21)=*(1,40)newer:f(0,1)f1:p(7,36)f2:p(7,36)x:(47,1)y:(47,1)hookup:F(0,20)match_trail:F(0,20)nst:(0,1)dothis:(1,27)lost_trail:f(0,20)p:(0,1)l:(0,1)pc_value:F(0,1)pno:G(0,1)fd:S(0,23)=*(2,1)dstep.cLevel:G(0,1)GenCode:G(0,1)IsGuard:G(0,1)TestOnly:G(0,1)Tj:S(0,1)Jt:S(0,1)LastGoto:S(0,1)Sourced:f(0,20)special:p(0,1)Dested:f(0,20)Mopup:f(0,20)fd:p(0,21)=*(2,1)buf:(0,22)=ar(7,33);0;11;(0,2)FirstTime:f(0,1)illegal:f(0,20)filterbad:f(0,20)CollectGuards:f(0,1)fd:p(0,21)inh:p(0,1)h:(0,23)=*(1,30)ee:(1,27)putcode:F(0,1)nxt:p(1,27)justguards:p(0,1)isg:(0,1)buf:(0,24)=ar(7,33);0;63;(0,2)putCode:f(0,20)last:p(1,27)next:p(1,27)isguard:p(0,1)N:(1,27)NextOpt:(0,25)=ar(7,33);0;31;(0,2)bno:V(0,1)NextLab:G(0,26)=ar(7,33);0;63;(7,36)Tojump:S(0,27)=ar(7,33);0;1023;(0,1)Jumpto:S(0,27)Special:S(0,27)structs.cUType:T(0,21)=s12nm:(1,32),0,32;cn:(1,24),32,32;nxt:(0,22)=*(0,21),64,32;;UType:t(0,23)=(0,21)Unames:S(0,24)=*(0,23)Pnames:S(0,24)setuname:F(0,20)putUname:f(0,20)tmp:p(0,24)putunames:F(0,20)isutype:F(0,1)t:p(7,36)getuname:F(1,24)t:p(1,32)setutype:F(0,20)do_same:f(1,32)v:p(1,32)xinit:p(0,1)tmp:(1,24)ix:(0,1)Rval_struct:F(0,1)tl:(1,32)Lval_struct:F(0,1)a:p(0,1)Cnt_flds:F(0,1)Sym_typ:F(0,1)t:p(1,24)Width_set:F(0,1)wdth:p(1,13)ini_struct:F(0,20)cpnn:f(1,24)s:p(1,24)L:p(0,1)R:p(0,1)S:p(0,1)d:(1,24)full_name:F(0,1)hiddenarrays:(0,1)validref:F(0,20)c:p(1,24)lbuf:(0,26)=ar(7,33);0;511;(0,2)struct_name:F(0,20)buf:p(7,36)lbuf:(0,27)=ar(7,33);0;127;(0,2)walk2_struct:F(0,20)eprefix:(0,27)walk_struct:F(0,20)ofd:p(0,25)b:p(7,36)c:p(7,36)dump_struct:F(0,20)prefix:p(7,36)r:p(0,28)=*(1,40)jx:(0,1)pref:(0,27)retrieve:f(0,1)targ:p(0,29)=*(1,24)want:p(0,1)Ntyp:p(0,1)x:(1,24)is_explicit:f(0,1)expand:F(1,24)Ok:p(0,1)y:(1,24)mk_explicit:F(1,24)bld:(1,24)tail_add:F(1,24)setpname:F(0,20)isproctype:F(0,1)owner:G(1,32)pc_zpp.ctl_parse.ctl.hSymbol:T(1,1)=s8name:(7,36),0,32;next:(1,2)=*(1,1),32,32;;Symbol:t(1,3)=(1,1)Node:T(1,4)=s20ntyp:(0,8),0,16;sym:(1,2),32,32;lft:(1,5)=*(1,4),64,32;rgt:(1,5),96,32;nxt:(1,5),128,32;;Node:t(1,6)=(1,4)Graph:T(1,7)=s172name:(1,8)=*(1,3),0,32;incoming:(1,8),32,32;outgoing:(1,8),64,32;oldstring:(1,8),96,32;nxtstring:(1,8),128,32;New:(1,9)=*(1,6),160,32;Old:(1,9),192,32;Other:(1,9),224,32;Next:(1,9),256,32;isred:(1,10)=ar(7,33);0;63;(0,11),288,512;isgrn:(1,10),800,512;redcnt:(0,11),1312,8;grncnt:(0,11),1320,8;reachable:(0,11),1328,8;nxt:(1,11)=*(1,7),1344,32;;Graph:t(1,12)=(1,7)Mapping:T(1,13)=s12from:(7,36),0,32;to:(1,14)=*(1,12),32,32;nxt:(1,15)=*(1,13),64,32;;Mapping:t(1,16)=(1,13) :T(1,17)=eALWAYS:257,AND:258,EQUIV:259,EVENTUALLY:260,FALSE:261,IMPLIES:262,NOT:263,OR:264,PREDICATE:265,TRUE:266,U_OPER:267,V_OPER:268,;Nodeptr:t(1,18)=(1,9)tl_yychar:G(0,1)prec:S(0,21)=ar(7,33);0;1;(0,22)=ar(7,33);0;3;(0,1)tl_factor:f(1,9)ptr:(1,9)tl_level:f(1,9)nr:p(0,1)tl_formula:f(1,9)tl_parse:F(0,20)tl_yylval:G(1,18)tl_lex.ctst:p(0,21)=*(0,22)=f(0,1)buf:(0,23)=ar(8,33);0;31;(0,2)tl_yylex:F(0,1)tl_lex:f(0,1)tl_lookup:F(14,8)s:p(8,36)sp:(14,8)getsym:F(14,8)s:p(14,8)n:(14,8)symtab:S(0,24)=ar(8,33);0;255;(14,8)tl_main.cnewstates:G(0,1)tl_errs:G(0,1)tl_verbose:G(0,1)tl_terse:G(0,1)All_Mem:G(0,5)hasuform:S(0,1)cnt:S(0,1)tl_Getchar:F(0,1)put_uform:F(0,20)tl_UnGetchar:F(0,20)tl_main:F(0,1)argv:p(0,21)=*(7,36)tl_stats:f(0,20)dump:F(0,20)n:p(1,9)tl_explain:F(0,20)non_fatal:f(0,20)s1:p(7,36)s2:p(7,36)tl_yyerror:F(0,20)Fatal:F(0,20)uform:S(0,22)=ar(7,33);0;255;(0,2)tl_trans.cStack_mx:G(0,1)Max_Red:G(0,1)Total:G(0,1)Mapped:S(0,21)=*(1,16)Nodes_Set:S(1,14)Nodes_Stack:S(1,14)Red_cnt:S(0,1)Lab_cnt:S(0,1)Base:S(0,1)Stack_sz:S(0,1)dump_graph:f(0,20)g:p(1,14)n1:(1,9)push_stack:f(0,20)z:(1,8)pop_stack:f(1,14)g:(1,14)newname:f(7,36)cnt:V(0,1)buf:V(0,22)=ar(7,33);0;31;(0,2)has_clause:f(0,1)p:p(1,14)q:(1,9)mk_grn:f(0,20)p:(1,14)mk_red:f(0,20)liveness:f(0,20)findgraph:f(1,14)m:(0,21)Addout:f(0,20)to:p(7,36)from:p(7,36)s:(1,8)Dump_cond:f(0,1)pp:p(1,9)r:p(1,9)r2:p(1,9)frst:(0,1)dump_cond:F(0,1)choueka:f(0,1)count:p(0,1)incr_cnt:(0,1)delta:(0,1)set_prefix:f(0,1)pref:p(7,36)r2:p(1,14)fsm_trans:f(0,20)curnm:p(7,36)r:(1,14)prefix:(0,22)nwnm:(0,22)mkbuchi:f(0,20)curnm:(0,23)=ar(7,33);0;63;(0,2)dupSlist:f(1,8)s:p(1,8)p1:(1,8)p2:(1,8)p3:(1,8)d:(1,8)catSlist:f(1,8)a:p(1,8)b:p(1,8)tmp:(1,8)fixinit:f(0,20)orig:p(1,9)p1:(1,14)q1:(1,8)q2:(1,8)flatten:f(1,9)p:p(1,9)r:(1,9)z:(1,9)Duplicate:f(1,9)n2:(1,9)lst:(1,9)d:(1,9)ng:f(0,20)in:p(1,8)new:p(1,9)old:p(1,9)next:p(1,9)sdump:f(0,20)DoDump:F(1,8)not_new:f(0,1)q1:(1,14)tmp:(1,9)map:(0,21)n3:(1,9)expand:f(0,20)now:(1,9)nx:(1,9)can_release:(0,1)trans:F(0,20)op:(1,9)dumpbuf:S(0,24)=ar(7,33);0;2047;(0,2)tl_buchi.cTransition:T(0,21)=s16name:(1,8),0,32;cond:(1,9),32,32;redundant:(0,1),64,32;nxt:(0,22)=*(0,21),96,32;;Transition:t(0,23)=(0,21)State:T(0,24)=s20name:(1,8),0,32;trans:(0,25)=*(0,23),32,32;colors:(1,14),64,32;redundant:(0,11),96,8;accepting:(0,11),104,8;reachable:(0,11),112,8;nxt:(0,26)=*(0,24),128,32;;State:t(0,27)=(0,24)never:S(0,28)=*(0,27)sametrans:f(0,1)s:p(0,25)t:p(0,25)Prune:f(1,9)findstate:f(0,28)b:(0,28)altnm:(0,29)=ar(7,33);0;63;(0,2)Dfs:f(0,20)b:p(0,28)t:(0,25)retarget:f(0,20)To:(1,8)combination:f(1,9)s:p(1,9)t:p(1,9)nc:(1,9)mergetrans:f(0,20)s:(0,25)all_trans_match:f(0,1)a:p(0,28)found:(0,1)mergestates:f(0,20)a:(0,28)buf:(0,29)rev_trans:f(0,20)printstate:f(0,20)addtrans:F(0,20)col:p(1,14)op:p(1,9)fsm_print:F(0,20)tl_out:G(0,30)=*(2,1)tl_mem.cM:T(0,21)=u4size:(0,3),0,32;link:(0,22)=*(0,21),0,32;;tl_emalloc:F(0,19)U:p(0,1)m:(0,22)r:(0,3)u:(0,3)tfree:F(0,20)v:p(0,19)a_stats:F(0,20)p:(0,3)a:(0,3)f:(0,3)freelist:S(0,23)=ar(7,33);0;79;(0,22)req:S(0,24)=ar(7,33);0;79;(0,3)event:S(0,25)=ar(7,33);0;2;(0,24)tl_rewrt.ccan:S(1,9)right_linked:F(1,9)canonical:F(1,9)m:(1,9)push_negation:F(1,9)addcan:f(0,20)prev:(1,9)ptr:(0,21)=*(1,9)N:(1,9)t:(1,8)cmp:(0,1)marknode:f(0,20)m:p(1,9)Canonical:F(1,9)p:(1,9)k1:(1,9)k2:(1,9)tl_cache.cCache:T(0,21)=s16before:(1,9),0,32;after:(1,9),32,32;same:(0,1),64,32;nxt:(0,22)=*(0,21),96,32;;Cache:t(0,23)=(0,21)stored:S(0,24)=*(0,23)in_cache:F(1,9)d:(0,24)cached:F(1,9)cache_stats:F(0,20)releasenode:F(0,20)all_levels:p(0,1)tl_nn:F(1,9)ll:p(1,9)rl:p(1,9)n:(1,9)getnode:F(1,9)dupnode:F(1,9)isequal:F(0,1)a:p(1,9)b:p(1,9)ismatch:f(0,1)anywhere:F(0,1)srch:p(1,9)in:p(1,9)Caches:S(0,5)CacheHits:S(0,5)/usr/src/build/53700-i386/BUILD/glibc-2.2.4/io/stat.c../include/sys/stat.h../io/sys/stat.h../include/time.h../time/time.htime_t:t(14,1)=(8,37)dev_t:t(4,1)=(8,17)gid_t:t(4,2)=(8,19)ino_t:t(4,3)=(8,20)mode_t:t(4,4)=(8,21)nlink_t:t(4,5)=(8,22)off_t:t(4,6)=(8,23)uid_t:t(4,7)=(8,18)blkcnt_t:t(4,8)=(8,47)blksize_t:t(4,9)=(8,46)../sysdeps/unix/sysv/linux/bits/stat.hstat:T(16,1)=s88st_dev:(8,17),0,64;__pad1:(0,9),64,16;st_ino:(8,20),96,32;st_mode:(8,21),128,32;st_nlink:(8,22),160,32;st_uid:(8,18),192,32;st_gid:(8,19),224,32;st_rdev:(8,17),256,64;__pad2:(0,9),320,16;st_size:(8,23),352,32;st_blksize:(8,46),384,32;st_blocks:(8,47),416,32;st_atime:(8,37),448,32;__unused1:(0,5),480,32;st_mtime:(8,37),512,32;__unused2:(0,5),544,32;st_ctime:(8,37),576,32;__unused3:(0,5),608,32;__unused4:(0,5),640,32;__unused5:(0,5),672,32;;stat64:T(16,2)=s96st_dev:(8,17),0,64;__pad1:(0,4),64,32;__st_ino:(8,20),96,32;st_mode:(8,21),128,32;st_nlink:(8,22),160,32;st_uid:(8,18),192,32;st_gid:(8,19),224,32;st_rdev:(8,17),256,64;__pad2:(0,4),320,32;st_size:(8,54),352,64;st_blksize:(8,46),416,32;st_blocks:(8,48),448,64;st_atime:(8,37),512,32;__unused1:(0,5),544,32;st_mtime:(8,37),576,32;__unused2:(0,5),608,32;st_ctime:(8,37),640,32;__unused3:(0,5),672,32;st_ino:(8,53),704,64;;__stat:F(0,1)file:p(0,21)=*(0,2)buf:p(0,22)=*(16,1)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-98)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-98)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-98)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-85)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-98)01.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.0101.01.symtab.strtab.shstrtab.interp.note.ABI-tag.hash.dynsym.dynstr.gnu.version.gnu.version_r.rel.got.rel.bss.rel.plt.init.plt.text.fini.rodata.data.eh_frame.ctors.dtors.got.dynamic.sbss.bss.stab.stabstr.comment.note# 1((P7 xx?HHGoZToLL@c l  u 0 ~ppp juu  Y4e N ԾN ؾN N O 0P @@P @, @Ll ,4   2 > (xHL    p  N N N N O 0P @P    +2  = AN O [ qN   PP 0 ` N 2 @ @ N p N N N   K " - 5d AK V8% _ h qظ y` T, p  lP O hP ܾ2 Dz ;  P< @ D X ^ P <  &DC .V 5h H8  CJ S ] gn u ~     0 4 8 < @  U  T 4  T D X    @U  DU  \U LU HU PU TU XU `U $+ 1 7/7 =5 CL1M I, Pp>x X:K c< mt    D K L P HL{ LR  T dO. PF hUu 8Sl dU 4Y  'Xv 1t] :x D|p I$c SU ^c kd tt ~lwT   $ t  Ȍo  \   (  3H# % @ & &  ' h|' $' <' t$P) P*) 80) 46 *  9,* =4*  AT* Gl* Mt* P* S* V* Y* \\+ <`<+ Dd+ g+ k+ $q+ u@, {T- X/ \/ `/ d/ h/  8@ g      G / P8 ܯ< 8 / `@3 #;  'F p+M 0M :f @? N, [ h  p, G  M D V X | V V | P V Q h V V  x P l 4& |K  v .\v 7\D{ A$ H S b pL |V \  @p t N N LEP V Eg V ,W F. G6 V L LKo K $fy /8nJ B og H@W Ku V^N a N d$N mv u`W |`w Hw `g x) Dzk zS { |  (N ,N 0N    5 ܜ_  <   ' `N  , D 6 % A ( J qw |Z S _ ` Z d N m N q ` w >   N  N  N  N  N  N  N  <V  @/ N  `   p.      @   & x 0 $Y 7  A  I h T  ^ Կ f  o  x  p l k </     N  M d  z d L( t      , '  2 ; A @J @N Y N ] ` d 8 m x N  Ě     |$p  l LF  H  \)g  : NM  FG D   Sf  QP  p % <E , >> F VM R  [ ,m D w T Ț   A @ tov ft   LM  l & \  < b  O  (>  P/  d9 ( = 1 | ;  F y N X X d b  n xM u @ x L"  @/ ̚   \&  A D   <}  L/  <'  N #Dt +\ 5l-Hd~ R Zا c|ulM yh : h Fn K* T/  '   К `@vk TM M 6  &@ h $,>C . 2H 5 ?Ԛ E4NPM Xd aĬ n s  z  xL Tx \m (U?  d C + 8 N hM EJ  X z    tM &_ -$ 4N <t D M ST  Z b k@N u3 ~ؚ ̥ ps ` !  ̉-܉4 '*  dI  z $ /L 8"[jM h nw uXM Bt  ] `8 L> @P DP  ܚ x 0     `  ^M &$I% ./AW J S^ a g mN uq <& le P   T XM  D\M X` h~  2 p  )o  *(W 2 7@H$_ P<+ VH ^` ffy n u$&/ ~   ( ( ,  @N `   G 0 lK. $^Y o N  P f dL (x. /8 5PXg ?L&C IZM PN Y c8f l| vL T P  `M | <  ` ~7 t  o [ 4Fc   P 0P "A3 *o 2hr >4  CxlG R X|M _HhLdM   a N pM \]l N    N  =3 |2"X[ +` 0, :@H[ HqZRM cX gO r @| ج L9| U ! |      h  ".X  4` < B N T|4 `$]O kH^@ s|o zbM ̊tHM ܊+D   '"  l    G X, - 0P N *:N Bl G{ O` Y^ cN k8$ p\hx N ~$ tDI  hHP + (LP  @z tO fM 0,  +  ؤ & / 6 ?,P W b4* h, o |# lS f L\  Ċl   <-x  d  L%  'e 1 : ? Fd L0L S Z \ gP q x p \Zb initfini.cgcc2_compiled.call_gmon_startinit.ccrtstuff.cp.0__DTOR_LIST__completed.1__do_global_dtors_aux__EH_FRAME_BEGIN__fini_dummyobject.2frame_dummyinit_dummyforce_to_data__CTOR_LIST____do_global_ctors_aux__CTOR_END____DTOR_END____FRAME_END__y.tab.cyyrcsidEmbeddedinEventMaphas_iniyygrowstackspinlex.cin_commentnotquoteisalpha_isdigit_getwordgetinlineuninlinefollowdef_inlineseqnamesiseqnameReDiRectdo_directivelexcheck_nameNameslast.0hold.1IArg_nst.2sym.clast_namesamenamesymtabsetonexusetallxuputtypesymvarxxchan_checkvars.cmaxcolnrgetglobalsetglobalmain.cIsAsgnOrIsAsgnOperatorKeywordFunctionadd_ltlltl_filenvr_filePreCntPreProcout1PreArgexplainSameps_msc.cPsPrepspnoldepthTotStepsScalerpfdIProcLineRDMTLmaxxmesg.cn_remq_rema_snds_snda_rcvsa_sndsr_talkdifcolumnsdocolumnsflow.cbreakstackcur_sUniquebreak_idRjumpslocalnew_elif_sequnless_seqhas_chanrefadd_elset_labescape_elattach_escapemov_labcolonsinnermostwalk_atomicsched.cPriority_Sumsetlocalsformdumpsetparamstalkp_blockedis_blockedsilent_movespickprocaddsymboloneparamlastnever.0run.cSeedE_Checkeval_syncassignnonprogresspc_enabledinterprintEnabled1pangen1.cCode2HeaderAddp0Addp1Addq0Addq1Addq11Addq2Addq3Addq4Addq5Code0R0R0aR0bCode1Code3R2R3R4R5R6R8aR8bR9R10R10_5R12ProtoSvMapLstSetacceptorsprogressorsnBitsTypesreverse_namesput_ptypedoglobaldohiddentc_predef_npput_pinitend_labslndo_initblogncasespangen2.cPreambleTailDfaXptuniqAllGlobalfprocreverse_procstm_predef_nptt_predef_npputprocgenconditionalsfind_iddolenBBDocaseDetput_seqaddTpeT_sumTPEcnt_seqTpeEPTtyp_seqhiddenT_musNngetNidvalTpeput_escpput_subpatch_atomicscan_seqscan_seq_cpormark_seq_cpormark_seqgetweightput_elhas_globalmax_safe_levelnested_unlessfind_targett_cycglob_argsglob_args_cporsafety_level_nameBailoutpangen3.cfrstskipputnrcolputfnmlastfnmlastfromputfnm_flushdumpskiplastdefsymboliccomworkpangen4.ccheck_procguided.cwhichprocnewerfdlost_traildstep.cTjJtLastGotoSourcedTojumpSpecialDestedJumptoMopupFirstTimeillegalfilterbadCollectGuardsputCodebno.0structs.cUnamesPnamesputUnamedo_samecpnnretrieveis_explicitpc_zpp.ctl_parse.cprectl_factortl_formulatl_leveltl_lex.ctl_lextl_main.chasuformcntuformtl_statsnon_fataltl_trans.cMappedNodes_SetNodes_StackRed_cntLab_cntBaseStack_szdump_graphpush_stackpop_stackcnt.0buf.1newnamehas_clausemk_grnmk_redlivenessfindgraphAddoutDump_condchouekaset_prefixfsm_transmkbuchidupSlistcatSlistfixinitngflattenDuplicatesdumpdumpbufnot_newexpandtl_buchi.cneversametransPrunefindstateDfsretargetcombinationmergetransall_trans_matchmergestatesrev_transprintstatetl_mem.ceventfreelistreqtl_rewrt.ccanaddcanmarknodetl_cache.cstoredCacheHitsCachesismatchstat.cputboxgetchar@@GLIBC_2.0rem_labeval_suba_statsIArgsqlentrackvarsetxusterseclose_seqdumpclaimprocadd_seqmk_skipgensvmappslinerename@@GLIBC_2.0columnshas_enabledcast_valstrchr@@GLIBC_2.0unrem_Seqtail_addyystacksizeEtimeoutssetmtypesr_bufhookupany_operHave_claimnocastschedlookuppnoungetc@@GLIBC_2.0wrapupMH_DYNAMICwalk_structinteractiveu_synctl_GetcharaddtranstrapwonlySkip_claimfindlocputunamestl_yylvalgenaddqueueLowLvltb__register_frame_info@@GLIBC_2.0tl_emallocgenotheryyerrflagyysindexstrcmp@@GLIBC_2.0LastXdoqthhas_remotedumpclaims_fp_hwyytextNparsgetsymisequaltl_verbosehas_typrunstmntsfprintf@@GLIBC_2.0dumplocalverbosetl_yylexfflush@@GLIBC_2.0mstyytabledumpglobalsunlink@@GLIBC_2.0labtabtl_outunskipyyparseu_async__statlike_javano_wrapupyysslimyydefredpc_valuehas_badelseproc_cntsymdumpqhqmakeRandqishiddennqstcputlegendyyvspyyrindexno_arrayssetpnametl_UnGetcharqtabgensrcIArgnofirstrowhashget_labprehinthas_labrdyWidth_setnochan_manipR14nnTotalevalindexcross_dstepsElcntfull_namecanonicaleventmapsystem@@GLIBC_2.0eventmapnrenablepstexttl_errscpyfilesputtype_inityywrapdumptabsetptypetl_yycharputarrowyysspchecktypemalloc@@GLIBC_2.0tmpnam@@GLIBC_2.0in_cachereleasenodeFataltl_yyerrorfscanf@@GLIBC_2.0scanf@@GLIBC_2.0ltabwalk2_structoMHdo_unlessgetlocaltl_explaincur_proc__deregister_frame_info@@GLIBC_2.0withprocnameRvoussetvalhas_pcvalueputremotestepnumberisalnum_putnamestdout@@GLIBC_2.0stderr@@GLIBC_2.0Lval_structyynerrsgenheadersetutypetrackchanuseyyoutdepthXu_ListCaccesshas_randomdumpsrc__xstat@@GLIBC_2.0find_labrealreadpush_negationxspinyyvalAll_Memcomplete_rendezfatalany_undotl_lookupcolboxAl_ElNidmake_atomictime@@GLIBC_2.0has_sortedstart_claimremotelabNtimeoutsprep_inline_startDstepStartq_is_synclimited_vishunteleyyssfgets@@GLIBC_2.0ismtypeqrecvcontextNextLabgenuniodo_varputstmntTvalBufqfullini_structstrlen@@GLIBC_2.0MparsInlinertl_terseownerCnt_fldsnprocputsrcrm_selfrefsseqlistannouncenewstatesNamesNotAddedtmchanaccessemalloctyp_cktl_nnpushbreakcnt_mparshas_npTestOnlyfsm_printcheckvarDone_casecls_depthttrev_escapealldonehas_xuputpostludeyylenstrncmp@@GLIBC_2.0analyzeputcodemk_explicitoFnamematch_trailpickup_inlineputskipFnamevalidref__bss_startsr_mesgdolocaldump_structmainproper_enablernstopTopLvlyygindex__libc_start_main@@GLIBC_2.0has_providedtfrees_trailCanonicalStack_mxclaimnrrealloc@@GLIBC_2.0strcat@@GLIBC_2.0InliningMax_Redtyp2cdata_startGenCodeqhideprintf@@GLIBC_2.0runnableyyinsetaccess_finigetnodememcpy@@GLIBC_2.0has_lastPidisproctypeIArg_contrunfclose@@GLIBC_2.1__sysv_signal@@GLIBC_2.0tl_mainchannmfix_desttl_parseputpreludenr_errsstruct_nameyydebughuntstartstartpagepreprocess__cxa_finalize@@GLIBC_2.1.3SranddupnodenrRdyRval_structtranscache_statsfind_maxelcommentp_talkhas_unlessexit@@GLIBC_2.0yydgotoOkBreakatoi@@GLIBC_2.0rem_SeqExpand_Okstatcachedputpagesjumpstepsremotevarbreak_destsscanf@@GLIBC_2.0_edata_GLOBAL_OFFSET_TABLE_free@@GLIBC_2.0IsGuard_endwhorunscls_beginundostmntTstOnlyevalyycheckLeveltrackrunopen_seqmemset@@GLIBC_2.0__ctype_b@@GLIBC_2.0R13stdin@@GLIBC_2.0Inline_stubsetlocalisutype_isokR15anywherestrncpy@@GLIBC_2.0checkrunyylvalntimesno_printchnameLastStepfopen@@GLIBC_2.1m_lossMadeChoiceqsendgetvalright_linkedput_uform_IO_stdin_usedDoDumpputgridreadyyylexgetunameyylhsrunsafesprintf@@GLIBC_2.0Sym_typ__data_startgenhierarchyspitbox_IO_getc@@GLIBC_2.0dotagEnabled0dump_condsetunameyyvsyycharMtypetargetntrailXgenaddprocall_nameslineno__gmon_start__yyerrorstrcpy@@GLIBC_2.0dumplabels